./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/array-eq-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/array-eq-symm.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 6897befed0dbbae24492a1e82d50fcd0be6b3857b241d882a904d02a513d7a6d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:16:32,368 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:16:32,426 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:16:32,430 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:16:32,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:16:32,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:16:32,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:16:32,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:16:32,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:16:32,453 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:16:32,453 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:16:32,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:16:32,454 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:16:32,454 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:16:32,454 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:16:32,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:16:32,455 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:16:32,455 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:16:32,455 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:16:32,455 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:16:32,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:16:32,455 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:16:32,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:16:32,455 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:16:32,455 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:16:32,455 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:16:32,455 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:16:32,455 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:16:32,455 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:16:32,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:16:32,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:16:32,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:16:32,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:16:32,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:16:32,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:16:32,456 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:16:32,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:16:32,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:16:32,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:16:32,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:16:32,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:16:32,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:16:32,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:16:32,456 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 -> 6897befed0dbbae24492a1e82d50fcd0be6b3857b241d882a904d02a513d7a6d [2025-03-04 02:16:32,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:16:32,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:16:32,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:16:32,696 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:16:32,697 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:16:32,698 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/array-eq-symm.wvr.c [2025-03-04 02:16:33,938 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2afc71a/290ac57d26614befbfe03211e1ecb697/FLAG5c3526571 [2025-03-04 02:16:34,259 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:16:34,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/array-eq-symm.wvr.c [2025-03-04 02:16:34,267 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2afc71a/290ac57d26614befbfe03211e1ecb697/FLAG5c3526571 [2025-03-04 02:16:34,525 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2afc71a/290ac57d26614befbfe03211e1ecb697 [2025-03-04 02:16:34,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:16:34,529 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:16:34,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:16:34,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:16:34,533 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:16:34,534 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:16:34" (1/1) ... [2025-03-04 02:16:34,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c8443b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34, skipping insertion in model container [2025-03-04 02:16:34,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:16:34" (1/1) ... [2025-03-04 02:16:34,549 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:16:34,651 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/array-eq-symm.wvr.c[2277,2290] [2025-03-04 02:16:34,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:16:34,665 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:16:34,676 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/array-eq-symm.wvr.c[2277,2290] [2025-03-04 02:16:34,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:16:34,688 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:16:34,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34 WrapperNode [2025-03-04 02:16:34,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:16:34,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:16:34,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:16:34,690 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:16:34,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34" (1/1) ... [2025-03-04 02:16:34,699 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34" (1/1) ... [2025-03-04 02:16:34,711 INFO L138 Inliner]: procedures = 22, calls = 19, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 99 [2025-03-04 02:16:34,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:16:34,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:16:34,712 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:16:34,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:16:34,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34" (1/1) ... [2025-03-04 02:16:34,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34" (1/1) ... [2025-03-04 02:16:34,721 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34" (1/1) ... [2025-03-04 02:16:34,731 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-04 02:16:34,731 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34" (1/1) ... [2025-03-04 02:16:34,731 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34" (1/1) ... [2025-03-04 02:16:34,736 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34" (1/1) ... [2025-03-04 02:16:34,736 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34" (1/1) ... [2025-03-04 02:16:34,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34" (1/1) ... [2025-03-04 02:16:34,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34" (1/1) ... [2025-03-04 02:16:34,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:16:34,740 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:16:34,740 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:16:34,740 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:16:34,741 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34" (1/1) ... [2025-03-04 02:16:34,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:16:34,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:16:34,764 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-04 02:16:34,772 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-04 02:16:34,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:16:34,786 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:16:34,786 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:16:34,786 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:16:34,786 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:16:34,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:16:34,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:16:34,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:16:34,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:16:34,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:16:34,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:16:34,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:16:34,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:16:34,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:16:34,787 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:16:34,861 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:16:34,862 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:16:35,111 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:16:35,111 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:16:35,274 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:16:35,274 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:16:35,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:16:35 BoogieIcfgContainer [2025-03-04 02:16:35,274 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:16:35,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:16:35,276 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:16:35,279 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:16:35,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:16:34" (1/3) ... [2025-03-04 02:16:35,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aece2f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:16:35, skipping insertion in model container [2025-03-04 02:16:35,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:16:34" (2/3) ... [2025-03-04 02:16:35,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aece2f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:16:35, skipping insertion in model container [2025-03-04 02:16:35,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:16:35" (3/3) ... [2025-03-04 02:16:35,283 INFO L128 eAbstractionObserver]: Analyzing ICFG array-eq-symm.wvr.c [2025-03-04 02:16:35,292 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:16:35,293 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array-eq-symm.wvr.c that has 3 procedures, 23 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-04 02:16:35,293 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:16:35,333 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:16:35,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 70 flow [2025-03-04 02:16:35,404 INFO L124 PetriNetUnfolderBase]: 6/26 cut-off events. [2025-03-04 02:16:35,407 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:16:35,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 6/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-03-04 02:16:35,410 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 28 transitions, 70 flow [2025-03-04 02:16:35,414 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 25 transitions, 62 flow [2025-03-04 02:16:35,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:16:35,427 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;@478d42e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:16:35,428 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:16:35,434 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:16:35,434 INFO L124 PetriNetUnfolderBase]: 6/24 cut-off events. [2025-03-04 02:16:35,434 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:16:35,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:35,435 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:35,435 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-04 02:16:35,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:35,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1405653252, now seen corresponding path program 1 times [2025-03-04 02:16:35,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:35,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25240328] [2025-03-04 02:16:35,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:16:35,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:35,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:16:35,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:16:35,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:35,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:35,790 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-04 02:16:35,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:35,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25240328] [2025-03-04 02:16:35,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25240328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:16:35,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:16:35,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:16:35,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117621124] [2025-03-04 02:16:35,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:35,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:16:35,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:35,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:16:35,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:16:35,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:16:35,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:35,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:35,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:16:35,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:35,935 INFO L124 PetriNetUnfolderBase]: 171/287 cut-off events. [2025-03-04 02:16:35,935 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-04 02:16:35,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 287 events. 171/287 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1110 event pairs, 35 based on Foata normal form. 1/242 useless extension candidates. Maximal degree in co-relation 501. Up to 159 conditions per place. [2025-03-04 02:16:35,939 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 29 selfloop transitions, 3 changer transitions 1/38 dead transitions. [2025-03-04 02:16:35,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 38 transitions, 163 flow [2025-03-04 02:16:35,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:16:35,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:16:35,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-03-04 02:16:35,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2025-03-04 02:16:35,950 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 62 flow. Second operand 3 states and 55 transitions. [2025-03-04 02:16:35,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 38 transitions, 163 flow [2025-03-04 02:16:35,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 38 transitions, 149 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:16:35,956 INFO L231 Difference]: Finished difference. Result has 25 places, 27 transitions, 73 flow [2025-03-04 02:16:35,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=25, PETRI_TRANSITIONS=27} [2025-03-04 02:16:35,960 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2025-03-04 02:16:35,960 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 27 transitions, 73 flow [2025-03-04 02:16:35,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:35,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:35,960 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:35,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:16:35,960 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-04 02:16:35,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:35,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665684, now seen corresponding path program 1 times [2025-03-04 02:16:35,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:35,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053530087] [2025-03-04 02:16:35,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:16:35,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:35,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:16:35,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:16:35,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:35,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:36,084 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-04 02:16:36,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:36,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053530087] [2025-03-04 02:16:36,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053530087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:16:36,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:16:36,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:16:36,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029234995] [2025-03-04 02:16:36,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:36,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:16:36,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:36,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:16:36,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:16:36,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:16:36,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 27 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-04 02:16:36,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:36,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:16:36,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:36,236 INFO L124 PetriNetUnfolderBase]: 222/394 cut-off events. [2025-03-04 02:16:36,237 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-04 02:16:36,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 842 conditions, 394 events. 222/394 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1756 event pairs, 112 based on Foata normal form. 14/392 useless extension candidates. Maximal degree in co-relation 318. Up to 268 conditions per place. [2025-03-04 02:16:36,241 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 36 selfloop transitions, 5 changer transitions 0/46 dead transitions. [2025-03-04 02:16:36,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 46 transitions, 204 flow [2025-03-04 02:16:36,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:16:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:16:36,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-03-04 02:16:36,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2025-03-04 02:16:36,242 INFO L175 Difference]: Start difference. First operand has 25 places, 27 transitions, 73 flow. Second operand 5 states and 74 transitions. [2025-03-04 02:16:36,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 46 transitions, 204 flow [2025-03-04 02:16:36,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 46 transitions, 200 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:16:36,244 INFO L231 Difference]: Finished difference. Result has 31 places, 31 transitions, 106 flow [2025-03-04 02:16:36,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=106, PETRI_PLACES=31, PETRI_TRANSITIONS=31} [2025-03-04 02:16:36,244 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2025-03-04 02:16:36,244 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 31 transitions, 106 flow [2025-03-04 02:16:36,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-04 02:16:36,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:36,244 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:36,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:16:36,245 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-04 02:16:36,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:36,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1270063928, now seen corresponding path program 1 times [2025-03-04 02:16:36,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:36,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814967801] [2025-03-04 02:16:36,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:16:36,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:36,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:16:36,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:16:36,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:36,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:36,380 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-04 02:16:36,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:36,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814967801] [2025-03-04 02:16:36,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814967801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:16:36,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:16:36,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:16:36,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815883885] [2025-03-04 02:16:36,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:36,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:16:36,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:36,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:16:36,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:16:36,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:16:36,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 31 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-04 02:16:36,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:36,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:16:36,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:36,485 INFO L124 PetriNetUnfolderBase]: 185/326 cut-off events. [2025-03-04 02:16:36,486 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-04 02:16:36,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 722 conditions, 326 events. 185/326 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1328 event pairs, 90 based on Foata normal form. 5/316 useless extension candidates. Maximal degree in co-relation 634. Up to 268 conditions per place. [2025-03-04 02:16:36,489 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 21 selfloop transitions, 2 changer transitions 13/41 dead transitions. [2025-03-04 02:16:36,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 206 flow [2025-03-04 02:16:36,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:16:36,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:16:36,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2025-03-04 02:16:36,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 02:16:36,491 INFO L175 Difference]: Start difference. First operand has 31 places, 31 transitions, 106 flow. Second operand 5 states and 70 transitions. [2025-03-04 02:16:36,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 206 flow [2025-03-04 02:16:36,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 200 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 02:16:36,492 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 90 flow [2025-03-04 02:16:36,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2025-03-04 02:16:36,493 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2025-03-04 02:16:36,493 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 90 flow [2025-03-04 02:16:36,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-04 02:16:36,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:36,493 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:36,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:16:36,493 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-04 02:16:36,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:36,496 INFO L85 PathProgramCache]: Analyzing trace with hash 885168794, now seen corresponding path program 1 times [2025-03-04 02:16:36,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:36,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709330194] [2025-03-04 02:16:36,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:16:36,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:36,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 02:16:36,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:16:36,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:36,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:36,630 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-04 02:16:36,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:36,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709330194] [2025-03-04 02:16:36,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709330194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:16:36,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:16:36,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:16:36,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372659321] [2025-03-04 02:16:36,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:36,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:16:36,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:36,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:16:36,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:16:36,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:16:36,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:36,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:36,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:16:36,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:36,745 INFO L124 PetriNetUnfolderBase]: 259/461 cut-off events. [2025-03-04 02:16:36,745 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2025-03-04 02:16:36,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 461 events. 259/461 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2086 event pairs, 105 based on Foata normal form. 14/463 useless extension candidates. Maximal degree in co-relation 1027. Up to 188 conditions per place. [2025-03-04 02:16:36,750 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 46 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2025-03-04 02:16:36,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 57 transitions, 281 flow [2025-03-04 02:16:36,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:16:36,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:16:36,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2025-03-04 02:16:36,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 02:16:36,751 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 90 flow. Second operand 5 states and 84 transitions. [2025-03-04 02:16:36,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 57 transitions, 281 flow [2025-03-04 02:16:36,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 57 transitions, 259 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-03-04 02:16:36,754 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 115 flow [2025-03-04 02:16:36,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2025-03-04 02:16:36,755 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2025-03-04 02:16:36,755 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 115 flow [2025-03-04 02:16:36,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:36,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:36,756 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:36,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:16:36,756 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-04 02:16:36,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:36,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1825509966, now seen corresponding path program 1 times [2025-03-04 02:16:36,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:36,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134128692] [2025-03-04 02:16:36,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:16:36,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:36,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 02:16:36,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:16:36,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:36,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:36,859 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-04 02:16:36,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:36,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134128692] [2025-03-04 02:16:36,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134128692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:16:36,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:16:36,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:16:36,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904363709] [2025-03-04 02:16:36,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:36,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:16:36,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:36,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:16:36,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:16:36,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:16:36,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:36,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:36,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:16:36,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:36,953 INFO L124 PetriNetUnfolderBase]: 262/463 cut-off events. [2025-03-04 02:16:36,954 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2025-03-04 02:16:36,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1065 conditions, 463 events. 262/463 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1969 event pairs, 87 based on Foata normal form. 5/457 useless extension candidates. Maximal degree in co-relation 1042. Up to 213 conditions per place. [2025-03-04 02:16:36,956 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 32 selfloop transitions, 5 changer transitions 9/51 dead transitions. [2025-03-04 02:16:36,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 51 transitions, 263 flow [2025-03-04 02:16:36,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:16:36,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:16:36,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2025-03-04 02:16:36,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2025-03-04 02:16:36,957 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 115 flow. Second operand 5 states and 78 transitions. [2025-03-04 02:16:36,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 51 transitions, 263 flow [2025-03-04 02:16:36,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 51 transitions, 258 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:16:36,958 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 127 flow [2025-03-04 02:16:36,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2025-03-04 02:16:36,959 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 12 predicate places. [2025-03-04 02:16:36,959 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 127 flow [2025-03-04 02:16:36,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:36,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:36,959 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:36,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:16:36,959 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-04 02:16:36,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:36,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1383405154, now seen corresponding path program 1 times [2025-03-04 02:16:36,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:36,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037607028] [2025-03-04 02:16:36,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:16:36,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:36,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:16:36,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:16:36,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:36,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:37,112 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-04 02:16:37,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:37,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037607028] [2025-03-04 02:16:37,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037607028] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:37,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517342710] [2025-03-04 02:16:37,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:16:37,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:16:37,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:16:37,118 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-04 02:16:37,122 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-04 02:16:37,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:16:37,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:16:37,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:37,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:37,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:16:37,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:16:37,339 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-04 02:16:37,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:16:37,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:16:37,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517342710] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:37,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:16:37,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 13 [2025-03-04 02:16:37,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647555345] [2025-03-04 02:16:37,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:37,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:16:37,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:37,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:16:37,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:16:37,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2025-03-04 02:16:37,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 127 flow. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:37,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:37,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2025-03-04 02:16:37,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:37,648 INFO L124 PetriNetUnfolderBase]: 312/533 cut-off events. [2025-03-04 02:16:37,648 INFO L125 PetriNetUnfolderBase]: For 244/244 co-relation queries the response was YES. [2025-03-04 02:16:37,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 533 events. 312/533 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2233 event pairs, 88 based on Foata normal form. 16/545 useless extension candidates. Maximal degree in co-relation 1309. Up to 201 conditions per place. [2025-03-04 02:16:37,652 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 40 selfloop transitions, 8 changer transitions 0/52 dead transitions. [2025-03-04 02:16:37,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 291 flow [2025-03-04 02:16:37,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:16:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:16:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2025-03-04 02:16:37,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44387755102040816 [2025-03-04 02:16:37,656 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 127 flow. Second operand 7 states and 87 transitions. [2025-03-04 02:16:37,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 291 flow [2025-03-04 02:16:37,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 52 transitions, 276 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-04 02:16:37,662 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 148 flow [2025-03-04 02:16:37,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=148, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2025-03-04 02:16:37,663 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 14 predicate places. [2025-03-04 02:16:37,664 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 148 flow [2025-03-04 02:16:37,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:37,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:37,664 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:37,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 02:16:37,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 02:16:37,865 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-04 02:16:37,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:37,866 INFO L85 PathProgramCache]: Analyzing trace with hash 30139584, now seen corresponding path program 1 times [2025-03-04 02:16:37,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:37,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188933688] [2025-03-04 02:16:37,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:16:37,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:37,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:16:37,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:16:37,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:37,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:38,012 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-04 02:16:38,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:38,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188933688] [2025-03-04 02:16:38,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188933688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:38,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200341997] [2025-03-04 02:16:38,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:16:38,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:16:38,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:16:38,016 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-04 02:16:38,019 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-04 02:16:38,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:16:38,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:16:38,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:38,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:38,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 02:16:38,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:16:38,179 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-04 02:16:38,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:16:38,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:16:38,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200341997] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:38,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:16:38,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 13 [2025-03-04 02:16:38,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789907390] [2025-03-04 02:16:38,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:38,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:16:38,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:38,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:16:38,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:16:38,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2025-03-04 02:16:38,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 148 flow. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:38,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:38,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2025-03-04 02:16:38,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:38,419 INFO L124 PetriNetUnfolderBase]: 320/594 cut-off events. [2025-03-04 02:16:38,419 INFO L125 PetriNetUnfolderBase]: For 436/436 co-relation queries the response was YES. [2025-03-04 02:16:38,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1533 conditions, 594 events. 320/594 cut-off events. For 436/436 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2696 event pairs, 122 based on Foata normal form. 0/572 useless extension candidates. Maximal degree in co-relation 1503. Up to 203 conditions per place. [2025-03-04 02:16:38,423 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 47 selfloop transitions, 8 changer transitions 0/59 dead transitions. [2025-03-04 02:16:38,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 354 flow [2025-03-04 02:16:38,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:16:38,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:16:38,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2025-03-04 02:16:38,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-03-04 02:16:38,426 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 148 flow. Second operand 7 states and 91 transitions. [2025-03-04 02:16:38,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 354 flow [2025-03-04 02:16:38,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 332 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-03-04 02:16:38,427 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 162 flow [2025-03-04 02:16:38,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=162, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2025-03-04 02:16:38,428 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 18 predicate places. [2025-03-04 02:16:38,428 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 162 flow [2025-03-04 02:16:38,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:38,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:38,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:38,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 02:16:38,634 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,SelfDestructingSolverStorable6 [2025-03-04 02:16:38,634 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-04 02:16:38,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:38,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1743569289, now seen corresponding path program 1 times [2025-03-04 02:16:38,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:38,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823926576] [2025-03-04 02:16:38,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:16:38,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:38,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:16:38,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:16:38,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:38,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:38,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:16:38,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:38,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823926576] [2025-03-04 02:16:38,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823926576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:16:38,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:16:38,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:16:38,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836171847] [2025-03-04 02:16:38,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:38,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:16:38,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:38,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:16:38,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:16:38,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:16:38,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 162 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:38,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:38,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:16:38,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:39,166 INFO L124 PetriNetUnfolderBase]: 302/577 cut-off events. [2025-03-04 02:16:39,168 INFO L125 PetriNetUnfolderBase]: For 482/482 co-relation queries the response was YES. [2025-03-04 02:16:39,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1571 conditions, 577 events. 302/577 cut-off events. For 482/482 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2634 event pairs, 80 based on Foata normal form. 4/579 useless extension candidates. Maximal degree in co-relation 1540. Up to 431 conditions per place. [2025-03-04 02:16:39,171 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 38 selfloop transitions, 11 changer transitions 5/59 dead transitions. [2025-03-04 02:16:39,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 352 flow [2025-03-04 02:16:39,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:16:39,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:16:39,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2025-03-04 02:16:39,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 02:16:39,172 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 162 flow. Second operand 7 states and 98 transitions. [2025-03-04 02:16:39,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 352 flow [2025-03-04 02:16:39,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 332 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-04 02:16:39,174 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 224 flow [2025-03-04 02:16:39,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2025-03-04 02:16:39,175 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 22 predicate places. [2025-03-04 02:16:39,175 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 224 flow [2025-03-04 02:16:39,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:39,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:39,175 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:39,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:16:39,175 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-04 02:16:39,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:39,176 INFO L85 PathProgramCache]: Analyzing trace with hash -499648973, now seen corresponding path program 2 times [2025-03-04 02:16:39,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:39,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210777068] [2025-03-04 02:16:39,177 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:16:39,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:39,184 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:16:39,222 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:16:39,223 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:16:39,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:39,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:16:39,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:39,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210777068] [2025-03-04 02:16:39,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210777068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:16:39,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:16:39,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:16:39,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795095572] [2025-03-04 02:16:39,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:39,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:16:39,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:39,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:16:39,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:16:39,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:16:39,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 224 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:39,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:39,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:16:39,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:39,683 INFO L124 PetriNetUnfolderBase]: 300/569 cut-off events. [2025-03-04 02:16:39,683 INFO L125 PetriNetUnfolderBase]: For 543/543 co-relation queries the response was YES. [2025-03-04 02:16:39,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1715 conditions, 569 events. 300/569 cut-off events. For 543/543 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2528 event pairs, 89 based on Foata normal form. 4/572 useless extension candidates. Maximal degree in co-relation 1685. Up to 431 conditions per place. [2025-03-04 02:16:39,689 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 39 selfloop transitions, 12 changer transitions 8/64 dead transitions. [2025-03-04 02:16:39,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 64 transitions, 443 flow [2025-03-04 02:16:39,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:16:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:16:39,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2025-03-04 02:16:39,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 02:16:39,690 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 224 flow. Second operand 7 states and 98 transitions. [2025-03-04 02:16:39,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 64 transitions, 443 flow [2025-03-04 02:16:39,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 64 transitions, 425 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-04 02:16:39,694 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 288 flow [2025-03-04 02:16:39,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=288, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2025-03-04 02:16:39,694 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 29 predicate places. [2025-03-04 02:16:39,694 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 288 flow [2025-03-04 02:16:39,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:39,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:39,695 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:39,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:16:39,695 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-04 02:16:39,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:39,695 INFO L85 PathProgramCache]: Analyzing trace with hash -2040034841, now seen corresponding path program 1 times [2025-03-04 02:16:39,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:39,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980977452] [2025-03-04 02:16:39,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:16:39,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:39,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:16:39,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:16:39,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:39,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:39,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:16:39,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:39,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980977452] [2025-03-04 02:16:39,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980977452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:16:39,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:16:39,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:16:39,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861316353] [2025-03-04 02:16:39,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:39,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:16:39,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:39,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:16:39,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:16:39,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:16:39,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 288 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:39,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:39,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:16:39,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:40,124 INFO L124 PetriNetUnfolderBase]: 297/566 cut-off events. [2025-03-04 02:16:40,124 INFO L125 PetriNetUnfolderBase]: For 688/688 co-relation queries the response was YES. [2025-03-04 02:16:40,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1845 conditions, 566 events. 297/566 cut-off events. For 688/688 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2537 event pairs, 83 based on Foata normal form. 5/570 useless extension candidates. Maximal degree in co-relation 1811. Up to 431 conditions per place. [2025-03-04 02:16:40,128 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 37 selfloop transitions, 13 changer transitions 12/67 dead transitions. [2025-03-04 02:16:40,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 67 transitions, 501 flow [2025-03-04 02:16:40,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:16:40,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:16:40,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2025-03-04 02:16:40,129 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5153061224489796 [2025-03-04 02:16:40,129 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 288 flow. Second operand 7 states and 101 transitions. [2025-03-04 02:16:40,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 67 transitions, 501 flow [2025-03-04 02:16:40,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 67 transitions, 482 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-04 02:16:40,133 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 317 flow [2025-03-04 02:16:40,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=317, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2025-03-04 02:16:40,133 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 33 predicate places. [2025-03-04 02:16:40,133 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 317 flow [2025-03-04 02:16:40,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:40,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:40,134 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:40,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:16:40,134 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-04 02:16:40,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:40,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1878941739, now seen corresponding path program 3 times [2025-03-04 02:16:40,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:40,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609296838] [2025-03-04 02:16:40,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:16:40,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:40,159 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:16:40,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:16:40,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:16:40,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:16:40,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:40,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609296838] [2025-03-04 02:16:40,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609296838] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:40,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367496611] [2025-03-04 02:16:40,375 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:16:40,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:16:40,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:16:40,378 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-04 02:16:40,379 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-04 02:16:40,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:16:40,444 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:16:40,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:16:40,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:40,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 02:16:40,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:16:40,565 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 02:16:40,565 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 26 treesize of output 10 [2025-03-04 02:16:40,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:16:40,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:16:40,654 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:16:40,654 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:16:40,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:16:40,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367496611] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:16:40,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:16:40,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 12 [2025-03-04 02:16:40,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171157562] [2025-03-04 02:16:40,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:16:40,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:16:40,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:40,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:16:40,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:16:40,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:16:40,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 317 flow. Second operand has 13 states, 13 states have (on average 9.692307692307692) internal successors, (126), 13 states have internal predecessors, (126), 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-04 02:16:40,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:40,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:16:40,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:40,971 INFO L124 PetriNetUnfolderBase]: 304/585 cut-off events. [2025-03-04 02:16:40,971 INFO L125 PetriNetUnfolderBase]: For 791/791 co-relation queries the response was YES. [2025-03-04 02:16:40,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1884 conditions, 585 events. 304/585 cut-off events. For 791/791 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2666 event pairs, 41 based on Foata normal form. 12/596 useless extension candidates. Maximal degree in co-relation 1849. Up to 303 conditions per place. [2025-03-04 02:16:40,975 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 49 selfloop transitions, 17 changer transitions 3/74 dead transitions. [2025-03-04 02:16:40,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 74 transitions, 558 flow [2025-03-04 02:16:40,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:16:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:16:40,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2025-03-04 02:16:40,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5223214285714286 [2025-03-04 02:16:40,977 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 317 flow. Second operand 8 states and 117 transitions. [2025-03-04 02:16:40,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 74 transitions, 558 flow [2025-03-04 02:16:40,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 74 transitions, 528 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-03-04 02:16:40,982 INFO L231 Difference]: Finished difference. Result has 61 places, 46 transitions, 335 flow [2025-03-04 02:16:40,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=335, PETRI_PLACES=61, PETRI_TRANSITIONS=46} [2025-03-04 02:16:40,982 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 35 predicate places. [2025-03-04 02:16:40,983 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 335 flow [2025-03-04 02:16:40,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.692307692307692) internal successors, (126), 13 states have internal predecessors, (126), 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-04 02:16:40,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:40,983 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:40,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 02:16:41,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:16:41,187 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-04 02:16:41,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:41,188 INFO L85 PathProgramCache]: Analyzing trace with hash -486220423, now seen corresponding path program 2 times [2025-03-04 02:16:41,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:41,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545750360] [2025-03-04 02:16:41,188 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:16:41,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:41,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:16:41,205 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-04 02:16:41,206 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:16:41,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:41,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:16:41,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:41,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545750360] [2025-03-04 02:16:41,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545750360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:16:41,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:16:41,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:16:41,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659197153] [2025-03-04 02:16:41,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:41,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:16:41,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:41,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:16:41,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:16:41,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:16:41,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 46 transitions, 335 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:41,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:41,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:16:41,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:41,624 INFO L124 PetriNetUnfolderBase]: 309/588 cut-off events. [2025-03-04 02:16:41,625 INFO L125 PetriNetUnfolderBase]: For 1115/1115 co-relation queries the response was YES. [2025-03-04 02:16:41,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1978 conditions, 588 events. 309/588 cut-off events. For 1115/1115 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2654 event pairs, 120 based on Foata normal form. 5/590 useless extension candidates. Maximal degree in co-relation 1942. Up to 460 conditions per place. [2025-03-04 02:16:41,628 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 35 selfloop transitions, 14 changer transitions 10/64 dead transitions. [2025-03-04 02:16:41,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 64 transitions, 521 flow [2025-03-04 02:16:41,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:16:41,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:16:41,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2025-03-04 02:16:41,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 02:16:41,630 INFO L175 Difference]: Start difference. First operand has 61 places, 46 transitions, 335 flow. Second operand 7 states and 98 transitions. [2025-03-04 02:16:41,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 64 transitions, 521 flow [2025-03-04 02:16:41,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 64 transitions, 465 flow, removed 3 selfloop flow, removed 8 redundant places. [2025-03-04 02:16:41,635 INFO L231 Difference]: Finished difference. Result has 60 places, 46 transitions, 321 flow [2025-03-04 02:16:41,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=321, PETRI_PLACES=60, PETRI_TRANSITIONS=46} [2025-03-04 02:16:41,635 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 34 predicate places. [2025-03-04 02:16:41,635 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 46 transitions, 321 flow [2025-03-04 02:16:41,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:41,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:41,636 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:41,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:16:41,636 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-04 02:16:41,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:41,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1261531439, now seen corresponding path program 4 times [2025-03-04 02:16:41,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:41,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855528361] [2025-03-04 02:16:41,637 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:16:41,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:41,642 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:16:41,648 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:16:41,648 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:16:41,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:41,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:16:41,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:41,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855528361] [2025-03-04 02:16:41,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855528361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:16:41,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:16:41,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:16:41,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991664705] [2025-03-04 02:16:41,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:41,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:16:41,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:41,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:16:41,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:16:41,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:16:41,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 46 transitions, 321 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:41,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:41,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:16:41,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:42,010 INFO L124 PetriNetUnfolderBase]: 297/562 cut-off events. [2025-03-04 02:16:42,010 INFO L125 PetriNetUnfolderBase]: For 661/661 co-relation queries the response was YES. [2025-03-04 02:16:42,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 562 events. 297/562 cut-off events. For 661/661 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2490 event pairs, 93 based on Foata normal form. 12/571 useless extension candidates. Maximal degree in co-relation 1808. Up to 470 conditions per place. [2025-03-04 02:16:42,013 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 43 selfloop transitions, 15 changer transitions 0/63 dead transitions. [2025-03-04 02:16:42,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 490 flow [2025-03-04 02:16:42,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:16:42,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:16:42,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2025-03-04 02:16:42,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49489795918367346 [2025-03-04 02:16:42,015 INFO L175 Difference]: Start difference. First operand has 60 places, 46 transitions, 321 flow. Second operand 7 states and 97 transitions. [2025-03-04 02:16:42,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 490 flow [2025-03-04 02:16:42,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 63 transitions, 446 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-03-04 02:16:42,018 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 320 flow [2025-03-04 02:16:42,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=320, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2025-03-04 02:16:42,018 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 33 predicate places. [2025-03-04 02:16:42,018 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 320 flow [2025-03-04 02:16:42,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:42,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:42,018 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:42,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 02:16:42,019 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-04 02:16:42,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:42,020 INFO L85 PathProgramCache]: Analyzing trace with hash 523290985, now seen corresponding path program 3 times [2025-03-04 02:16:42,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:42,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487988419] [2025-03-04 02:16:42,020 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:16:42,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:42,027 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:16:42,043 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:16:42,043 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:16:42,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:42,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:16:42,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:42,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487988419] [2025-03-04 02:16:42,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487988419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:42,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598647294] [2025-03-04 02:16:42,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:16:42,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:16:42,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:16:42,245 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-04 02:16:42,248 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-04 02:16:42,294 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:16:42,313 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:16:42,313 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:16:42,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:42,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 02:16:42,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:16:42,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:16:42,413 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 29 treesize of output 21 [2025-03-04 02:16:42,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:16:42,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:16:42,501 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:16:42,501 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:16:42,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:16:42,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598647294] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:42,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:16:42,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 7] total 13 [2025-03-04 02:16:42,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107093517] [2025-03-04 02:16:42,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:42,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:16:42,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:42,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:16:42,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-04 02:16:42,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:16:42,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 320 flow. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 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-04 02:16:42,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:42,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:16:42,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:42,677 INFO L124 PetriNetUnfolderBase]: 337/648 cut-off events. [2025-03-04 02:16:42,677 INFO L125 PetriNetUnfolderBase]: For 820/820 co-relation queries the response was YES. [2025-03-04 02:16:42,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2122 conditions, 648 events. 337/648 cut-off events. For 820/820 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3072 event pairs, 101 based on Foata normal form. 10/655 useless extension candidates. Maximal degree in co-relation 2090. Up to 492 conditions per place. [2025-03-04 02:16:42,680 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 49 selfloop transitions, 13 changer transitions 0/67 dead transitions. [2025-03-04 02:16:42,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 67 transitions, 507 flow [2025-03-04 02:16:42,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:16:42,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:16:42,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2025-03-04 02:16:42,681 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5535714285714286 [2025-03-04 02:16:42,681 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 320 flow. Second operand 6 states and 93 transitions. [2025-03-04 02:16:42,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 67 transitions, 507 flow [2025-03-04 02:16:42,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 67 transitions, 479 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 02:16:42,684 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 333 flow [2025-03-04 02:16:42,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=333, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2025-03-04 02:16:42,685 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 34 predicate places. [2025-03-04 02:16:42,685 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 333 flow [2025-03-04 02:16:42,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 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-04 02:16:42,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:42,685 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:42,692 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-04 02:16:42,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:16:42,890 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-04 02:16:42,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:42,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1246018327, now seen corresponding path program 4 times [2025-03-04 02:16:42,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:42,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366102940] [2025-03-04 02:16:42,890 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:16:42,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:42,896 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:16:42,902 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:16:42,902 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:16:42,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:43,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:16:43,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:43,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366102940] [2025-03-04 02:16:43,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366102940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:16:43,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:16:43,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:16:43,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15502622] [2025-03-04 02:16:43,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:43,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:16:43,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:43,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:16:43,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:16:43,096 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:16:43,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 333 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:43,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:43,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:16:43,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:43,232 INFO L124 PetriNetUnfolderBase]: 307/580 cut-off events. [2025-03-04 02:16:43,232 INFO L125 PetriNetUnfolderBase]: For 935/935 co-relation queries the response was YES. [2025-03-04 02:16:43,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1970 conditions, 580 events. 307/580 cut-off events. For 935/935 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2601 event pairs, 109 based on Foata normal form. 5/584 useless extension candidates. Maximal degree in co-relation 1937. Up to 509 conditions per place. [2025-03-04 02:16:43,235 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 37 selfloop transitions, 12 changer transitions 4/58 dead transitions. [2025-03-04 02:16:43,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 58 transitions, 450 flow [2025-03-04 02:16:43,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:16:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:16:43,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2025-03-04 02:16:43,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-03-04 02:16:43,237 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 333 flow. Second operand 7 states and 91 transitions. [2025-03-04 02:16:43,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 58 transitions, 450 flow [2025-03-04 02:16:43,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 58 transitions, 428 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:16:43,240 INFO L231 Difference]: Finished difference. Result has 62 places, 46 transitions, 316 flow [2025-03-04 02:16:43,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=316, PETRI_PLACES=62, PETRI_TRANSITIONS=46} [2025-03-04 02:16:43,241 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 36 predicate places. [2025-03-04 02:16:43,241 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 46 transitions, 316 flow [2025-03-04 02:16:43,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:43,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:43,241 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:43,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 02:16:43,241 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-04 02:16:43,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:43,242 INFO L85 PathProgramCache]: Analyzing trace with hash 239207239, now seen corresponding path program 5 times [2025-03-04 02:16:43,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:43,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935803704] [2025-03-04 02:16:43,242 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:16:43,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:43,248 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:16:43,257 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:16:43,258 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:16:43,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:16:43,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:43,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935803704] [2025-03-04 02:16:43,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935803704] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:43,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026400340] [2025-03-04 02:16:43,491 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:16:43,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:16:43,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:16:43,492 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-04 02:16:43,494 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-04 02:16:43,533 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:16:43,548 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:16:43,548 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:16:43,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:43,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 02:16:43,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:16:43,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:16:43,636 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 29 treesize of output 25 [2025-03-04 02:16:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:16:43,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:16:43,722 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:16:43,722 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:16:43,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:16:43,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026400340] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:43,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:16:43,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 14 [2025-03-04 02:16:43,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230154748] [2025-03-04 02:16:43,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:43,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:16:43,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:43,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:16:43,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:16:43,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:16:43,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 46 transitions, 316 flow. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 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-04 02:16:43,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:43,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:16:43,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:43,878 INFO L124 PetriNetUnfolderBase]: 293/566 cut-off events. [2025-03-04 02:16:43,878 INFO L125 PetriNetUnfolderBase]: For 901/901 co-relation queries the response was YES. [2025-03-04 02:16:43,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1896 conditions, 566 events. 293/566 cut-off events. For 901/901 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2563 event pairs, 91 based on Foata normal form. 12/577 useless extension candidates. Maximal degree in co-relation 1863. Up to 424 conditions per place. [2025-03-04 02:16:43,881 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 44 selfloop transitions, 12 changer transitions 0/61 dead transitions. [2025-03-04 02:16:43,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 61 transitions, 473 flow [2025-03-04 02:16:43,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:16:43,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:16:43,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-03-04 02:16:43,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-03-04 02:16:43,882 INFO L175 Difference]: Start difference. First operand has 62 places, 46 transitions, 316 flow. Second operand 6 states and 88 transitions. [2025-03-04 02:16:43,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 61 transitions, 473 flow [2025-03-04 02:16:43,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 61 transitions, 449 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 02:16:43,886 INFO L231 Difference]: Finished difference. Result has 61 places, 46 transitions, 321 flow [2025-03-04 02:16:43,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=321, PETRI_PLACES=61, PETRI_TRANSITIONS=46} [2025-03-04 02:16:43,887 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 35 predicate places. [2025-03-04 02:16:43,887 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 321 flow [2025-03-04 02:16:43,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 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-04 02:16:43,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:43,887 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:43,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 02:16:44,088 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,SelfDestructingSolverStorable15 [2025-03-04 02:16:44,088 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-04 02:16:44,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:44,088 INFO L85 PathProgramCache]: Analyzing trace with hash 44708127, now seen corresponding path program 6 times [2025-03-04 02:16:44,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:44,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061577827] [2025-03-04 02:16:44,088 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:16:44,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:44,097 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:16:44,100 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-04 02:16:44,101 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:16:44,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:44,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:16:44,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:44,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061577827] [2025-03-04 02:16:44,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061577827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:16:44,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:16:44,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:16:44,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062595504] [2025-03-04 02:16:44,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:44,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:16:44,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:44,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:16:44,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:16:44,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:16:44,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 46 transitions, 321 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:44,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:44,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:16:44,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:44,431 INFO L124 PetriNetUnfolderBase]: 267/506 cut-off events. [2025-03-04 02:16:44,431 INFO L125 PetriNetUnfolderBase]: For 964/964 co-relation queries the response was YES. [2025-03-04 02:16:44,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1771 conditions, 506 events. 267/506 cut-off events. For 964/964 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2165 event pairs, 91 based on Foata normal form. 4/509 useless extension candidates. Maximal degree in co-relation 1737. Up to 443 conditions per place. [2025-03-04 02:16:44,436 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 33 selfloop transitions, 11 changer transitions 3/52 dead transitions. [2025-03-04 02:16:44,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 52 transitions, 415 flow [2025-03-04 02:16:44,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:16:44,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:16:44,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2025-03-04 02:16:44,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4387755102040816 [2025-03-04 02:16:44,437 INFO L175 Difference]: Start difference. First operand has 61 places, 46 transitions, 321 flow. Second operand 7 states and 86 transitions. [2025-03-04 02:16:44,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 52 transitions, 415 flow [2025-03-04 02:16:44,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 52 transitions, 393 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 02:16:44,439 INFO L231 Difference]: Finished difference. Result has 63 places, 44 transitions, 301 flow [2025-03-04 02:16:44,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=301, PETRI_PLACES=63, PETRI_TRANSITIONS=44} [2025-03-04 02:16:44,440 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 37 predicate places. [2025-03-04 02:16:44,440 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 44 transitions, 301 flow [2025-03-04 02:16:44,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:44,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:44,440 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:44,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 02:16:44,441 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-04 02:16:44,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:44,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1714908111, now seen corresponding path program 5 times [2025-03-04 02:16:44,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:44,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847812146] [2025-03-04 02:16:44,441 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:16:44,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:44,446 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:16:44,454 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:16:44,454 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:16:44,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:44,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:16:44,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:44,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847812146] [2025-03-04 02:16:44,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847812146] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:44,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690336452] [2025-03-04 02:16:44,624 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:16:44,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:16:44,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:16:44,627 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-04 02:16:44,628 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-04 02:16:44,669 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:16:44,684 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:16:44,684 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:16:44,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:44,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 02:16:44,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:16:44,789 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-04 02:16:44,790 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 26 treesize of output 10 [2025-03-04 02:16:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:16:44,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:16:44,865 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:16:44,866 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:16:44,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:16:44,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690336452] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:16:44,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:16:44,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 14 [2025-03-04 02:16:44,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230178494] [2025-03-04 02:16:44,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:16:44,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 02:16:44,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:44,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 02:16:44,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:16:44,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:16:44,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 44 transitions, 301 flow. Second operand has 15 states, 15 states have (on average 10.0) internal successors, (150), 15 states have internal predecessors, (150), 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-04 02:16:44,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:44,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:16:44,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:45,147 INFO L124 PetriNetUnfolderBase]: 280/527 cut-off events. [2025-03-04 02:16:45,147 INFO L125 PetriNetUnfolderBase]: For 944/944 co-relation queries the response was YES. [2025-03-04 02:16:45,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 527 events. 280/527 cut-off events. For 944/944 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2263 event pairs, 83 based on Foata normal form. 10/536 useless extension candidates. Maximal degree in co-relation 1808. Up to 328 conditions per place. [2025-03-04 02:16:45,150 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 42 selfloop transitions, 17 changer transitions 0/64 dead transitions. [2025-03-04 02:16:45,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 64 transitions, 502 flow [2025-03-04 02:16:45,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:16:45,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:16:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2025-03-04 02:16:45,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2025-03-04 02:16:45,152 INFO L175 Difference]: Start difference. First operand has 63 places, 44 transitions, 301 flow. Second operand 9 states and 114 transitions. [2025-03-04 02:16:45,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 64 transitions, 502 flow [2025-03-04 02:16:45,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 64 transitions, 480 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 02:16:45,155 INFO L231 Difference]: Finished difference. Result has 65 places, 45 transitions, 327 flow [2025-03-04 02:16:45,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=327, PETRI_PLACES=65, PETRI_TRANSITIONS=45} [2025-03-04 02:16:45,155 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 39 predicate places. [2025-03-04 02:16:45,155 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 45 transitions, 327 flow [2025-03-04 02:16:45,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.0) internal successors, (150), 15 states have internal predecessors, (150), 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-04 02:16:45,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:45,157 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:45,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 02:16:45,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 02:16:45,358 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-04 02:16:45,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:45,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1376390367, now seen corresponding path program 6 times [2025-03-04 02:16:45,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:45,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116344954] [2025-03-04 02:16:45,359 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:16:45,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:45,367 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-04 02:16:45,373 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-04 02:16:45,373 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:16:45,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:45,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:16:45,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:45,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116344954] [2025-03-04 02:16:45,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116344954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:16:45,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:16:45,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:16:45,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760533961] [2025-03-04 02:16:45,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:45,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:16:45,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:45,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:16:45,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:16:45,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:16:45,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 45 transitions, 327 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:45,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:45,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:16:45,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:45,717 INFO L124 PetriNetUnfolderBase]: 245/461 cut-off events. [2025-03-04 02:16:45,717 INFO L125 PetriNetUnfolderBase]: For 1138/1138 co-relation queries the response was YES. [2025-03-04 02:16:45,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1729 conditions, 461 events. 245/461 cut-off events. For 1138/1138 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1898 event pairs, 71 based on Foata normal form. 10/470 useless extension candidates. Maximal degree in co-relation 1692. Up to 387 conditions per place. [2025-03-04 02:16:45,719 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 38 selfloop transitions, 12 changer transitions 0/55 dead transitions. [2025-03-04 02:16:45,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 55 transitions, 462 flow [2025-03-04 02:16:45,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:16:45,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:16:45,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2025-03-04 02:16:45,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45408163265306123 [2025-03-04 02:16:45,720 INFO L175 Difference]: Start difference. First operand has 65 places, 45 transitions, 327 flow. Second operand 7 states and 89 transitions. [2025-03-04 02:16:45,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 55 transitions, 462 flow [2025-03-04 02:16:45,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 55 transitions, 414 flow, removed 3 selfloop flow, removed 8 redundant places. [2025-03-04 02:16:45,723 INFO L231 Difference]: Finished difference. Result has 64 places, 45 transitions, 307 flow [2025-03-04 02:16:45,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=307, PETRI_PLACES=64, PETRI_TRANSITIONS=45} [2025-03-04 02:16:45,724 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 38 predicate places. [2025-03-04 02:16:45,724 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 45 transitions, 307 flow [2025-03-04 02:16:45,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:45,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:45,724 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:45,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 02:16:45,724 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-04 02:16:45,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:45,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1190445436, now seen corresponding path program 1 times [2025-03-04 02:16:45,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:45,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483367036] [2025-03-04 02:16:45,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:16:45,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:45,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:16:45,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:16:45,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:45,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:16:45,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:45,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483367036] [2025-03-04 02:16:45,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483367036] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:45,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716540429] [2025-03-04 02:16:45,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:16:45,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:16:45,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:16:45,783 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-04 02:16:45,784 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-04 02:16:45,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:16:45,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:16:45,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:45,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:45,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:16:45,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:16:45,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:16:45,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:16:45,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:16:45,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716540429] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:16:45,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:16:45,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 6 [2025-03-04 02:16:45,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673758598] [2025-03-04 02:16:45,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:16:45,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:16:45,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:45,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:16:45,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:16:45,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:16:45,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 45 transitions, 307 flow. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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-04 02:16:45,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:45,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:16:45,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:46,069 INFO L124 PetriNetUnfolderBase]: 578/1096 cut-off events. [2025-03-04 02:16:46,069 INFO L125 PetriNetUnfolderBase]: For 1750/1750 co-relation queries the response was YES. [2025-03-04 02:16:46,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3645 conditions, 1096 events. 578/1096 cut-off events. For 1750/1750 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5754 event pairs, 72 based on Foata normal form. 8/1103 useless extension candidates. Maximal degree in co-relation 3610. Up to 440 conditions per place. [2025-03-04 02:16:46,075 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 70 selfloop transitions, 17 changer transitions 2/94 dead transitions. [2025-03-04 02:16:46,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 94 transitions, 713 flow [2025-03-04 02:16:46,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:16:46,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:16:46,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2025-03-04 02:16:46,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6224489795918368 [2025-03-04 02:16:46,076 INFO L175 Difference]: Start difference. First operand has 64 places, 45 transitions, 307 flow. Second operand 7 states and 122 transitions. [2025-03-04 02:16:46,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 94 transitions, 713 flow [2025-03-04 02:16:46,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 94 transitions, 689 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-04 02:16:46,081 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 414 flow [2025-03-04 02:16:46,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=414, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2025-03-04 02:16:46,081 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 42 predicate places. [2025-03-04 02:16:46,081 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 414 flow [2025-03-04 02:16:46,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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-04 02:16:46,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:46,081 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:46,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 02:16:46,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:16:46,284 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-04 02:16:46,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:46,284 INFO L85 PathProgramCache]: Analyzing trace with hash -278094024, now seen corresponding path program 2 times [2025-03-04 02:16:46,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:46,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696635921] [2025-03-04 02:16:46,284 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:16:46,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:46,292 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 02:16:46,294 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-03-04 02:16:46,294 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:16:46,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:16:46,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:46,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696635921] [2025-03-04 02:16:46,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696635921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:16:46,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:16:46,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:16:46,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092904962] [2025-03-04 02:16:46,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:46,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:16:46,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:46,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:16:46,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:16:46,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:16:46,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 414 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:46,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:46,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:16:46,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:46,460 INFO L124 PetriNetUnfolderBase]: 723/1361 cut-off events. [2025-03-04 02:16:46,460 INFO L125 PetriNetUnfolderBase]: For 2789/2789 co-relation queries the response was YES. [2025-03-04 02:16:46,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4817 conditions, 1361 events. 723/1361 cut-off events. For 2789/2789 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7642 event pairs, 234 based on Foata normal form. 4/1364 useless extension candidates. Maximal degree in co-relation 4779. Up to 1015 conditions per place. [2025-03-04 02:16:46,468 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 59 selfloop transitions, 13 changer transitions 1/78 dead transitions. [2025-03-04 02:16:46,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 78 transitions, 680 flow [2025-03-04 02:16:46,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:16:46,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:16:46,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2025-03-04 02:16:46,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5785714285714286 [2025-03-04 02:16:46,470 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 414 flow. Second operand 5 states and 81 transitions. [2025-03-04 02:16:46,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 78 transitions, 680 flow [2025-03-04 02:16:46,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 78 transitions, 653 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-03-04 02:16:46,476 INFO L231 Difference]: Finished difference. Result has 73 places, 61 transitions, 487 flow [2025-03-04 02:16:46,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=487, PETRI_PLACES=73, PETRI_TRANSITIONS=61} [2025-03-04 02:16:46,476 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 47 predicate places. [2025-03-04 02:16:46,476 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 61 transitions, 487 flow [2025-03-04 02:16:46,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:46,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:46,477 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:46,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 02:16:46,477 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-04 02:16:46,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:46,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1659159988, now seen corresponding path program 3 times [2025-03-04 02:16:46,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:46,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827086205] [2025-03-04 02:16:46,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:16:46,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:46,483 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:16:46,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:16:46,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:16:46,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:46,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:16:46,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:46,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827086205] [2025-03-04 02:16:46,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827086205] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:46,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3516159] [2025-03-04 02:16:46,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:16:46,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:16:46,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:16:46,551 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-04 02:16:46,552 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-04 02:16:46,593 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:16:46,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:16:46,610 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:16:46,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:46,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 02:16:46,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:16:46,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:16:46,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:16:47,001 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-04 02:16:47,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3516159] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:16:47,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:16:47,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 23 [2025-03-04 02:16:47,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209613067] [2025-03-04 02:16:47,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:16:47,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 02:16:47,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:47,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 02:16:47,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2025-03-04 02:16:47,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:16:47,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 61 transitions, 487 flow. Second operand has 24 states, 24 states have (on average 7.75) internal successors, (186), 24 states have internal predecessors, (186), 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-04 02:16:47,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:47,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:16:47,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:48,275 INFO L124 PetriNetUnfolderBase]: 2186/4001 cut-off events. [2025-03-04 02:16:48,275 INFO L125 PetriNetUnfolderBase]: For 8019/8019 co-relation queries the response was YES. [2025-03-04 02:16:48,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13997 conditions, 4001 events. 2186/4001 cut-off events. For 8019/8019 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 25524 event pairs, 188 based on Foata normal form. 167/4167 useless extension candidates. Maximal degree in co-relation 11687. Up to 710 conditions per place. [2025-03-04 02:16:48,298 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 247 selfloop transitions, 108 changer transitions 54/412 dead transitions. [2025-03-04 02:16:48,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 412 transitions, 3194 flow [2025-03-04 02:16:48,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-04 02:16:48,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-04 02:16:48,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 607 transitions. [2025-03-04 02:16:48,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48174603174603176 [2025-03-04 02:16:48,300 INFO L175 Difference]: Start difference. First operand has 73 places, 61 transitions, 487 flow. Second operand 45 states and 607 transitions. [2025-03-04 02:16:48,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 412 transitions, 3194 flow [2025-03-04 02:16:48,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 412 transitions, 3133 flow, removed 18 selfloop flow, removed 1 redundant places. [2025-03-04 02:16:48,318 INFO L231 Difference]: Finished difference. Result has 143 places, 141 transitions, 1611 flow [2025-03-04 02:16:48,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=1611, PETRI_PLACES=143, PETRI_TRANSITIONS=141} [2025-03-04 02:16:48,318 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 117 predicate places. [2025-03-04 02:16:48,318 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 141 transitions, 1611 flow [2025-03-04 02:16:48,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.75) internal successors, (186), 24 states have internal predecessors, (186), 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-04 02:16:48,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:48,319 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:48,326 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-04 02:16:48,519 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,SelfDestructingSolverStorable21 [2025-03-04 02:16:48,520 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-04 02:16:48,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:48,520 INFO L85 PathProgramCache]: Analyzing trace with hash -2032128190, now seen corresponding path program 4 times [2025-03-04 02:16:48,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:48,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659188812] [2025-03-04 02:16:48,520 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:16:48,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:48,526 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:16:48,528 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 25 statements. [2025-03-04 02:16:48,529 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:16:48,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:48,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:16:48,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:48,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659188812] [2025-03-04 02:16:48,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659188812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:16:48,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:16:48,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:16:48,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921196715] [2025-03-04 02:16:48,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:48,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:16:48,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:48,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:16:48,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:16:48,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:16:48,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 141 transitions, 1611 flow. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 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-04 02:16:48,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:48,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:16:48,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:49,262 INFO L124 PetriNetUnfolderBase]: 2738/5002 cut-off events. [2025-03-04 02:16:49,263 INFO L125 PetriNetUnfolderBase]: For 37923/37923 co-relation queries the response was YES. [2025-03-04 02:16:49,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24143 conditions, 5002 events. 2738/5002 cut-off events. For 37923/37923 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 34013 event pairs, 420 based on Foata normal form. 54/5052 useless extension candidates. Maximal degree in co-relation 23556. Up to 1596 conditions per place. [2025-03-04 02:16:49,290 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 147 selfloop transitions, 141 changer transitions 15/306 dead transitions. [2025-03-04 02:16:49,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 306 transitions, 3758 flow [2025-03-04 02:16:49,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:16:49,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:16:49,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 187 transitions. [2025-03-04 02:16:49,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5565476190476191 [2025-03-04 02:16:49,292 INFO L175 Difference]: Start difference. First operand has 143 places, 141 transitions, 1611 flow. Second operand 12 states and 187 transitions. [2025-03-04 02:16:49,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 306 transitions, 3758 flow [2025-03-04 02:16:49,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 306 transitions, 3355 flow, removed 154 selfloop flow, removed 11 redundant places. [2025-03-04 02:16:49,361 INFO L231 Difference]: Finished difference. Result has 150 places, 213 transitions, 2776 flow [2025-03-04 02:16:49,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1376, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2776, PETRI_PLACES=150, PETRI_TRANSITIONS=213} [2025-03-04 02:16:49,362 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 124 predicate places. [2025-03-04 02:16:49,362 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 213 transitions, 2776 flow [2025-03-04 02:16:49,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 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-04 02:16:49,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:49,362 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:49,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 02:16:49,362 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-04 02:16:49,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:49,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1283172980, now seen corresponding path program 5 times [2025-03-04 02:16:49,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:49,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488484787] [2025-03-04 02:16:49,362 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:16:49,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:49,371 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 3 equivalence classes. [2025-03-04 02:16:49,376 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:16:49,377 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:16:49,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:49,422 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:16:49,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:49,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488484787] [2025-03-04 02:16:49,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488484787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:49,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314658546] [2025-03-04 02:16:49,423 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:16:49,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:16:49,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:16:49,426 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-04 02:16:49,426 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-04 02:16:49,471 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 3 equivalence classes. [2025-03-04 02:16:49,490 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:16:49,491 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:16:49,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:49,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:16:49,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:16:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:16:49,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:16:49,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:16:49,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314658546] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:16:49,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:16:49,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 02:16:49,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803747931] [2025-03-04 02:16:49,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:16:49,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:16:49,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:49,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:16:49,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:16:49,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:16:49,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 213 transitions, 2776 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 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-04 02:16:49,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:49,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:16:49,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:50,093 INFO L124 PetriNetUnfolderBase]: 2124/4107 cut-off events. [2025-03-04 02:16:50,093 INFO L125 PetriNetUnfolderBase]: For 33442/33584 co-relation queries the response was YES. [2025-03-04 02:16:50,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20913 conditions, 4107 events. 2124/4107 cut-off events. For 33442/33584 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 29218 event pairs, 1481 based on Foata normal form. 21/4075 useless extension candidates. Maximal degree in co-relation 20213. Up to 3668 conditions per place. [2025-03-04 02:16:50,130 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 171 selfloop transitions, 3 changer transitions 31/215 dead transitions. [2025-03-04 02:16:50,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 215 transitions, 3095 flow [2025-03-04 02:16:50,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:16:50,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:16:50,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2025-03-04 02:16:50,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45408163265306123 [2025-03-04 02:16:50,132 INFO L175 Difference]: Start difference. First operand has 150 places, 213 transitions, 2776 flow. Second operand 7 states and 89 transitions. [2025-03-04 02:16:50,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 215 transitions, 3095 flow [2025-03-04 02:16:50,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 215 transitions, 2921 flow, removed 87 selfloop flow, removed 2 redundant places. [2025-03-04 02:16:50,313 INFO L231 Difference]: Finished difference. Result has 153 places, 184 transitions, 2221 flow [2025-03-04 02:16:50,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2461, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2221, PETRI_PLACES=153, PETRI_TRANSITIONS=184} [2025-03-04 02:16:50,314 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 127 predicate places. [2025-03-04 02:16:50,314 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 184 transitions, 2221 flow [2025-03-04 02:16:50,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 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-04 02:16:50,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:50,314 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:50,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 02:16:50,515 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,SelfDestructingSolverStorable23 [2025-03-04 02:16:50,515 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-04 02:16:50,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:50,516 INFO L85 PathProgramCache]: Analyzing trace with hash -508959156, now seen corresponding path program 6 times [2025-03-04 02:16:50,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:50,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178154293] [2025-03-04 02:16:50,516 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:16:50,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:50,523 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:16:50,530 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:16:50,531 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:16:50,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:50,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:16:50,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:50,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178154293] [2025-03-04 02:16:50,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178154293] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:50,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155025254] [2025-03-04 02:16:50,587 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:16:50,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:16:50,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:16:50,590 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-04 02:16:50,591 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-04 02:16:50,631 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:16:50,653 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:16:50,653 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:16:50,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:50,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:16:50,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:16:50,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:16:50,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:16:50,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:16:50,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155025254] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:16:50,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:16:50,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 02:16:50,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331996337] [2025-03-04 02:16:50,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:16:50,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 02:16:50,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:50,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 02:16:50,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:16:50,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:16:50,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 184 transitions, 2221 flow. Second operand has 15 states, 15 states have (on average 9.866666666666667) internal successors, (148), 15 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:50,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:50,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:16:50,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:51,352 INFO L124 PetriNetUnfolderBase]: 2204/4298 cut-off events. [2025-03-04 02:16:51,352 INFO L125 PetriNetUnfolderBase]: For 29526/29691 co-relation queries the response was YES. [2025-03-04 02:16:51,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20593 conditions, 4298 events. 2204/4298 cut-off events. For 29526/29691 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 31137 event pairs, 861 based on Foata normal form. 70/4324 useless extension candidates. Maximal degree in co-relation 20531. Up to 2908 conditions per place. [2025-03-04 02:16:51,378 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 180 selfloop transitions, 32 changer transitions 12/234 dead transitions. [2025-03-04 02:16:51,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 234 transitions, 3150 flow [2025-03-04 02:16:51,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:16:51,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:16:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2025-03-04 02:16:51,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49107142857142855 [2025-03-04 02:16:51,380 INFO L175 Difference]: Start difference. First operand has 153 places, 184 transitions, 2221 flow. Second operand 8 states and 110 transitions. [2025-03-04 02:16:51,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 234 transitions, 3150 flow [2025-03-04 02:16:51,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 234 transitions, 3093 flow, removed 19 selfloop flow, removed 9 redundant places. [2025-03-04 02:16:51,474 INFO L231 Difference]: Finished difference. Result has 137 places, 180 transitions, 2229 flow [2025-03-04 02:16:51,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2035, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2229, PETRI_PLACES=137, PETRI_TRANSITIONS=180} [2025-03-04 02:16:51,474 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 111 predicate places. [2025-03-04 02:16:51,474 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 180 transitions, 2229 flow [2025-03-04 02:16:51,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.866666666666667) internal successors, (148), 15 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:51,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:51,475 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:51,481 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-04 02:16:51,675 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,SelfDestructingSolverStorable24 [2025-03-04 02:16:51,676 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-04 02:16:51,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:51,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1506524058, now seen corresponding path program 7 times [2025-03-04 02:16:51,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:51,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082332283] [2025-03-04 02:16:51,677 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:16:51,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:51,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:16:51,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:16:51,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:51,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:51,747 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-04 02:16:51,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:51,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082332283] [2025-03-04 02:16:51,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082332283] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:51,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354949511] [2025-03-04 02:16:51,747 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:16:51,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:16:51,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:16:51,749 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-04 02:16:51,751 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-04 02:16:51,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:16:51,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:16:51,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:51,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:51,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:16:51,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:16:51,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:16:51,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:16:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:16:51,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354949511] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:16:51,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:16:51,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 02:16:51,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988522185] [2025-03-04 02:16:51,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:16:51,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 02:16:51,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:51,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 02:16:51,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:16:51,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:16:51,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 180 transitions, 2229 flow. Second operand has 15 states, 15 states have (on average 10.133333333333333) internal successors, (152), 15 states have internal predecessors, (152), 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-04 02:16:51,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:51,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:16:51,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:52,466 INFO L124 PetriNetUnfolderBase]: 1839/3541 cut-off events. [2025-03-04 02:16:52,467 INFO L125 PetriNetUnfolderBase]: For 22330/22430 co-relation queries the response was YES. [2025-03-04 02:16:52,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16839 conditions, 3541 events. 1839/3541 cut-off events. For 22330/22430 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 24342 event pairs, 630 based on Foata normal form. 26/3532 useless extension candidates. Maximal degree in co-relation 16768. Up to 2847 conditions per place. [2025-03-04 02:16:52,493 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 136 selfloop transitions, 18 changer transitions 30/194 dead transitions. [2025-03-04 02:16:52,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 194 transitions, 2608 flow [2025-03-04 02:16:52,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:16:52,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:16:52,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2025-03-04 02:16:52,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46875 [2025-03-04 02:16:52,495 INFO L175 Difference]: Start difference. First operand has 137 places, 180 transitions, 2229 flow. Second operand 8 states and 105 transitions. [2025-03-04 02:16:52,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 194 transitions, 2608 flow [2025-03-04 02:16:52,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 194 transitions, 2586 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-04 02:16:52,623 INFO L231 Difference]: Finished difference. Result has 139 places, 159 transitions, 1917 flow [2025-03-04 02:16:52,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2123, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1917, PETRI_PLACES=139, PETRI_TRANSITIONS=159} [2025-03-04 02:16:52,624 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 113 predicate places. [2025-03-04 02:16:52,624 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 159 transitions, 1917 flow [2025-03-04 02:16:52,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.133333333333333) internal successors, (152), 15 states have internal predecessors, (152), 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-04 02:16:52,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:52,625 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:52,631 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-04 02:16:52,829 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,SelfDestructingSolverStorable25 [2025-03-04 02:16:52,829 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-04 02:16:52,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:52,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1380723578, now seen corresponding path program 8 times [2025-03-04 02:16:52,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:52,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163309656] [2025-03-04 02:16:52,830 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:16:52,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:52,835 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:16:52,840 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:16:52,840 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:16:52,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:52,942 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-04 02:16:52,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:52,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163309656] [2025-03-04 02:16:52,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163309656] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:52,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730255316] [2025-03-04 02:16:52,943 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:16:52,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:16:52,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:16:52,945 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-04 02:16:52,946 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-04 02:16:52,991 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:16:53,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:16:53,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:16:53,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:53,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 02:16:53,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:16:53,161 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:16:53,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:16:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:16:53,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730255316] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:53,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:16:53,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 21 [2025-03-04 02:16:53,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046213998] [2025-03-04 02:16:53,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:53,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:16:53,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:53,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:16:53,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2025-03-04 02:16:53,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2025-03-04 02:16:53,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 159 transitions, 1917 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 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-04 02:16:53,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:53,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2025-03-04 02:16:53,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:53,786 INFO L124 PetriNetUnfolderBase]: 1869/3435 cut-off events. [2025-03-04 02:16:53,786 INFO L125 PetriNetUnfolderBase]: For 22569/22609 co-relation queries the response was YES. [2025-03-04 02:16:53,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16514 conditions, 3435 events. 1869/3435 cut-off events. For 22569/22609 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 22294 event pairs, 496 based on Foata normal form. 97/3519 useless extension candidates. Maximal degree in co-relation 16443. Up to 1780 conditions per place. [2025-03-04 02:16:53,883 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 123 selfloop transitions, 58 changer transitions 0/188 dead transitions. [2025-03-04 02:16:53,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 188 transitions, 2586 flow [2025-03-04 02:16:53,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:16:53,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:16:53,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2025-03-04 02:16:53,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2025-03-04 02:16:53,884 INFO L175 Difference]: Start difference. First operand has 139 places, 159 transitions, 1917 flow. Second operand 9 states and 98 transitions. [2025-03-04 02:16:53,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 188 transitions, 2586 flow [2025-03-04 02:16:53,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 188 transitions, 2492 flow, removed 22 selfloop flow, removed 9 redundant places. [2025-03-04 02:16:53,945 INFO L231 Difference]: Finished difference. Result has 132 places, 164 transitions, 2120 flow [2025-03-04 02:16:53,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1819, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2120, PETRI_PLACES=132, PETRI_TRANSITIONS=164} [2025-03-04 02:16:53,946 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 106 predicate places. [2025-03-04 02:16:53,946 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 164 transitions, 2120 flow [2025-03-04 02:16:53,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 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-04 02:16:53,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:53,946 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:53,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 02:16:54,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 02:16:54,147 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-04 02:16:54,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:54,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1935181650, now seen corresponding path program 9 times [2025-03-04 02:16:54,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:54,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119169802] [2025-03-04 02:16:54,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:16:54,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:54,156 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:16:54,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:16:54,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:16:54,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:54,263 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:16:54,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:54,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119169802] [2025-03-04 02:16:54,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119169802] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:54,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504720082] [2025-03-04 02:16:54,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:16:54,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:16:54,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:16:54,266 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-04 02:16:54,269 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-04 02:16:54,316 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:16:54,335 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:16:54,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:16:54,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:54,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 02:16:54,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:16:54,474 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:16:54,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:16:54,601 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:16:54,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504720082] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:54,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:16:54,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 18 [2025-03-04 02:16:54,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834786065] [2025-03-04 02:16:54,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:54,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:16:54,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:54,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:16:54,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:16:54,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2025-03-04 02:16:54,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 164 transitions, 2120 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:54,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:54,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2025-03-04 02:16:54,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:55,121 INFO L124 PetriNetUnfolderBase]: 2327/4335 cut-off events. [2025-03-04 02:16:55,121 INFO L125 PetriNetUnfolderBase]: For 28997/29098 co-relation queries the response was YES. [2025-03-04 02:16:55,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21555 conditions, 4335 events. 2327/4335 cut-off events. For 28997/29098 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 29892 event pairs, 692 based on Foata normal form. 31/4337 useless extension candidates. Maximal degree in co-relation 21484. Up to 2394 conditions per place. [2025-03-04 02:16:55,143 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 183 selfloop transitions, 50 changer transitions 7/246 dead transitions. [2025-03-04 02:16:55,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 246 transitions, 3486 flow [2025-03-04 02:16:55,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:16:55,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:16:55,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2025-03-04 02:16:55,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5044642857142857 [2025-03-04 02:16:55,144 INFO L175 Difference]: Start difference. First operand has 132 places, 164 transitions, 2120 flow. Second operand 8 states and 113 transitions. [2025-03-04 02:16:55,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 246 transitions, 3486 flow [2025-03-04 02:16:55,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 246 transitions, 3380 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 02:16:55,222 INFO L231 Difference]: Finished difference. Result has 135 places, 180 transitions, 2463 flow [2025-03-04 02:16:55,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2030, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2463, PETRI_PLACES=135, PETRI_TRANSITIONS=180} [2025-03-04 02:16:55,226 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 109 predicate places. [2025-03-04 02:16:55,226 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 180 transitions, 2463 flow [2025-03-04 02:16:55,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:16:55,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:55,227 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:55,234 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-04 02:16:55,427 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,SelfDestructingSolverStorable27 [2025-03-04 02:16:55,427 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-04 02:16:55,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:55,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1129730236, now seen corresponding path program 10 times [2025-03-04 02:16:55,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:55,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264963321] [2025-03-04 02:16:55,428 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:16:55,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:55,432 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:16:55,434 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 27 statements. [2025-03-04 02:16:55,434 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:16:55,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:55,509 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 02:16:55,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:55,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264963321] [2025-03-04 02:16:55,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264963321] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:55,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131670409] [2025-03-04 02:16:55,510 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:16:55,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:16:55,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:16:55,511 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-04 02:16:55,513 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-04 02:16:55,556 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:16:55,565 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 27 statements. [2025-03-04 02:16:55,565 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:16:55,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:55,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 02:16:55,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:16:55,662 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 02:16:55,662 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:16:55,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131670409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:16:55,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:16:55,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 10 [2025-03-04 02:16:55,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507407726] [2025-03-04 02:16:55,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:16:55,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:16:55,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:55,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:16:55,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:16:55,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:16:55,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 180 transitions, 2463 flow. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 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-04 02:16:55,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:55,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:16:55,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:56,243 INFO L124 PetriNetUnfolderBase]: 2660/4869 cut-off events. [2025-03-04 02:16:56,243 INFO L125 PetriNetUnfolderBase]: For 34669/34669 co-relation queries the response was YES. [2025-03-04 02:16:56,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24447 conditions, 4869 events. 2660/4869 cut-off events. For 34669/34669 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 33396 event pairs, 612 based on Foata normal form. 6/4874 useless extension candidates. Maximal degree in co-relation 24372. Up to 2632 conditions per place. [2025-03-04 02:16:56,275 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 129 selfloop transitions, 107 changer transitions 13/252 dead transitions. [2025-03-04 02:16:56,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 252 transitions, 3633 flow [2025-03-04 02:16:56,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:16:56,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:16:56,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2025-03-04 02:16:56,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2025-03-04 02:16:56,276 INFO L175 Difference]: Start difference. First operand has 135 places, 180 transitions, 2463 flow. Second operand 10 states and 124 transitions. [2025-03-04 02:16:56,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 252 transitions, 3633 flow [2025-03-04 02:16:56,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 252 transitions, 3524 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-03-04 02:16:56,373 INFO L231 Difference]: Finished difference. Result has 141 places, 192 transitions, 2811 flow [2025-03-04 02:16:56,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2371, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2811, PETRI_PLACES=141, PETRI_TRANSITIONS=192} [2025-03-04 02:16:56,373 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 115 predicate places. [2025-03-04 02:16:56,373 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 192 transitions, 2811 flow [2025-03-04 02:16:56,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 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-04 02:16:56,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:56,374 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:56,380 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-04 02:16:56,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:16:56,574 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-04 02:16:56,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:56,575 INFO L85 PathProgramCache]: Analyzing trace with hash -603339056, now seen corresponding path program 11 times [2025-03-04 02:16:56,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:56,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428250392] [2025-03-04 02:16:56,575 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:16:56,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:56,581 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-03-04 02:16:56,586 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:16:56,586 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:16:56,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:16:56,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:56,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428250392] [2025-03-04 02:16:56,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428250392] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:56,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541203347] [2025-03-04 02:16:56,638 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:16:56,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:16:56,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:16:56,641 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-04 02:16:56,643 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-04 02:16:56,691 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-03-04 02:16:56,713 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:16:56,714 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 02:16:56,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:56,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:16:56,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:16:56,796 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:16:56,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:16:56,840 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:16:56,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541203347] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:16:56,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:16:56,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 8 [2025-03-04 02:16:56,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064477575] [2025-03-04 02:16:56,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:16:56,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:16:56,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:56,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:16:56,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:16:56,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:16:56,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 192 transitions, 2811 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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-04 02:16:56,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:56,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:16:56,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:57,704 INFO L124 PetriNetUnfolderBase]: 2911/5244 cut-off events. [2025-03-04 02:16:57,705 INFO L125 PetriNetUnfolderBase]: For 47615/47615 co-relation queries the response was YES. [2025-03-04 02:16:57,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28276 conditions, 5244 events. 2911/5244 cut-off events. For 47615/47615 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 35628 event pairs, 502 based on Foata normal form. 48/5291 useless extension candidates. Maximal degree in co-relation 28200. Up to 1156 conditions per place. [2025-03-04 02:16:57,746 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 204 selfloop transitions, 140 changer transitions 7/354 dead transitions. [2025-03-04 02:16:57,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 354 transitions, 5330 flow [2025-03-04 02:16:57,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 02:16:57,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 02:16:57,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 230 transitions. [2025-03-04 02:16:57,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5133928571428571 [2025-03-04 02:16:57,747 INFO L175 Difference]: Start difference. First operand has 141 places, 192 transitions, 2811 flow. Second operand 16 states and 230 transitions. [2025-03-04 02:16:57,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 354 transitions, 5330 flow [2025-03-04 02:16:57,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 354 transitions, 4919 flow, removed 90 selfloop flow, removed 10 redundant places. [2025-03-04 02:16:57,904 INFO L231 Difference]: Finished difference. Result has 148 places, 230 transitions, 3618 flow [2025-03-04 02:16:57,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2459, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3618, PETRI_PLACES=148, PETRI_TRANSITIONS=230} [2025-03-04 02:16:57,904 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 122 predicate places. [2025-03-04 02:16:57,904 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 230 transitions, 3618 flow [2025-03-04 02:16:57,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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-04 02:16:57,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:16:57,905 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:16:57,911 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-04 02:16:58,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:16:58,105 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-04 02:16:58,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:16:58,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1441073811, now seen corresponding path program 1 times [2025-03-04 02:16:58,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:16:58,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521046712] [2025-03-04 02:16:58,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:16:58,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:16:58,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 02:16:58,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:16:58,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:58,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:58,474 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:16:58,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:16:58,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521046712] [2025-03-04 02:16:58,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521046712] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:16:58,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550158347] [2025-03-04 02:16:58,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:16:58,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:16:58,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:16:58,476 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-04 02:16:58,477 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-04 02:16:58,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 02:16:58,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:16:58,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:16:58,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:16:58,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 02:16:58,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:16:58,663 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-04 02:16:58,663 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 34 treesize of output 10 [2025-03-04 02:16:58,668 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:16:58,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:16:58,762 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2025-03-04 02:16:58,763 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2025-03-04 02:16:58,810 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:16:58,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550158347] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:16:58,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:16:58,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 21 [2025-03-04 02:16:58,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007403676] [2025-03-04 02:16:58,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:16:58,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 02:16:58,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:16:58,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 02:16:58,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2025-03-04 02:16:58,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:16:58,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 230 transitions, 3618 flow. Second operand has 22 states, 22 states have (on average 9.5) internal successors, (209), 22 states have internal predecessors, (209), 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-04 02:16:58,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:16:58,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:16:58,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:16:59,961 INFO L124 PetriNetUnfolderBase]: 3026/5684 cut-off events. [2025-03-04 02:16:59,961 INFO L125 PetriNetUnfolderBase]: For 49009/49252 co-relation queries the response was YES. [2025-03-04 02:16:59,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30588 conditions, 5684 events. 3026/5684 cut-off events. For 49009/49252 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 41775 event pairs, 800 based on Foata normal form. 70/5723 useless extension candidates. Maximal degree in co-relation 30511. Up to 3393 conditions per place. [2025-03-04 02:17:00,004 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 268 selfloop transitions, 88 changer transitions 1/369 dead transitions. [2025-03-04 02:17:00,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 369 transitions, 5900 flow [2025-03-04 02:17:00,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 02:17:00,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 02:17:00,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 260 transitions. [2025-03-04 02:17:00,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48872180451127817 [2025-03-04 02:17:00,006 INFO L175 Difference]: Start difference. First operand has 148 places, 230 transitions, 3618 flow. Second operand 19 states and 260 transitions. [2025-03-04 02:17:00,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 369 transitions, 5900 flow [2025-03-04 02:17:00,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 369 transitions, 5650 flow, removed 91 selfloop flow, removed 5 redundant places. [2025-03-04 02:17:00,178 INFO L231 Difference]: Finished difference. Result has 167 places, 260 transitions, 4182 flow [2025-03-04 02:17:00,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3434, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4182, PETRI_PLACES=167, PETRI_TRANSITIONS=260} [2025-03-04 02:17:00,181 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 141 predicate places. [2025-03-04 02:17:00,181 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 260 transitions, 4182 flow [2025-03-04 02:17:00,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.5) internal successors, (209), 22 states have internal predecessors, (209), 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-04 02:17:00,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:00,181 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:00,188 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-04 02:17:00,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:00,385 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-04 02:17:00,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:00,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1502034565, now seen corresponding path program 1 times [2025-03-04 02:17:00,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:00,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036926940] [2025-03-04 02:17:00,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:00,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:00,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 02:17:00,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:17:00,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:00,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:00,687 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:17:00,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:00,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036926940] [2025-03-04 02:17:00,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036926940] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:00,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651987882] [2025-03-04 02:17:00,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:17:00,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:00,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:00,689 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-04 02:17:00,690 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-04 02:17:00,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 02:17:00,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:17:00,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:00,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:00,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 02:17:00,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:00,864 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-04 02:17:00,864 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 35 treesize of output 20 [2025-03-04 02:17:00,866 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:17:00,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:17:00,936 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2025-03-04 02:17:00,936 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2025-03-04 02:17:00,975 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:17:00,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651987882] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:17:00,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:17:00,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 21 [2025-03-04 02:17:00,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708442792] [2025-03-04 02:17:00,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:17:00,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 02:17:00,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:00,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 02:17:00,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2025-03-04 02:17:01,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:17:01,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 260 transitions, 4182 flow. Second operand has 22 states, 22 states have (on average 9.681818181818182) internal successors, (213), 22 states have internal predecessors, (213), 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-04 02:17:01,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:01,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:17:01,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:01,991 INFO L124 PetriNetUnfolderBase]: 3071/5784 cut-off events. [2025-03-04 02:17:01,992 INFO L125 PetriNetUnfolderBase]: For 56284/56528 co-relation queries the response was YES. [2025-03-04 02:17:02,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32858 conditions, 5784 events. 3071/5784 cut-off events. For 56284/56528 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 43089 event pairs, 1010 based on Foata normal form. 21/5762 useless extension candidates. Maximal degree in co-relation 32772. Up to 4384 conditions per place. [2025-03-04 02:17:02,038 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 237 selfloop transitions, 49 changer transitions 36/334 dead transitions. [2025-03-04 02:17:02,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 334 transitions, 5351 flow [2025-03-04 02:17:02,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 02:17:02,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 02:17:02,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 229 transitions. [2025-03-04 02:17:02,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4810924369747899 [2025-03-04 02:17:02,039 INFO L175 Difference]: Start difference. First operand has 167 places, 260 transitions, 4182 flow. Second operand 17 states and 229 transitions. [2025-03-04 02:17:02,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 334 transitions, 5351 flow [2025-03-04 02:17:02,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 334 transitions, 5188 flow, removed 41 selfloop flow, removed 9 redundant places. [2025-03-04 02:17:02,266 INFO L231 Difference]: Finished difference. Result has 178 places, 253 transitions, 4020 flow [2025-03-04 02:17:02,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4019, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=4020, PETRI_PLACES=178, PETRI_TRANSITIONS=253} [2025-03-04 02:17:02,267 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 152 predicate places. [2025-03-04 02:17:02,267 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 253 transitions, 4020 flow [2025-03-04 02:17:02,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.681818181818182) internal successors, (213), 22 states have internal predecessors, (213), 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-04 02:17:02,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:02,267 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:02,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 02:17:02,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:02,468 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-04 02:17:02,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:02,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1380659421, now seen corresponding path program 2 times [2025-03-04 02:17:02,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:02,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147241001] [2025-03-04 02:17:02,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:17:02,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:02,473 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:17:02,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:17:02,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:17:02,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:02,744 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:17:02,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:02,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147241001] [2025-03-04 02:17:02,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147241001] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:02,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431575762] [2025-03-04 02:17:02,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:17:02,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:02,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:02,746 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-04 02:17:02,747 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-04 02:17:02,797 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:17:02,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:17:02,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:17:02,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:02,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 02:17:02,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:03,015 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 02:17:03,015 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 26 treesize of output 10 [2025-03-04 02:17:03,018 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:17:03,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:17:03,105 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2025-03-04 02:17:03,105 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2025-03-04 02:17:03,155 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:17:03,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431575762] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:17:03,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:17:03,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 7] total 23 [2025-03-04 02:17:03,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340655153] [2025-03-04 02:17:03,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:17:03,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 02:17:03,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:03,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 02:17:03,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2025-03-04 02:17:03,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:17:03,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 253 transitions, 4020 flow. Second operand has 24 states, 24 states have (on average 9.291666666666666) internal successors, (223), 24 states have internal predecessors, (223), 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-04 02:17:03,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:03,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:17:03,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:04,882 INFO L124 PetriNetUnfolderBase]: 3421/6464 cut-off events. [2025-03-04 02:17:04,882 INFO L125 PetriNetUnfolderBase]: For 73945/74202 co-relation queries the response was YES. [2025-03-04 02:17:04,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38424 conditions, 6464 events. 3421/6464 cut-off events. For 73945/74202 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 48831 event pairs, 769 based on Foata normal form. 129/6560 useless extension candidates. Maximal degree in co-relation 37755. Up to 3992 conditions per place. [2025-03-04 02:17:04,941 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 344 selfloop transitions, 175 changer transitions 6/537 dead transitions. [2025-03-04 02:17:04,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 537 transitions, 8204 flow [2025-03-04 02:17:04,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-04 02:17:04,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-03-04 02:17:04,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 576 transitions. [2025-03-04 02:17:04,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47840531561461797 [2025-03-04 02:17:04,943 INFO L175 Difference]: Start difference. First operand has 178 places, 253 transitions, 4020 flow. Second operand 43 states and 576 transitions. [2025-03-04 02:17:04,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 537 transitions, 8204 flow [2025-03-04 02:17:05,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 537 transitions, 7912 flow, removed 32 selfloop flow, removed 16 redundant places. [2025-03-04 02:17:05,230 INFO L231 Difference]: Finished difference. Result has 219 places, 363 transitions, 6297 flow [2025-03-04 02:17:05,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3896, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=6297, PETRI_PLACES=219, PETRI_TRANSITIONS=363} [2025-03-04 02:17:05,231 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 193 predicate places. [2025-03-04 02:17:05,231 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 363 transitions, 6297 flow [2025-03-04 02:17:05,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.291666666666666) internal successors, (223), 24 states have internal predecessors, (223), 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-04 02:17:05,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:05,231 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:05,237 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-04 02:17:05,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:05,432 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-04 02:17:05,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:05,432 INFO L85 PathProgramCache]: Analyzing trace with hash 496188589, now seen corresponding path program 3 times [2025-03-04 02:17:05,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:05,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189190317] [2025-03-04 02:17:05,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:17:05,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:05,437 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:17:05,450 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:17:05,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:17:05,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:05,725 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:17:05,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:05,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189190317] [2025-03-04 02:17:05,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189190317] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:05,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3893677] [2025-03-04 02:17:05,727 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:17:05,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:05,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:05,729 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-04 02:17:05,730 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-04 02:17:05,781 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:17:05,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:17:05,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:17:05,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:05,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 02:17:05,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:05,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:17:05,942 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 29 treesize of output 21 [2025-03-04 02:17:05,964 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:17:05,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:17:06,047 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2025-03-04 02:17:06,048 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2025-03-04 02:17:06,089 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:17:06,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3893677] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:17:06,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:17:06,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 7] total 25 [2025-03-04 02:17:06,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773882332] [2025-03-04 02:17:06,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:17:06,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 02:17:06,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:06,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 02:17:06,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2025-03-04 02:17:06,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:17:06,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 363 transitions, 6297 flow. Second operand has 26 states, 26 states have (on average 9.23076923076923) internal successors, (240), 26 states have internal predecessors, (240), 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-04 02:17:06,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:06,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:17:06,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:08,022 INFO L124 PetriNetUnfolderBase]: 4084/7763 cut-off events. [2025-03-04 02:17:08,022 INFO L125 PetriNetUnfolderBase]: For 131853/132138 co-relation queries the response was YES. [2025-03-04 02:17:08,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50984 conditions, 7763 events. 4084/7763 cut-off events. For 131853/132138 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 60443 event pairs, 1032 based on Foata normal form. 54/7772 useless extension candidates. Maximal degree in co-relation 49899. Up to 4682 conditions per place. [2025-03-04 02:17:08,085 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 326 selfloop transitions, 236 changer transitions 18/592 dead transitions. [2025-03-04 02:17:08,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 592 transitions, 10197 flow [2025-03-04 02:17:08,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-04 02:17:08,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-03-04 02:17:08,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 528 transitions. [2025-03-04 02:17:08,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43853820598006643 [2025-03-04 02:17:08,086 INFO L175 Difference]: Start difference. First operand has 219 places, 363 transitions, 6297 flow. Second operand 43 states and 528 transitions. [2025-03-04 02:17:08,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 592 transitions, 10197 flow [2025-03-04 02:17:08,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 592 transitions, 9686 flow, removed 180 selfloop flow, removed 9 redundant places. [2025-03-04 02:17:08,857 INFO L231 Difference]: Finished difference. Result has 267 places, 466 transitions, 8541 flow [2025-03-04 02:17:08,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=5892, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=8541, PETRI_PLACES=267, PETRI_TRANSITIONS=466} [2025-03-04 02:17:08,858 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 241 predicate places. [2025-03-04 02:17:08,858 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 466 transitions, 8541 flow [2025-03-04 02:17:08,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.23076923076923) internal successors, (240), 26 states have internal predecessors, (240), 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-04 02:17:08,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:08,858 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:08,864 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-04 02:17:09,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:09,058 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:09,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:09,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1216400275, now seen corresponding path program 4 times [2025-03-04 02:17:09,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:09,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080499841] [2025-03-04 02:17:09,059 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:17:09,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:09,063 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:17:09,068 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:17:09,068 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:17:09,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:09,214 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:17:09,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:09,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080499841] [2025-03-04 02:17:09,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080499841] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:09,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329241399] [2025-03-04 02:17:09,214 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:17:09,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:09,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:09,216 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-04 02:17:09,218 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-04 02:17:09,268 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:17:09,285 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:17:09,285 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:17:09,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:09,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 02:17:09,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:09,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:17:09,392 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 33 treesize of output 25 [2025-03-04 02:17:09,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:17:09,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:17:09,471 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2025-03-04 02:17:09,471 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2025-03-04 02:17:09,503 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:17:09,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329241399] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:17:09,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:17:09,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 19 [2025-03-04 02:17:09,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347474092] [2025-03-04 02:17:09,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:17:09,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 02:17:09,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:09,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 02:17:09,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-03-04 02:17:09,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:17:09,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 466 transitions, 8541 flow. Second operand has 20 states, 20 states have (on average 9.65) internal successors, (193), 20 states have internal predecessors, (193), 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-04 02:17:09,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:09,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:17:09,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:11,181 INFO L124 PetriNetUnfolderBase]: 3970/7554 cut-off events. [2025-03-04 02:17:11,182 INFO L125 PetriNetUnfolderBase]: For 183444/183734 co-relation queries the response was YES. [2025-03-04 02:17:11,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53997 conditions, 7554 events. 3970/7554 cut-off events. For 183444/183734 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 58486 event pairs, 1194 based on Foata normal form. 69/7583 useless extension candidates. Maximal degree in co-relation 53872. Up to 5644 conditions per place. [2025-03-04 02:17:11,241 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 374 selfloop transitions, 171 changer transitions 7/564 dead transitions. [2025-03-04 02:17:11,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 564 transitions, 10503 flow [2025-03-04 02:17:11,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 02:17:11,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-04 02:17:11,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 371 transitions. [2025-03-04 02:17:11,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45689655172413796 [2025-03-04 02:17:11,242 INFO L175 Difference]: Start difference. First operand has 267 places, 466 transitions, 8541 flow. Second operand 29 states and 371 transitions. [2025-03-04 02:17:11,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 564 transitions, 10503 flow [2025-03-04 02:17:12,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 564 transitions, 10027 flow, removed 162 selfloop flow, removed 20 redundant places. [2025-03-04 02:17:12,135 INFO L231 Difference]: Finished difference. Result has 277 places, 475 transitions, 8694 flow [2025-03-04 02:17:12,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=8045, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=8694, PETRI_PLACES=277, PETRI_TRANSITIONS=475} [2025-03-04 02:17:12,136 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 251 predicate places. [2025-03-04 02:17:12,136 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 475 transitions, 8694 flow [2025-03-04 02:17:12,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.65) internal successors, (193), 20 states have internal predecessors, (193), 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-04 02:17:12,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:12,136 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:12,142 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-04 02:17:12,336 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,SelfDestructingSolverStorable34 [2025-03-04 02:17:12,337 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:12,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:12,337 INFO L85 PathProgramCache]: Analyzing trace with hash -659794677, now seen corresponding path program 2 times [2025-03-04 02:17:12,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:12,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071728053] [2025-03-04 02:17:12,337 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:17:12,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:12,341 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:17:12,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:17:12,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:17:12,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:12,557 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:17:12,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:12,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071728053] [2025-03-04 02:17:12,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071728053] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:12,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117420544] [2025-03-04 02:17:12,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:17:12,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:12,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:12,559 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-04 02:17:12,560 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-04 02:17:12,611 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:17:12,628 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:17:12,628 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:17:12,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:12,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 02:17:12,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:12,794 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 02:17:12,794 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 27 treesize of output 15 [2025-03-04 02:17:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:17:12,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:17:12,876 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2025-03-04 02:17:12,876 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 60 [2025-03-04 02:17:12,914 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:17:12,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117420544] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:17:12,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:17:12,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 7] total 23 [2025-03-04 02:17:12,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253695005] [2025-03-04 02:17:12,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:17:12,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 02:17:12,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:12,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 02:17:12,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2025-03-04 02:17:13,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:17:13,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 475 transitions, 8694 flow. Second operand has 24 states, 24 states have (on average 9.291666666666666) internal successors, (223), 24 states have internal predecessors, (223), 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-04 02:17:13,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:13,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:17:13,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:14,823 INFO L124 PetriNetUnfolderBase]: 4709/8960 cut-off events. [2025-03-04 02:17:14,824 INFO L125 PetriNetUnfolderBase]: For 232529/232902 co-relation queries the response was YES. [2025-03-04 02:17:14,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63173 conditions, 8960 events. 4709/8960 cut-off events. For 232529/232902 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 71472 event pairs, 1251 based on Foata normal form. 68/8963 useless extension candidates. Maximal degree in co-relation 63047. Up to 6189 conditions per place. [2025-03-04 02:17:14,888 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 434 selfloop transitions, 181 changer transitions 27/654 dead transitions. [2025-03-04 02:17:14,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 654 transitions, 12258 flow [2025-03-04 02:17:14,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 02:17:14,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-04 02:17:14,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 347 transitions. [2025-03-04 02:17:14,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4766483516483517 [2025-03-04 02:17:14,889 INFO L175 Difference]: Start difference. First operand has 277 places, 475 transitions, 8694 flow. Second operand 26 states and 347 transitions. [2025-03-04 02:17:14,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 654 transitions, 12258 flow [2025-03-04 02:17:16,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 654 transitions, 11959 flow, removed 32 selfloop flow, removed 16 redundant places. [2025-03-04 02:17:16,050 INFO L231 Difference]: Finished difference. Result has 295 places, 536 transitions, 10250 flow [2025-03-04 02:17:16,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=8458, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=10250, PETRI_PLACES=295, PETRI_TRANSITIONS=536} [2025-03-04 02:17:16,051 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 269 predicate places. [2025-03-04 02:17:16,051 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 536 transitions, 10250 flow [2025-03-04 02:17:16,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.291666666666666) internal successors, (223), 24 states have internal predecessors, (223), 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-04 02:17:16,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:16,051 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:16,057 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-04 02:17:16,251 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,SelfDestructingSolverStorable35 [2025-03-04 02:17:16,251 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:16,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:16,252 INFO L85 PathProgramCache]: Analyzing trace with hash 157750227, now seen corresponding path program 3 times [2025-03-04 02:17:16,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:16,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681957815] [2025-03-04 02:17:16,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:17:16,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:16,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-03-04 02:17:16,266 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:17:16,266 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 02:17:16,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:17:16,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:16,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681957815] [2025-03-04 02:17:16,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681957815] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:16,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529947292] [2025-03-04 02:17:16,481 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:17:16,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:16,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:16,483 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-04 02:17:16,484 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-04 02:17:16,531 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-03-04 02:17:16,554 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:17:16,554 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 02:17:16,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:16,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-04 02:17:16,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:16,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 02:17:16,620 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-04 02:17:16,648 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 02:17:16,649 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 11 treesize of output 11 [2025-03-04 02:17:16,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 02:17:16,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-04 02:17:16,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-04 02:17:16,943 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:17:16,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:17:17,192 INFO L349 Elim1Store]: treesize reduction 38, result has 53.7 percent of original size [2025-03-04 02:17:17,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 125 [2025-03-04 02:17:17,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:17:17,532 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 66 [2025-03-04 02:17:17,541 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:17:17,541 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 111 treesize of output 90 [2025-03-04 02:17:17,546 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:17:17,578 INFO L349 Elim1Store]: treesize reduction 8, result has 83.0 percent of original size [2025-03-04 02:17:17,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 87 treesize of output 87 [2025-03-04 02:17:17,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:17:17,640 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 49 [2025-03-04 02:17:17,648 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:17:17,649 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 76 treesize of output 64 [2025-03-04 02:17:17,654 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:17:17,687 INFO L349 Elim1Store]: treesize reduction 8, result has 83.0 percent of original size [2025-03-04 02:17:17,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 72 [2025-03-04 02:17:17,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:17:17,733 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 73 [2025-03-04 02:17:17,741 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:17:17,741 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 125 treesize of output 101 [2025-03-04 02:17:17,748 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:17:17,749 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:17:17,793 INFO L349 Elim1Store]: treesize reduction 8, result has 90.6 percent of original size [2025-03-04 02:17:17,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 98 treesize of output 125 [2025-03-04 02:17:17,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:17:17,871 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 56 [2025-03-04 02:17:17,877 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:17:17,877 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 90 treesize of output 75 [2025-03-04 02:17:17,880 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 02:17:17,902 INFO L349 Elim1Store]: treesize reduction 8, result has 84.9 percent of original size [2025-03-04 02:17:17,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 78 [2025-03-04 02:17:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:17:18,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529947292] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:17:18,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:17:18,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 33 [2025-03-04 02:17:18,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785685917] [2025-03-04 02:17:18,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:17:18,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 02:17:18,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:18,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 02:17:18,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=929, Unknown=8, NotChecked=0, Total=1122 [2025-03-04 02:17:18,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:17:18,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 536 transitions, 10250 flow. Second operand has 34 states, 34 states have (on average 6.794117647058823) internal successors, (231), 34 states have internal predecessors, (231), 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-04 02:17:18,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:18,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:17:18,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:19,164 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~i_AB~0 4))) (let ((.cse10 (+ .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse14 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_129| Int)) (or (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_129| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_129|) 0))))) (.cse12 (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse13 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_129| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_129|) 0)))) (.cse4 (* c_~i_BA~0 4))) (let ((.cse0 (select |c_#memory_int#1| c_~B~0.base)) (.cse2 (select |c_#memory_int#1| c_~A~0.base)) (.cse17 (+ 4 .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse18 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ c_~A~0.offset .cse4 4)) (.cse3 (+ c_~A~0.offset 4 .cse1)) (.cse15 (= c_~i_BA~0 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|)) (.cse7 (and .cse14 (or .cse12 .cse13))) (.cse11 (= .cse10 0)) (.cse9 (= c_~i_AB~0 0)) (.cse6 (= c_~i_BA~0 0))) (and (= c_~i_BA~0 1) (= c_~B~0.offset 0) (or (= (select .cse0 (+ 4 c_~B~0.offset .cse1)) (select .cse2 .cse3)) (not (= (select .cse0 (+ .cse4 4 c_~B~0.offset)) (select .cse2 .cse5)))) (or .cse6 (let ((.cse8 (= c_~i_AB~0 c_~i_BA~0))) (and (or .cse7 .cse8 .cse9) (or .cse8 (and (or (and (= (+ .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 0) (= .cse10 .cse4)) .cse11 .cse12 .cse13) .cse14))))) (or (not .cse15) (and (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_1) c_~A~0.base))) (or (= (select .cse16 .cse3) (select v_arrayElimArr_1 .cse17)) (not (= (select v_arrayElimArr_1 .cse18) (select .cse16 .cse5)))))) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_1) c_~A~0.base))) (let ((.cse19 (select .cse21 .cse3)) (.cse20 (select v_arrayElimArr_1 .cse18))) (or (= .cse19 (select v_arrayElimArr_1 .cse17)) (= .cse19 .cse20) (not (= .cse20 (select .cse21 .cse5))))))))) (= c_~A~0.offset 0) (= |c_thread1Thread1of1ForFork1_#t~mem2| (select .cse0 4)) (= |c_thread1Thread1of1ForFork1_#t~mem1| (select .cse2 4)) (not (= c_~B~0.base c_~A~0.base)) (or (let ((.cse23 (+ .cse4 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_1) c_~A~0.base))) (or (= (select .cse22 .cse3) (select v_arrayElimArr_1 .cse17)) (not (= (select .cse22 .cse5) (select v_arrayElimArr_1 .cse23)))))) (= c_~i_AB~0 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|)) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_1) c_~A~0.base))) (let ((.cse24 (select .cse25 .cse3))) (or (= .cse24 (select v_arrayElimArr_1 .cse17)) (= .cse24 (select v_arrayElimArr_1 .cse18)) (not (= (select .cse25 .cse5) (select v_arrayElimArr_1 .cse23))))))))) .cse15) (or (and (or .cse7 .cse9) (or (and (or .cse11 .cse12 .cse13) .cse14) .cse9)) (not .cse6)))))) is different from false [2025-03-04 02:17:21,935 INFO L124 PetriNetUnfolderBase]: 6593/12055 cut-off events. [2025-03-04 02:17:21,935 INFO L125 PetriNetUnfolderBase]: For 294770/294770 co-relation queries the response was YES. [2025-03-04 02:17:22,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87176 conditions, 12055 events. 6593/12055 cut-off events. For 294770/294770 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 94206 event pairs, 1923 based on Foata normal form. 96/12149 useless extension candidates. Maximal degree in co-relation 87040. Up to 9489 conditions per place. [2025-03-04 02:17:22,030 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 587 selfloop transitions, 322 changer transitions 11/923 dead transitions. [2025-03-04 02:17:22,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 923 transitions, 18285 flow [2025-03-04 02:17:22,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-04 02:17:22,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-03-04 02:17:22,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 421 transitions. [2025-03-04 02:17:22,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38553113553113555 [2025-03-04 02:17:22,032 INFO L175 Difference]: Start difference. First operand has 295 places, 536 transitions, 10250 flow. Second operand 39 states and 421 transitions. [2025-03-04 02:17:22,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 923 transitions, 18285 flow [2025-03-04 02:17:23,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 923 transitions, 18014 flow, removed 78 selfloop flow, removed 14 redundant places. [2025-03-04 02:17:23,921 INFO L231 Difference]: Finished difference. Result has 333 places, 774 transitions, 16104 flow [2025-03-04 02:17:23,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=10124, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=16104, PETRI_PLACES=333, PETRI_TRANSITIONS=774} [2025-03-04 02:17:23,922 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 307 predicate places. [2025-03-04 02:17:23,922 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 774 transitions, 16104 flow [2025-03-04 02:17:23,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.794117647058823) internal successors, (231), 34 states have internal predecessors, (231), 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-04 02:17:23,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:23,922 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:23,930 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-04 02:17:24,122 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,SelfDestructingSolverStorable36 [2025-03-04 02:17:24,123 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:24,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:24,123 INFO L85 PathProgramCache]: Analyzing trace with hash 683361205, now seen corresponding path program 4 times [2025-03-04 02:17:24,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:24,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236335960] [2025-03-04 02:17:24,123 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:17:24,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:24,128 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:17:24,132 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:17:24,132 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:17:24,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:24,210 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:17:24,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:24,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236335960] [2025-03-04 02:17:24,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236335960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:24,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217716596] [2025-03-04 02:17:24,211 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:17:24,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:24,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:24,213 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-04 02:17:24,214 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-04 02:17:24,269 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:17:24,287 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:17:24,287 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:17:24,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:24,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 02:17:24,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:24,347 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 19 treesize of output 1 [2025-03-04 02:17:24,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:17:24,443 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 33 treesize of output 25 [2025-03-04 02:17:24,474 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:17:24,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:17:24,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:17:24,648 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 168 treesize of output 164 [2025-03-04 02:17:24,683 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:17:24,683 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 50 treesize of output 39 [2025-03-04 02:17:24,723 INFO L349 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-03-04 02:17:24,724 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 194 [2025-03-04 02:17:24,860 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:17:24,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217716596] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:17:24,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:17:24,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 9] total 23 [2025-03-04 02:17:24,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346121767] [2025-03-04 02:17:24,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:17:24,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 02:17:24,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:24,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 02:17:24,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2025-03-04 02:17:24,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:17:24,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 774 transitions, 16104 flow. Second operand has 24 states, 24 states have (on average 9.333333333333334) internal successors, (224), 24 states have internal predecessors, (224), 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-04 02:17:24,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:24,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:17:24,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:28,441 INFO L124 PetriNetUnfolderBase]: 5781/11083 cut-off events. [2025-03-04 02:17:28,441 INFO L125 PetriNetUnfolderBase]: For 303455/303821 co-relation queries the response was YES. [2025-03-04 02:17:28,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85227 conditions, 11083 events. 5781/11083 cut-off events. For 303455/303821 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 91266 event pairs, 1594 based on Foata normal form. 94/11123 useless extension candidates. Maximal degree in co-relation 85076. Up to 8417 conditions per place. [2025-03-04 02:17:28,579 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 560 selfloop transitions, 283 changer transitions 17/872 dead transitions. [2025-03-04 02:17:28,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 872 transitions, 19077 flow [2025-03-04 02:17:28,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 02:17:28,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 02:17:28,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 303 transitions. [2025-03-04 02:17:28,580 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4704968944099379 [2025-03-04 02:17:28,580 INFO L175 Difference]: Start difference. First operand has 333 places, 774 transitions, 16104 flow. Second operand 23 states and 303 transitions. [2025-03-04 02:17:28,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 872 transitions, 19077 flow [2025-03-04 02:17:31,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 872 transitions, 18834 flow, removed 107 selfloop flow, removed 6 redundant places. [2025-03-04 02:17:31,233 INFO L231 Difference]: Finished difference. Result has 352 places, 783 transitions, 16838 flow [2025-03-04 02:17:31,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=15713, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=767, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=263, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=16838, PETRI_PLACES=352, PETRI_TRANSITIONS=783} [2025-03-04 02:17:31,234 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 326 predicate places. [2025-03-04 02:17:31,234 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 783 transitions, 16838 flow [2025-03-04 02:17:31,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.333333333333334) internal successors, (224), 24 states have internal predecessors, (224), 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-04 02:17:31,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:31,235 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:31,240 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-04 02:17:31,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:31,437 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:31,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:31,437 INFO L85 PathProgramCache]: Analyzing trace with hash -2057460275, now seen corresponding path program 5 times [2025-03-04 02:17:31,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:31,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722189596] [2025-03-04 02:17:31,438 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:17:31,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:31,444 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:17:31,450 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:17:31,450 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:17:31,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:31,704 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:17:31,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:31,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722189596] [2025-03-04 02:17:31,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722189596] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:31,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41567156] [2025-03-04 02:17:31,704 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:17:31,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:31,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:31,710 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-04 02:17:31,714 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-04 02:17:31,786 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:17:31,812 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:17:31,813 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:17:31,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:31,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 02:17:31,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:31,901 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-04 02:17:31,902 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 35 treesize of output 20 [2025-03-04 02:17:31,903 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:17:31,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:17:31,957 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:17:31,957 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:17:31,975 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:17:31,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41567156] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:17:31,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:17:31,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 15 [2025-03-04 02:17:31,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127305005] [2025-03-04 02:17:31,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:17:31,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 02:17:31,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:31,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 02:17:31,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:17:32,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:17:32,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 783 transitions, 16838 flow. Second operand has 16 states, 16 states have (on average 9.875) internal successors, (158), 16 states have internal predecessors, (158), 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-04 02:17:32,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:32,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:17:32,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:34,424 INFO L124 PetriNetUnfolderBase]: 5727/10945 cut-off events. [2025-03-04 02:17:34,424 INFO L125 PetriNetUnfolderBase]: For 329846/330216 co-relation queries the response was YES. [2025-03-04 02:17:34,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86196 conditions, 10945 events. 5727/10945 cut-off events. For 329846/330216 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 89926 event pairs, 1703 based on Foata normal form. 44/10937 useless extension candidates. Maximal degree in co-relation 86042. Up to 8955 conditions per place. [2025-03-04 02:17:34,559 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 615 selfloop transitions, 193 changer transitions 21/841 dead transitions. [2025-03-04 02:17:34,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 841 transitions, 19119 flow [2025-03-04 02:17:34,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 02:17:34,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 02:17:34,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 221 transitions. [2025-03-04 02:17:34,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49330357142857145 [2025-03-04 02:17:34,560 INFO L175 Difference]: Start difference. First operand has 352 places, 783 transitions, 16838 flow. Second operand 16 states and 221 transitions. [2025-03-04 02:17:34,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 841 transitions, 19119 flow [2025-03-04 02:17:37,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 841 transitions, 18537 flow, removed 85 selfloop flow, removed 17 redundant places. [2025-03-04 02:17:37,437 INFO L231 Difference]: Finished difference. Result has 354 places, 788 transitions, 16943 flow [2025-03-04 02:17:37,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=16300, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=783, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=594, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=16943, PETRI_PLACES=354, PETRI_TRANSITIONS=788} [2025-03-04 02:17:37,438 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 328 predicate places. [2025-03-04 02:17:37,438 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 788 transitions, 16943 flow [2025-03-04 02:17:37,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.875) internal successors, (158), 16 states have internal predecessors, (158), 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-04 02:17:37,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:37,438 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:37,444 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-04 02:17:37,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-04 02:17:37,639 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:37,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:37,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1663827947, now seen corresponding path program 6 times [2025-03-04 02:17:37,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:37,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197328735] [2025-03-04 02:17:37,639 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:17:37,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:37,644 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:17:37,651 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:17:37,652 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:17:37,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:17:37,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:37,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197328735] [2025-03-04 02:17:37,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197328735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:37,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157377276] [2025-03-04 02:17:37,789 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:17:37,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:37,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:37,791 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-04 02:17:37,793 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-04 02:17:37,844 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:17:37,862 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:17:37,862 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:17:37,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:37,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 02:17:37,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:37,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:17:37,961 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 29 treesize of output 21 [2025-03-04 02:17:37,982 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:17:37,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:17:38,044 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:17:38,044 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:17:38,085 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:17:38,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157377276] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:17:38,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:17:38,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 6] total 18 [2025-03-04 02:17:38,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420726417] [2025-03-04 02:17:38,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:17:38,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 02:17:38,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:38,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 02:17:38,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:17:38,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:17:38,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 788 transitions, 16943 flow. Second operand has 19 states, 19 states have (on average 9.421052631578947) internal successors, (179), 19 states have internal predecessors, (179), 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-04 02:17:38,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:38,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:17:38,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:41,126 INFO L124 PetriNetUnfolderBase]: 5737/10985 cut-off events. [2025-03-04 02:17:41,127 INFO L125 PetriNetUnfolderBase]: For 299194/299578 co-relation queries the response was YES. [2025-03-04 02:17:41,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84348 conditions, 10985 events. 5737/10985 cut-off events. For 299194/299578 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 90648 event pairs, 1632 based on Foata normal form. 56/10985 useless extension candidates. Maximal degree in co-relation 84189. Up to 8725 conditions per place. [2025-03-04 02:17:41,223 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 642 selfloop transitions, 240 changer transitions 23/917 dead transitions. [2025-03-04 02:17:41,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 917 transitions, 20441 flow [2025-03-04 02:17:41,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 02:17:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-04 02:17:41,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 340 transitions. [2025-03-04 02:17:41,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2025-03-04 02:17:41,225 INFO L175 Difference]: Start difference. First operand has 354 places, 788 transitions, 16943 flow. Second operand 25 states and 340 transitions. [2025-03-04 02:17:41,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 917 transitions, 20441 flow [2025-03-04 02:17:43,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 917 transitions, 19998 flow, removed 98 selfloop flow, removed 9 redundant places. [2025-03-04 02:17:43,371 INFO L231 Difference]: Finished difference. Result has 371 places, 808 transitions, 17655 flow [2025-03-04 02:17:43,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=16551, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=786, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=218, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=17655, PETRI_PLACES=371, PETRI_TRANSITIONS=808} [2025-03-04 02:17:43,372 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 345 predicate places. [2025-03-04 02:17:43,372 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 808 transitions, 17655 flow [2025-03-04 02:17:43,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 9.421052631578947) internal successors, (179), 19 states have internal predecessors, (179), 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-04 02:17:43,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:43,372 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:43,379 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-04 02:17:43,572 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,SelfDestructingSolverStorable39 [2025-03-04 02:17:43,573 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:43,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:43,573 INFO L85 PathProgramCache]: Analyzing trace with hash 918550485, now seen corresponding path program 7 times [2025-03-04 02:17:43,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:43,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18367706] [2025-03-04 02:17:43,573 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:17:43,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:43,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 02:17:43,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:17:43,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:43,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:43,923 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:17:43,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:43,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18367706] [2025-03-04 02:17:43,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18367706] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:43,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556248725] [2025-03-04 02:17:43,923 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:17:43,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:43,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:43,925 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-04 02:17:43,927 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-04 02:17:43,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 02:17:44,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:17:44,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:17:44,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:44,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 02:17:44,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:44,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:17:44,078 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 37 treesize of output 25 [2025-03-04 02:17:44,085 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:17:44,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:17:44,148 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:17:44,149 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:17:44,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:17:44,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556248725] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:17:44,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:17:44,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 6] total 19 [2025-03-04 02:17:44,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131242426] [2025-03-04 02:17:44,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:17:44,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 02:17:44,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:44,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 02:17:44,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-03-04 02:17:44,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:17:44,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 808 transitions, 17655 flow. Second operand has 20 states, 20 states have (on average 9.7) internal successors, (194), 20 states have internal predecessors, (194), 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-04 02:17:44,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:44,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:17:44,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:46,753 INFO L124 PetriNetUnfolderBase]: 5490/10474 cut-off events. [2025-03-04 02:17:46,753 INFO L125 PetriNetUnfolderBase]: For 311499/311863 co-relation queries the response was YES. [2025-03-04 02:17:47,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82022 conditions, 10474 events. 5490/10474 cut-off events. For 311499/311863 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 84686 event pairs, 1608 based on Foata normal form. 77/10501 useless extension candidates. Maximal degree in co-relation 81862. Up to 8727 conditions per place. [2025-03-04 02:17:47,093 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 614 selfloop transitions, 227 changer transitions 3/856 dead transitions. [2025-03-04 02:17:47,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 856 transitions, 19672 flow [2025-03-04 02:17:47,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 02:17:47,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 02:17:47,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 240 transitions. [2025-03-04 02:17:47,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45112781954887216 [2025-03-04 02:17:47,094 INFO L175 Difference]: Start difference. First operand has 371 places, 808 transitions, 17655 flow. Second operand 19 states and 240 transitions. [2025-03-04 02:17:47,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 856 transitions, 19672 flow [2025-03-04 02:17:49,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 856 transitions, 19364 flow, removed 38 selfloop flow, removed 15 redundant places. [2025-03-04 02:17:49,267 INFO L231 Difference]: Finished difference. Result has 369 places, 797 transitions, 17514 flow [2025-03-04 02:17:49,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=17061, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=799, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=227, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=17514, PETRI_PLACES=369, PETRI_TRANSITIONS=797} [2025-03-04 02:17:49,269 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 343 predicate places. [2025-03-04 02:17:49,269 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 797 transitions, 17514 flow [2025-03-04 02:17:49,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.7) internal successors, (194), 20 states have internal predecessors, (194), 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-04 02:17:49,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:49,270 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:49,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-03-04 02:17:49,470 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,SelfDestructingSolverStorable40 [2025-03-04 02:17:49,470 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:49,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:49,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1210040855, now seen corresponding path program 5 times [2025-03-04 02:17:49,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:49,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424996354] [2025-03-04 02:17:49,471 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:17:49,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:49,482 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:17:49,491 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:17:49,491 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:17:49,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:49,943 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:17:49,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:49,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424996354] [2025-03-04 02:17:49,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424996354] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:49,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519317235] [2025-03-04 02:17:49,943 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:17:49,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:49,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:49,947 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-04 02:17:49,947 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-04 02:17:50,008 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:17:50,026 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:17:50,026 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:17:50,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:50,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 02:17:50,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:50,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:17:50,136 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 33 treesize of output 25 [2025-03-04 02:17:50,142 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:17:50,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:17:50,202 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:17:50,202 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:17:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:17:50,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519317235] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:17:50,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:17:50,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 16 [2025-03-04 02:17:50,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178724804] [2025-03-04 02:17:50,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:17:50,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 02:17:50,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:50,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 02:17:50,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:17:50,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-03-04 02:17:50,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 797 transitions, 17514 flow. Second operand has 17 states, 17 states have (on average 10.058823529411764) internal successors, (171), 17 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:17:50,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:50,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-03-04 02:17:50,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:17:52,979 INFO L124 PetriNetUnfolderBase]: 5684/10870 cut-off events. [2025-03-04 02:17:52,979 INFO L125 PetriNetUnfolderBase]: For 312513/312887 co-relation queries the response was YES. [2025-03-04 02:17:53,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85283 conditions, 10870 events. 5684/10870 cut-off events. For 312513/312887 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 89044 event pairs, 1571 based on Foata normal form. 76/10888 useless extension candidates. Maximal degree in co-relation 85126. Up to 8698 conditions per place. [2025-03-04 02:17:53,111 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 622 selfloop transitions, 253 changer transitions 1/888 dead transitions. [2025-03-04 02:17:53,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 888 transitions, 20278 flow [2025-03-04 02:17:53,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 02:17:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 02:17:53,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 293 transitions. [2025-03-04 02:17:53,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4549689440993789 [2025-03-04 02:17:53,112 INFO L175 Difference]: Start difference. First operand has 369 places, 797 transitions, 17514 flow. Second operand 23 states and 293 transitions. [2025-03-04 02:17:53,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 888 transitions, 20278 flow [2025-03-04 02:17:55,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 888 transitions, 19868 flow, removed 4 selfloop flow, removed 17 redundant places. [2025-03-04 02:17:55,382 INFO L231 Difference]: Finished difference. Result has 376 places, 820 transitions, 18203 flow [2025-03-04 02:17:55,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=17106, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=797, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=233, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=18203, PETRI_PLACES=376, PETRI_TRANSITIONS=820} [2025-03-04 02:17:55,383 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 350 predicate places. [2025-03-04 02:17:55,383 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 820 transitions, 18203 flow [2025-03-04 02:17:55,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.058823529411764) internal successors, (171), 17 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:17:55,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:17:55,383 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:17:55,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-03-04 02:17:55,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:55,583 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:17:55,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:17:55,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1932768197, now seen corresponding path program 6 times [2025-03-04 02:17:55,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:17:55,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108139416] [2025-03-04 02:17:55,584 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:17:55,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:17:55,590 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:17:55,601 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:17:55,601 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:17:55,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:55,938 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:17:55,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:17:55,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108139416] [2025-03-04 02:17:55,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108139416] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:17:55,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964530787] [2025-03-04 02:17:55,939 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:17:55,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:17:55,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:17:55,941 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:17:55,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-04 02:17:56,002 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-03-04 02:17:56,021 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:17:56,021 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:17:56,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:17:56,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 02:17:56,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:17:56,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:17:56,157 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 29 treesize of output 21 [2025-03-04 02:17:56,187 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:17:56,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:17:56,259 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 02:17:56,259 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 02:17:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 02:17:56,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964530787] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:17:56,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:17:56,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 6] total 24 [2025-03-04 02:17:56,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045060525] [2025-03-04 02:17:56,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:17:56,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 02:17:56,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:17:56,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 02:17:56,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-03-04 02:17:56,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2025-03-04 02:17:56,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 820 transitions, 18203 flow. Second operand has 25 states, 25 states have (on average 8.44) internal successors, (211), 25 states have internal predecessors, (211), 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-04 02:17:56,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:17:56,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2025-03-04 02:17:56,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:00,641 INFO L124 PetriNetUnfolderBase]: 7104/13267 cut-off events. [2025-03-04 02:18:00,641 INFO L125 PetriNetUnfolderBase]: For 355768/355926 co-relation queries the response was YES. [2025-03-04 02:18:00,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105603 conditions, 13267 events. 7104/13267 cut-off events. For 355768/355926 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 108734 event pairs, 1709 based on Foata normal form. 112/13359 useless extension candidates. Maximal degree in co-relation 105444. Up to 8989 conditions per place. [2025-03-04 02:18:00,776 INFO L140 encePairwiseOnDemand]: 14/28 looper letters, 689 selfloop transitions, 555 changer transitions 18/1267 dead transitions. [2025-03-04 02:18:00,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 1267 transitions, 28355 flow [2025-03-04 02:18:00,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-04 02:18:00,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2025-03-04 02:18:00,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 640 transitions. [2025-03-04 02:18:00,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.431266846361186 [2025-03-04 02:18:00,777 INFO L175 Difference]: Start difference. First operand has 376 places, 820 transitions, 18203 flow. Second operand 53 states and 640 transitions. [2025-03-04 02:18:00,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 1267 transitions, 28355 flow