./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/chl-array-int-subst.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 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:27:59,694 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:27:59,743 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:27:59,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:27:59,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:27:59,769 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:27:59,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:27:59,771 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:27:59,771 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:27:59,771 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:27:59,772 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:27:59,772 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:27:59,772 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:27:59,772 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:27:59,773 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:27:59,773 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:27:59,773 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:27:59,773 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:27:59,774 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:27:59,774 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:27:59,774 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:27:59,774 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:27:59,774 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:27:59,774 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:27:59,774 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:27:59,774 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:27:59,774 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:27:59,774 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:27:59,775 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:27:59,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:27:59,775 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:27:59,775 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:27:59,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:27:59,775 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:27:59,775 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:27:59,775 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:27:59,775 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:27:59,776 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:27:59,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:27:59,776 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:27:59,776 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:27:59,776 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:27:59,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:27:59,776 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 -> 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 [2025-03-08 17:27:59,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:27:59,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:27:59,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:27:59,980 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:27:59,980 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:27:59,981 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2025-03-08 17:28:01,049 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a377dba07/fad0133a6a8a4464b4027fbeb0671f87/FLAGdad195848 [2025-03-08 17:28:01,234 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:28:01,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2025-03-08 17:28:01,256 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a377dba07/fad0133a6a8a4464b4027fbeb0671f87/FLAGdad195848 [2025-03-08 17:28:01,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a377dba07/fad0133a6a8a4464b4027fbeb0671f87 [2025-03-08 17:28:01,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:28:01,612 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:28:01,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:28:01,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:28:01,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:28:01,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:28:01" (1/1) ... [2025-03-08 17:28:01,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ccc0a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:01, skipping insertion in model container [2025-03-08 17:28:01,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:28:01" (1/1) ... [2025-03-08 17:28:01,627 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:28:01,752 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/chl-array-int-subst.wvr.c[2820,2833] [2025-03-08 17:28:01,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:28:01,771 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:28:01,792 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/chl-array-int-subst.wvr.c[2820,2833] [2025-03-08 17:28:01,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:28:01,807 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:28:01,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:01 WrapperNode [2025-03-08 17:28:01,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:28:01,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:28:01,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:28:01,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:28:01,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:01" (1/1) ... [2025-03-08 17:28:01,820 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:01" (1/1) ... [2025-03-08 17:28:01,844 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 256 [2025-03-08 17:28:01,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:28:01,847 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:28:01,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:28:01,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:28:01,854 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:01" (1/1) ... [2025-03-08 17:28:01,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:01" (1/1) ... [2025-03-08 17:28:01,862 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:01" (1/1) ... [2025-03-08 17:28:01,883 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-08 17:28:01,884 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:01" (1/1) ... [2025-03-08 17:28:01,884 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:01" (1/1) ... [2025-03-08 17:28:01,891 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:01" (1/1) ... [2025-03-08 17:28:01,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:01" (1/1) ... [2025-03-08 17:28:01,898 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:01" (1/1) ... [2025-03-08 17:28:01,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:01" (1/1) ... [2025-03-08 17:28:01,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:28:01,901 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:28:01,901 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:28:01,901 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:28:01,901 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:01" (1/1) ... [2025-03-08 17:28:01,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:28:01,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:28:01,928 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-08 17:28:01,933 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-08 17:28:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:28:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 17:28:01,949 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 17:28:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 17:28:01,949 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 17:28:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 17:28:01,949 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 17:28:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:28:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:28:01,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 17:28:01,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 17:28:01,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 17:28:01,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:28:01,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:28:01,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 17:28:01,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 17:28:01,951 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:28:02,025 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:28:02,027 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:28:02,371 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:28:02,371 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:28:02,630 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:28:02,630 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:28:02,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:28:02 BoogieIcfgContainer [2025-03-08 17:28:02,631 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:28:02,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:28:02,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:28:02,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:28:02,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:28:01" (1/3) ... [2025-03-08 17:28:02,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c52455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:28:02, skipping insertion in model container [2025-03-08 17:28:02,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:01" (2/3) ... [2025-03-08 17:28:02,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c52455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:28:02, skipping insertion in model container [2025-03-08 17:28:02,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:28:02" (3/3) ... [2025-03-08 17:28:02,638 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-subst.wvr.c [2025-03-08 17:28:02,648 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:28:02,649 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-subst.wvr.c that has 4 procedures, 32 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-08 17:28:02,649 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:28:02,696 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 17:28:02,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 40 transitions, 101 flow [2025-03-08 17:28:02,750 INFO L124 PetriNetUnfolderBase]: 9/37 cut-off events. [2025-03-08 17:28:02,752 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:28:02,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 37 events. 9/37 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-03-08 17:28:02,757 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 40 transitions, 101 flow [2025-03-08 17:28:02,759 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 36 transitions, 90 flow [2025-03-08 17:28:02,767 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:28:02,777 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;@1f828a51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:28:02,779 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-08 17:28:02,790 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:28:02,790 INFO L124 PetriNetUnfolderBase]: 9/35 cut-off events. [2025-03-08 17:28:02,790 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:28:02,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:02,791 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, 1] [2025-03-08 17:28:02,791 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:02,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:02,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1479501132, now seen corresponding path program 1 times [2025-03-08 17:28:02,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:02,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211060394] [2025-03-08 17:28:02,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:02,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:02,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 17:28:02,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 17:28:02,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:02,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:03,601 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-08 17:28:03,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:03,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211060394] [2025-03-08 17:28:03,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211060394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:28:03,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:28:03,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:28:03,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969696018] [2025-03-08 17:28:03,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:03,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:28:03,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:03,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:28:03,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:28:03,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:03,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 36 transitions, 90 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:03,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:03,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:03,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:04,287 INFO L124 PetriNetUnfolderBase]: 2153/3087 cut-off events. [2025-03-08 17:28:04,287 INFO L125 PetriNetUnfolderBase]: For 237/237 co-relation queries the response was YES. [2025-03-08 17:28:04,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6189 conditions, 3087 events. 2153/3087 cut-off events. For 237/237 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 14465 event pairs, 208 based on Foata normal form. 1/2624 useless extension candidates. Maximal degree in co-relation 3509. Up to 1010 conditions per place. [2025-03-08 17:28:04,304 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 101 selfloop transitions, 16 changer transitions 1/122 dead transitions. [2025-03-08 17:28:04,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 122 transitions, 546 flow [2025-03-08 17:28:04,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 17:28:04,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-08 17:28:04,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2025-03-08 17:28:04,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4725 [2025-03-08 17:28:04,314 INFO L175 Difference]: Start difference. First operand has 37 places, 36 transitions, 90 flow. Second operand 10 states and 189 transitions. [2025-03-08 17:28:04,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 122 transitions, 546 flow [2025-03-08 17:28:04,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 122 transitions, 502 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 17:28:04,322 INFO L231 Difference]: Finished difference. Result has 44 places, 52 transitions, 178 flow [2025-03-08 17:28:04,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=178, PETRI_PLACES=44, PETRI_TRANSITIONS=52} [2025-03-08 17:28:04,327 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2025-03-08 17:28:04,327 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 52 transitions, 178 flow [2025-03-08 17:28:04,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:04,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:04,327 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, 1] [2025-03-08 17:28:04,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:28:04,328 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:04,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:04,328 INFO L85 PathProgramCache]: Analyzing trace with hash 609921550, now seen corresponding path program 2 times [2025-03-08 17:28:04,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:04,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290980769] [2025-03-08 17:28:04,328 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:28:04,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:04,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-03-08 17:28:04,366 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 17:28:04,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:28:04,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:04,722 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-08 17:28:04,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:04,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290980769] [2025-03-08 17:28:04,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290980769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:28:04,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:28:04,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:28:04,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085193513] [2025-03-08 17:28:04,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:04,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:28:04,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:04,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:28:04,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:28:04,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:04,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 52 transitions, 178 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:04,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:04,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:04,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:05,229 INFO L124 PetriNetUnfolderBase]: 2330/3393 cut-off events. [2025-03-08 17:28:05,229 INFO L125 PetriNetUnfolderBase]: For 413/413 co-relation queries the response was YES. [2025-03-08 17:28:05,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7317 conditions, 3393 events. 2330/3393 cut-off events. For 413/413 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 16425 event pairs, 223 based on Foata normal form. 1/3223 useless extension candidates. Maximal degree in co-relation 4838. Up to 1010 conditions per place. [2025-03-08 17:28:05,245 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 103 selfloop transitions, 18 changer transitions 1/126 dead transitions. [2025-03-08 17:28:05,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 126 transitions, 599 flow [2025-03-08 17:28:05,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 17:28:05,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-08 17:28:05,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 191 transitions. [2025-03-08 17:28:05,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4775 [2025-03-08 17:28:05,247 INFO L175 Difference]: Start difference. First operand has 44 places, 52 transitions, 178 flow. Second operand 10 states and 191 transitions. [2025-03-08 17:28:05,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 126 transitions, 599 flow [2025-03-08 17:28:05,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 126 transitions, 593 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-08 17:28:05,253 INFO L231 Difference]: Finished difference. Result has 55 places, 56 transitions, 242 flow [2025-03-08 17:28:05,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=242, PETRI_PLACES=55, PETRI_TRANSITIONS=56} [2025-03-08 17:28:05,254 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 18 predicate places. [2025-03-08 17:28:05,254 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 242 flow [2025-03-08 17:28:05,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:05,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:05,254 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, 1, 1] [2025-03-08 17:28:05,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:28:05,254 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:05,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:05,255 INFO L85 PathProgramCache]: Analyzing trace with hash -387340493, now seen corresponding path program 1 times [2025-03-08 17:28:05,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:05,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981320093] [2025-03-08 17:28:05,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:05,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:05,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 17:28:05,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:28:05,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:05,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:05,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:28:05,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:05,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981320093] [2025-03-08 17:28:05,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981320093] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:28:05,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240126759] [2025-03-08 17:28:05,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:05,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:28:05,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:28:05,399 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-08 17:28:05,401 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-08 17:28:05,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 17:28:05,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:28:05,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:05,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:05,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 17:28:05,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:28:05,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:28:05,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:28:05,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:28:05,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240126759] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 17:28:05,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 17:28:05,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-03-08 17:28:05,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539581875] [2025-03-08 17:28:05,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:05,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:28:05,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:05,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:28:05,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:28:05,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:05,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 56 transitions, 242 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-08 17:28:05,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:05,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:05,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:06,155 INFO L124 PetriNetUnfolderBase]: 4203/6070 cut-off events. [2025-03-08 17:28:06,156 INFO L125 PetriNetUnfolderBase]: For 2208/2208 co-relation queries the response was YES. [2025-03-08 17:28:06,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13963 conditions, 6070 events. 4203/6070 cut-off events. For 2208/2208 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 31888 event pairs, 2151 based on Foata normal form. 1/5776 useless extension candidates. Maximal degree in co-relation 11564. Up to 3210 conditions per place. [2025-03-08 17:28:06,180 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 123 selfloop transitions, 8 changer transitions 4/139 dead transitions. [2025-03-08 17:28:06,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 139 transitions, 773 flow [2025-03-08 17:28:06,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:28:06,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 17:28:06,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2025-03-08 17:28:06,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.575 [2025-03-08 17:28:06,181 INFO L175 Difference]: Start difference. First operand has 55 places, 56 transitions, 242 flow. Second operand 7 states and 161 transitions. [2025-03-08 17:28:06,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 139 transitions, 773 flow [2025-03-08 17:28:06,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 139 transitions, 748 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-08 17:28:06,192 INFO L231 Difference]: Finished difference. Result has 59 places, 60 transitions, 269 flow [2025-03-08 17:28:06,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=269, PETRI_PLACES=59, PETRI_TRANSITIONS=60} [2025-03-08 17:28:06,193 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 22 predicate places. [2025-03-08 17:28:06,193 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 60 transitions, 269 flow [2025-03-08 17:28:06,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-08 17:28:06,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:06,193 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, 1, 1] [2025-03-08 17:28:06,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 17:28:06,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:28:06,395 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:06,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:06,396 INFO L85 PathProgramCache]: Analyzing trace with hash -688452346, now seen corresponding path program 1 times [2025-03-08 17:28:06,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:06,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628067688] [2025-03-08 17:28:06,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:06,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:06,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 17:28:06,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:28:06,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:06,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:06,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:28:06,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:06,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628067688] [2025-03-08 17:28:06,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628067688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:28:06,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778559365] [2025-03-08 17:28:06,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:06,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:28:06,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:28:06,518 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-08 17:28:06,519 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-08 17:28:06,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 17:28:06,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:28:06,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:06,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:06,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 17:28:06,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:28:06,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:28:06,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:28:06,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:28:06,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778559365] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 17:28:06,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 17:28:06,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-03-08 17:28:06,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203798197] [2025-03-08 17:28:06,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:06,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:28:06,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:06,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:28:06,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-08 17:28:06,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:06,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 60 transitions, 269 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:06,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:06,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:06,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:07,312 INFO L124 PetriNetUnfolderBase]: 5160/7467 cut-off events. [2025-03-08 17:28:07,312 INFO L125 PetriNetUnfolderBase]: For 2991/2991 co-relation queries the response was YES. [2025-03-08 17:28:07,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17820 conditions, 7467 events. 5160/7467 cut-off events. For 2991/2991 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 40596 event pairs, 2730 based on Foata normal form. 1/7446 useless extension candidates. Maximal degree in co-relation 15354. Up to 3503 conditions per place. [2025-03-08 17:28:07,349 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 117 selfloop transitions, 8 changer transitions 4/133 dead transitions. [2025-03-08 17:28:07,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 133 transitions, 754 flow [2025-03-08 17:28:07,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:28:07,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:28:07,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2025-03-08 17:28:07,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6416666666666667 [2025-03-08 17:28:07,351 INFO L175 Difference]: Start difference. First operand has 59 places, 60 transitions, 269 flow. Second operand 6 states and 154 transitions. [2025-03-08 17:28:07,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 133 transitions, 754 flow [2025-03-08 17:28:07,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 133 transitions, 743 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-08 17:28:07,359 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 293 flow [2025-03-08 17:28:07,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=293, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2025-03-08 17:28:07,360 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 27 predicate places. [2025-03-08 17:28:07,360 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 293 flow [2025-03-08 17:28:07,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:07,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:07,362 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:28:07,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 17:28:07,563 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,SelfDestructingSolverStorable3 [2025-03-08 17:28:07,564 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:07,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:07,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1473557147, now seen corresponding path program 1 times [2025-03-08 17:28:07,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:07,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138110445] [2025-03-08 17:28:07,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:07,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:07,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 17:28:07,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:28:07,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:07,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:07,671 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-08 17:28:07,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:07,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138110445] [2025-03-08 17:28:07,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138110445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:28:07,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:28:07,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:28:07,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226974747] [2025-03-08 17:28:07,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:07,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:28:07,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:07,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:28:07,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:28:07,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:07,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 293 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 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-08 17:28:07,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:07,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:07,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:08,103 INFO L124 PetriNetUnfolderBase]: 3675/5573 cut-off events. [2025-03-08 17:28:08,103 INFO L125 PetriNetUnfolderBase]: For 3254/3254 co-relation queries the response was YES. [2025-03-08 17:28:08,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13705 conditions, 5573 events. 3675/5573 cut-off events. For 3254/3254 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 31398 event pairs, 1536 based on Foata normal form. 230/5767 useless extension candidates. Maximal degree in co-relation 12892. Up to 2424 conditions per place. [2025-03-08 17:28:08,122 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 81 selfloop transitions, 15 changer transitions 0/100 dead transitions. [2025-03-08 17:28:08,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 100 transitions, 609 flow [2025-03-08 17:28:08,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:28:08,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:28:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2025-03-08 17:28:08,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-03-08 17:28:08,123 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 293 flow. Second operand 6 states and 116 transitions. [2025-03-08 17:28:08,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 100 transitions, 609 flow [2025-03-08 17:28:08,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 100 transitions, 594 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-08 17:28:08,129 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 329 flow [2025-03-08 17:28:08,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=329, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2025-03-08 17:28:08,129 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 32 predicate places. [2025-03-08 17:28:08,129 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 329 flow [2025-03-08 17:28:08,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 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-08 17:28:08,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:08,129 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, 1, 1] [2025-03-08 17:28:08,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:28:08,129 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:08,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:08,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1298262384, now seen corresponding path program 1 times [2025-03-08 17:28:08,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:08,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407030349] [2025-03-08 17:28:08,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:08,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:08,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 17:28:08,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:28:08,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:08,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:08,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:28:08,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:08,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407030349] [2025-03-08 17:28:08,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407030349] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:28:08,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367887830] [2025-03-08 17:28:08,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:08,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:28:08,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:28:08,338 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-08 17:28:08,340 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-08 17:28:08,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 17:28:08,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:28:08,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:08,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:08,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 17:28:08,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:28:08,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:28:08,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:28:08,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:28:08,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367887830] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 17:28:08,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 17:28:08,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 16 [2025-03-08 17:28:08,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350581406] [2025-03-08 17:28:08,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:08,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:28:08,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:08,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:28:08,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-08 17:28:08,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:08,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 329 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 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-08 17:28:08,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:08,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:08,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:09,336 INFO L124 PetriNetUnfolderBase]: 3847/5910 cut-off events. [2025-03-08 17:28:09,336 INFO L125 PetriNetUnfolderBase]: For 4207/4207 co-relation queries the response was YES. [2025-03-08 17:28:09,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14936 conditions, 5910 events. 3847/5910 cut-off events. For 4207/4207 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 34644 event pairs, 518 based on Foata normal form. 1/5853 useless extension candidates. Maximal degree in co-relation 14046. Up to 3002 conditions per place. [2025-03-08 17:28:09,356 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 142 selfloop transitions, 18 changer transitions 3/167 dead transitions. [2025-03-08 17:28:09,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 167 transitions, 1026 flow [2025-03-08 17:28:09,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 17:28:09,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 17:28:09,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 224 transitions. [2025-03-08 17:28:09,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.509090909090909 [2025-03-08 17:28:09,357 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 329 flow. Second operand 11 states and 224 transitions. [2025-03-08 17:28:09,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 167 transitions, 1026 flow [2025-03-08 17:28:09,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 167 transitions, 1006 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-08 17:28:09,368 INFO L231 Difference]: Finished difference. Result has 80 places, 68 transitions, 405 flow [2025-03-08 17:28:09,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=405, PETRI_PLACES=80, PETRI_TRANSITIONS=68} [2025-03-08 17:28:09,369 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 43 predicate places. [2025-03-08 17:28:09,369 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 68 transitions, 405 flow [2025-03-08 17:28:09,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 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-08 17:28:09,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:09,369 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, 1, 1] [2025-03-08 17:28:09,375 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-08 17:28:09,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:28:09,570 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:09,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:09,570 INFO L85 PathProgramCache]: Analyzing trace with hash 96138369, now seen corresponding path program 1 times [2025-03-08 17:28:09,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:09,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444004061] [2025-03-08 17:28:09,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:09,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:09,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 17:28:09,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:28:09,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:09,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:09,642 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-08 17:28:09,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:09,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444004061] [2025-03-08 17:28:09,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444004061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:28:09,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:28:09,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:28:09,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611466800] [2025-03-08 17:28:09,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:09,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:28:09,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:09,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:28:09,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:28:09,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:09,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 68 transitions, 405 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 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-08 17:28:09,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:09,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:09,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:09,981 INFO L124 PetriNetUnfolderBase]: 2596/4115 cut-off events. [2025-03-08 17:28:09,981 INFO L125 PetriNetUnfolderBase]: For 4418/4418 co-relation queries the response was YES. [2025-03-08 17:28:09,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10994 conditions, 4115 events. 2596/4115 cut-off events. For 4418/4418 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 23584 event pairs, 1189 based on Foata normal form. 198/4304 useless extension candidates. Maximal degree in co-relation 10485. Up to 2017 conditions per place. [2025-03-08 17:28:09,996 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 85 selfloop transitions, 11 changer transitions 7/107 dead transitions. [2025-03-08 17:28:09,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 107 transitions, 737 flow [2025-03-08 17:28:09,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:28:09,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:28:09,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2025-03-08 17:28:09,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5041666666666667 [2025-03-08 17:28:09,998 INFO L175 Difference]: Start difference. First operand has 80 places, 68 transitions, 405 flow. Second operand 6 states and 121 transitions. [2025-03-08 17:28:09,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 107 transitions, 737 flow [2025-03-08 17:28:10,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 107 transitions, 682 flow, removed 5 selfloop flow, removed 9 redundant places. [2025-03-08 17:28:10,011 INFO L231 Difference]: Finished difference. Result has 79 places, 60 transitions, 328 flow [2025-03-08 17:28:10,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=328, PETRI_PLACES=79, PETRI_TRANSITIONS=60} [2025-03-08 17:28:10,011 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 42 predicate places. [2025-03-08 17:28:10,012 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 60 transitions, 328 flow [2025-03-08 17:28:10,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 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-08 17:28:10,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:10,013 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, 1, 1] [2025-03-08 17:28:10,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:28:10,013 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:10,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:10,013 INFO L85 PathProgramCache]: Analyzing trace with hash -36680010, now seen corresponding path program 2 times [2025-03-08 17:28:10,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:10,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947608801] [2025-03-08 17:28:10,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:28:10,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:10,021 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-08 17:28:10,054 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 25 statements. [2025-03-08 17:28:10,055 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:28:10,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:10,354 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-08 17:28:10,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:10,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947608801] [2025-03-08 17:28:10,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947608801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:28:10,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:28:10,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 17:28:10,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678431809] [2025-03-08 17:28:10,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:10,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:28:10,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:10,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:28:10,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:28:10,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:10,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 60 transitions, 328 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-08 17:28:10,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:10,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:10,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:10,859 INFO L124 PetriNetUnfolderBase]: 2014/3156 cut-off events. [2025-03-08 17:28:10,859 INFO L125 PetriNetUnfolderBase]: For 2861/2861 co-relation queries the response was YES. [2025-03-08 17:28:10,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8161 conditions, 3156 events. 2014/3156 cut-off events. For 2861/2861 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 16990 event pairs, 300 based on Foata normal form. 1/3017 useless extension candidates. Maximal degree in co-relation 8114. Up to 2416 conditions per place. [2025-03-08 17:28:10,867 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 57 selfloop transitions, 8 changer transitions 37/106 dead transitions. [2025-03-08 17:28:10,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 106 transitions, 690 flow [2025-03-08 17:28:10,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 17:28:10,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 17:28:10,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2025-03-08 17:28:10,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2025-03-08 17:28:10,869 INFO L175 Difference]: Start difference. First operand has 79 places, 60 transitions, 328 flow. Second operand 9 states and 147 transitions. [2025-03-08 17:28:10,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 106 transitions, 690 flow [2025-03-08 17:28:10,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 106 transitions, 674 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-03-08 17:28:10,874 INFO L231 Difference]: Finished difference. Result has 75 places, 56 transitions, 292 flow [2025-03-08 17:28:10,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=292, PETRI_PLACES=75, PETRI_TRANSITIONS=56} [2025-03-08 17:28:10,875 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 38 predicate places. [2025-03-08 17:28:10,875 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 56 transitions, 292 flow [2025-03-08 17:28:10,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-08 17:28:10,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:10,875 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, 1, 1, 1] [2025-03-08 17:28:10,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 17:28:10,875 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:10,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:10,876 INFO L85 PathProgramCache]: Analyzing trace with hash 720924499, now seen corresponding path program 1 times [2025-03-08 17:28:10,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:10,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916961985] [2025-03-08 17:28:10,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:10,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:10,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 17:28:10,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 17:28:10,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:10,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:10,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:28:10,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:10,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916961985] [2025-03-08 17:28:10,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916961985] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:28:10,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736021043] [2025-03-08 17:28:10,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:10,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:28:10,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:28:10,963 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-08 17:28:10,964 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-08 17:28:11,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 17:28:11,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 17:28:11,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:11,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:11,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 17:28:11,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:28:11,083 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-08 17:28:11,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:28:11,146 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-08 17:28:11,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736021043] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 17:28:11,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 17:28:11,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 12 [2025-03-08 17:28:11,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792507991] [2025-03-08 17:28:11,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:11,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:28:11,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:11,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:28:11,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:28:11,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-08 17:28:11,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 56 transitions, 292 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:11,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:11,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-08 17:28:11,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:11,579 INFO L124 PetriNetUnfolderBase]: 2693/3955 cut-off events. [2025-03-08 17:28:11,579 INFO L125 PetriNetUnfolderBase]: For 3402/3402 co-relation queries the response was YES. [2025-03-08 17:28:11,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10306 conditions, 3955 events. 2693/3955 cut-off events. For 3402/3402 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 20101 event pairs, 886 based on Foata normal form. 0/3654 useless extension candidates. Maximal degree in co-relation 10262. Up to 1062 conditions per place. [2025-03-08 17:28:11,595 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 136 selfloop transitions, 13 changer transitions 10/162 dead transitions. [2025-03-08 17:28:11,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 162 transitions, 995 flow [2025-03-08 17:28:11,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 17:28:11,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 17:28:11,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 197 transitions. [2025-03-08 17:28:11,596 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5472222222222223 [2025-03-08 17:28:11,596 INFO L175 Difference]: Start difference. First operand has 75 places, 56 transitions, 292 flow. Second operand 9 states and 197 transitions. [2025-03-08 17:28:11,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 162 transitions, 995 flow [2025-03-08 17:28:11,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 162 transitions, 943 flow, removed 10 selfloop flow, removed 7 redundant places. [2025-03-08 17:28:11,604 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 307 flow [2025-03-08 17:28:11,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=307, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2025-03-08 17:28:11,605 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 32 predicate places. [2025-03-08 17:28:11,605 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 307 flow [2025-03-08 17:28:11,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:11,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:11,605 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, 1, 1, 1] [2025-03-08 17:28:11,611 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-08 17:28:11,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:28:11,809 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:11,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:11,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1319929167, now seen corresponding path program 1 times [2025-03-08 17:28:11,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:11,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257434710] [2025-03-08 17:28:11,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:11,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:11,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 17:28:11,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 17:28:11,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:11,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:11,869 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-08 17:28:11,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:11,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257434710] [2025-03-08 17:28:11,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257434710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:28:11,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:28:11,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:28:11,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88842562] [2025-03-08 17:28:11,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:11,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:28:11,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:11,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:28:11,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:28:11,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:11,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 307 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 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-08 17:28:11,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:11,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:11,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:12,103 INFO L124 PetriNetUnfolderBase]: 1959/2994 cut-off events. [2025-03-08 17:28:12,104 INFO L125 PetriNetUnfolderBase]: For 2751/2789 co-relation queries the response was YES. [2025-03-08 17:28:12,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7920 conditions, 2994 events. 1959/2994 cut-off events. For 2751/2789 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 15014 event pairs, 1162 based on Foata normal form. 38/2876 useless extension candidates. Maximal degree in co-relation 6777. Up to 2433 conditions per place. [2025-03-08 17:28:12,112 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 44 selfloop transitions, 2 changer transitions 42/92 dead transitions. [2025-03-08 17:28:12,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 92 transitions, 593 flow [2025-03-08 17:28:12,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:28:12,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:28:12,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2025-03-08 17:28:12,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.475 [2025-03-08 17:28:12,113 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 307 flow. Second operand 6 states and 114 transitions. [2025-03-08 17:28:12,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 92 transitions, 593 flow [2025-03-08 17:28:12,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 92 transitions, 574 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-08 17:28:12,117 INFO L231 Difference]: Finished difference. Result has 68 places, 50 transitions, 219 flow [2025-03-08 17:28:12,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=68, PETRI_TRANSITIONS=50} [2025-03-08 17:28:12,117 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 31 predicate places. [2025-03-08 17:28:12,117 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 50 transitions, 219 flow [2025-03-08 17:28:12,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 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-08 17:28:12,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:12,118 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, 1, 1, 1] [2025-03-08 17:28:12,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 17:28:12,118 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:12,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:12,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1430690106, now seen corresponding path program 1 times [2025-03-08 17:28:12,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:12,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490728575] [2025-03-08 17:28:12,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:12,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:12,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 17:28:12,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 17:28:12,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:12,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:12,167 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-08 17:28:12,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:12,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490728575] [2025-03-08 17:28:12,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490728575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:28:12,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:28:12,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:28:12,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347391115] [2025-03-08 17:28:12,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:12,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:28:12,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:12,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:28:12,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:28:12,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:12,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 50 transitions, 219 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 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-08 17:28:12,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:12,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:12,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:12,338 INFO L124 PetriNetUnfolderBase]: 1394/2089 cut-off events. [2025-03-08 17:28:12,339 INFO L125 PetriNetUnfolderBase]: For 1468/1513 co-relation queries the response was YES. [2025-03-08 17:28:12,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5324 conditions, 2089 events. 1394/2089 cut-off events. For 1468/1513 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9279 event pairs, 748 based on Foata normal form. 42/2020 useless extension candidates. Maximal degree in co-relation 5298. Up to 1557 conditions per place. [2025-03-08 17:28:12,345 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 35 selfloop transitions, 2 changer transitions 39/80 dead transitions. [2025-03-08 17:28:12,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 80 transitions, 472 flow [2025-03-08 17:28:12,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:28:12,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:28:12,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2025-03-08 17:28:12,346 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4625 [2025-03-08 17:28:12,346 INFO L175 Difference]: Start difference. First operand has 68 places, 50 transitions, 219 flow. Second operand 6 states and 111 transitions. [2025-03-08 17:28:12,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 80 transitions, 472 flow [2025-03-08 17:28:12,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 80 transitions, 432 flow, removed 18 selfloop flow, removed 7 redundant places. [2025-03-08 17:28:12,349 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 147 flow [2025-03-08 17:28:12,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=147, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2025-03-08 17:28:12,349 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 19 predicate places. [2025-03-08 17:28:12,349 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 147 flow [2025-03-08 17:28:12,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 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-08 17:28:12,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:12,350 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, 1, 1, 1, 1] [2025-03-08 17:28:12,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 17:28:12,350 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:12,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:12,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1763652228, now seen corresponding path program 1 times [2025-03-08 17:28:12,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:12,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215180254] [2025-03-08 17:28:12,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:12,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:12,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 17:28:12,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 17:28:12,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:12,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:12,414 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-08 17:28:12,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:12,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215180254] [2025-03-08 17:28:12,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215180254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:28:12,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:28:12,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:28:12,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780373113] [2025-03-08 17:28:12,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:12,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:28:12,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:12,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:28:12,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:28:12,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:12,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:12,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:12,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:12,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:12,566 INFO L124 PetriNetUnfolderBase]: 1207/1714 cut-off events. [2025-03-08 17:28:12,566 INFO L125 PetriNetUnfolderBase]: For 760/807 co-relation queries the response was YES. [2025-03-08 17:28:12,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4155 conditions, 1714 events. 1207/1714 cut-off events. For 760/807 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7150 event pairs, 365 based on Foata normal form. 1/1617 useless extension candidates. Maximal degree in co-relation 4140. Up to 839 conditions per place. [2025-03-08 17:28:12,570 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 50 selfloop transitions, 3 changer transitions 22/79 dead transitions. [2025-03-08 17:28:12,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 79 transitions, 412 flow [2025-03-08 17:28:12,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:28:12,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:28:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-03-08 17:28:12,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-03-08 17:28:12,571 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 147 flow. Second operand 4 states and 95 transitions. [2025-03-08 17:28:12,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 79 transitions, 412 flow [2025-03-08 17:28:12,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 79 transitions, 381 flow, removed 12 selfloop flow, removed 7 redundant places. [2025-03-08 17:28:12,573 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 134 flow [2025-03-08 17:28:12,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2025-03-08 17:28:12,573 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2025-03-08 17:28:12,573 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 134 flow [2025-03-08 17:28:12,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:12,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:12,574 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, 1, 1, 1, 1, 1] [2025-03-08 17:28:12,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 17:28:12,574 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:12,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:12,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1118696691, now seen corresponding path program 1 times [2025-03-08 17:28:12,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:12,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114352291] [2025-03-08 17:28:12,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:12,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:12,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 17:28:12,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 17:28:12,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:12,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:12,776 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-08 17:28:12,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:12,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114352291] [2025-03-08 17:28:12,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114352291] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:28:12,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260537104] [2025-03-08 17:28:12,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:12,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:28:12,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:28:12,778 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-08 17:28:12,780 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-08 17:28:12,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 17:28:12,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 17:28:12,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:12,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:12,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 17:28:12,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:28:12,994 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-08 17:28:12,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:28:13,220 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-08 17:28:13,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260537104] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 17:28:13,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 17:28:13,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 19 [2025-03-08 17:28:13,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778090413] [2025-03-08 17:28:13,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:13,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 17:28:13,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:13,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 17:28:13,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-03-08 17:28:13,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:13,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 134 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:13,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:13,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:13,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:13,647 INFO L124 PetriNetUnfolderBase]: 2314/3374 cut-off events. [2025-03-08 17:28:13,648 INFO L125 PetriNetUnfolderBase]: For 2273/2389 co-relation queries the response was YES. [2025-03-08 17:28:13,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8313 conditions, 3374 events. 2314/3374 cut-off events. For 2273/2389 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 16437 event pairs, 359 based on Foata normal form. 1/3162 useless extension candidates. Maximal degree in co-relation 8293. Up to 1049 conditions per place. [2025-03-08 17:28:13,658 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 111 selfloop transitions, 18 changer transitions 1/134 dead transitions. [2025-03-08 17:28:13,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 134 transitions, 685 flow [2025-03-08 17:28:13,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 17:28:13,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 17:28:13,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 199 transitions. [2025-03-08 17:28:13,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45227272727272727 [2025-03-08 17:28:13,659 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 134 flow. Second operand 11 states and 199 transitions. [2025-03-08 17:28:13,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 134 transitions, 685 flow [2025-03-08 17:28:13,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 134 transitions, 655 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-08 17:28:13,664 INFO L231 Difference]: Finished difference. Result has 57 places, 55 transitions, 268 flow [2025-03-08 17:28:13,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=268, PETRI_PLACES=57, PETRI_TRANSITIONS=55} [2025-03-08 17:28:13,665 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 20 predicate places. [2025-03-08 17:28:13,665 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 268 flow [2025-03-08 17:28:13,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:13,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:13,665 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, 1, 1, 1, 1, 1] [2025-03-08 17:28:13,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 17:28:13,865 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,SelfDestructingSolverStorable12 [2025-03-08 17:28:13,866 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:13,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:13,866 INFO L85 PathProgramCache]: Analyzing trace with hash 15273967, now seen corresponding path program 2 times [2025-03-08 17:28:13,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:13,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007745572] [2025-03-08 17:28:13,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:28:13,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:13,875 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-08 17:28:13,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-03-08 17:28:13,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:28:13,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:14,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:28:14,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:14,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007745572] [2025-03-08 17:28:14,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007745572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:28:14,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:28:14,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:28:14,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284531797] [2025-03-08 17:28:14,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:14,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 17:28:14,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:14,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 17:28:14,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:28:14,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:14,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 268 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:14,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:14,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:14,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:14,509 INFO L124 PetriNetUnfolderBase]: 3018/4385 cut-off events. [2025-03-08 17:28:14,510 INFO L125 PetriNetUnfolderBase]: For 3575/3731 co-relation queries the response was YES. [2025-03-08 17:28:14,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11425 conditions, 4385 events. 3018/4385 cut-off events. For 3575/3731 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 22332 event pairs, 454 based on Foata normal form. 1/4369 useless extension candidates. Maximal degree in co-relation 11396. Up to 1730 conditions per place. [2025-03-08 17:28:14,523 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 111 selfloop transitions, 20 changer transitions 1/136 dead transitions. [2025-03-08 17:28:14,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 136 transitions, 795 flow [2025-03-08 17:28:14,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 17:28:14,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 17:28:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 196 transitions. [2025-03-08 17:28:14,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44545454545454544 [2025-03-08 17:28:14,527 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 268 flow. Second operand 11 states and 196 transitions. [2025-03-08 17:28:14,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 136 transitions, 795 flow [2025-03-08 17:28:14,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 136 transitions, 788 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-08 17:28:14,531 INFO L231 Difference]: Finished difference. Result has 68 places, 61 transitions, 373 flow [2025-03-08 17:28:14,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=373, PETRI_PLACES=68, PETRI_TRANSITIONS=61} [2025-03-08 17:28:14,532 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 31 predicate places. [2025-03-08 17:28:14,532 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 61 transitions, 373 flow [2025-03-08 17:28:14,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:14,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:14,532 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, 1, 1, 1, 1, 1] [2025-03-08 17:28:14,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 17:28:14,532 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:14,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:14,532 INFO L85 PathProgramCache]: Analyzing trace with hash -717167597, now seen corresponding path program 3 times [2025-03-08 17:28:14,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:14,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722227045] [2025-03-08 17:28:14,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:28:14,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:14,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-03-08 17:28:14,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-03-08 17:28:14,546 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:28:14,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:14,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:28:14,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:14,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722227045] [2025-03-08 17:28:14,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722227045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:28:14,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:28:14,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:28:14,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958148138] [2025-03-08 17:28:14,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:14,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:28:14,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:14,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:28:14,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:28:14,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:14,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 373 flow. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-08 17:28:14,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:14,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:14,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:15,116 INFO L124 PetriNetUnfolderBase]: 3508/5108 cut-off events. [2025-03-08 17:28:15,116 INFO L125 PetriNetUnfolderBase]: For 8099/8273 co-relation queries the response was YES. [2025-03-08 17:28:15,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14406 conditions, 5108 events. 3508/5108 cut-off events. For 8099/8273 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 26527 event pairs, 685 based on Foata normal form. 1/5092 useless extension candidates. Maximal degree in co-relation 14373. Up to 1715 conditions per place. [2025-03-08 17:28:15,134 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 115 selfloop transitions, 29 changer transitions 1/149 dead transitions. [2025-03-08 17:28:15,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 149 transitions, 997 flow [2025-03-08 17:28:15,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 17:28:15,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 17:28:15,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions. [2025-03-08 17:28:15,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-03-08 17:28:15,135 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 373 flow. Second operand 11 states and 200 transitions. [2025-03-08 17:28:15,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 149 transitions, 997 flow [2025-03-08 17:28:15,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 149 transitions, 962 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-03-08 17:28:15,144 INFO L231 Difference]: Finished difference. Result has 76 places, 71 transitions, 537 flow [2025-03-08 17:28:15,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=537, PETRI_PLACES=76, PETRI_TRANSITIONS=71} [2025-03-08 17:28:15,145 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 39 predicate places. [2025-03-08 17:28:15,145 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 71 transitions, 537 flow [2025-03-08 17:28:15,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-08 17:28:15,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:15,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:28:15,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 17:28:15,145 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:15,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:15,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1748381749, now seen corresponding path program 4 times [2025-03-08 17:28:15,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:15,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499891069] [2025-03-08 17:28:15,146 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:28:15,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:15,151 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-08 17:28:15,153 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 28 statements. [2025-03-08 17:28:15,153 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 17:28:15,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:15,244 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-08 17:28:15,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:15,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499891069] [2025-03-08 17:28:15,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499891069] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:28:15,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103015358] [2025-03-08 17:28:15,244 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:28:15,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:28:15,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:28:15,246 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-08 17:28:15,247 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-08 17:28:15,293 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-08 17:28:15,303 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 28 statements. [2025-03-08 17:28:15,303 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 17:28:15,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:15,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 17:28:15,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:28:15,392 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-08 17:28:15,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:28:15,559 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-08 17:28:15,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103015358] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:28:15,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:28:15,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-08 17:28:15,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073276308] [2025-03-08 17:28:15,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:28:15,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 17:28:15,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:15,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 17:28:15,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-03-08 17:28:15,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 40 [2025-03-08 17:28:15,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 71 transitions, 537 flow. Second operand has 17 states, 17 states have (on average 8.176470588235293) internal successors, (139), 17 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-08 17:28:15,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:15,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 40 [2025-03-08 17:28:15,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:16,490 INFO L124 PetriNetUnfolderBase]: 9910/13792 cut-off events. [2025-03-08 17:28:16,490 INFO L125 PetriNetUnfolderBase]: For 32951/32951 co-relation queries the response was YES. [2025-03-08 17:28:16,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41658 conditions, 13792 events. 9910/13792 cut-off events. For 32951/32951 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 75016 event pairs, 1129 based on Foata normal form. 2/13081 useless extension candidates. Maximal degree in co-relation 41621. Up to 5730 conditions per place. [2025-03-08 17:28:16,538 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 168 selfloop transitions, 40 changer transitions 3/213 dead transitions. [2025-03-08 17:28:16,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 213 transitions, 1889 flow [2025-03-08 17:28:16,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 17:28:16,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 17:28:16,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2025-03-08 17:28:16,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2025-03-08 17:28:16,539 INFO L175 Difference]: Start difference. First operand has 76 places, 71 transitions, 537 flow. Second operand 9 states and 172 transitions. [2025-03-08 17:28:16,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 213 transitions, 1889 flow [2025-03-08 17:28:16,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 213 transitions, 1821 flow, removed 26 selfloop flow, removed 5 redundant places. [2025-03-08 17:28:16,580 INFO L231 Difference]: Finished difference. Result has 85 places, 89 transitions, 828 flow [2025-03-08 17:28:16,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=828, PETRI_PLACES=85, PETRI_TRANSITIONS=89} [2025-03-08 17:28:16,581 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 48 predicate places. [2025-03-08 17:28:16,581 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 89 transitions, 828 flow [2025-03-08 17:28:16,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.176470588235293) internal successors, (139), 17 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-08 17:28:16,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:16,581 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, 1, 1, 1, 1, 1] [2025-03-08 17:28:16,587 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-08 17:28:16,785 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,SelfDestructingSolverStorable15 [2025-03-08 17:28:16,785 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:16,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:16,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1724118621, now seen corresponding path program 5 times [2025-03-08 17:28:16,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:16,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136609668] [2025-03-08 17:28:16,786 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:28:16,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:16,791 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-08 17:28:16,797 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 17:28:16,797 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:28:16,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:17,059 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-08 17:28:17,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:17,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136609668] [2025-03-08 17:28:17,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136609668] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:28:17,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273528595] [2025-03-08 17:28:17,060 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:28:17,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:28:17,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:28:17,063 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-08 17:28:17,064 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-08 17:28:17,117 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-08 17:28:17,137 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 17:28:17,137 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:28:17,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:17,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 17:28:17,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:28:17,247 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-08 17:28:17,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:28:17,423 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-08 17:28:17,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273528595] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 17:28:17,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 17:28:17,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 20 [2025-03-08 17:28:17,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726855428] [2025-03-08 17:28:17,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:17,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:28:17,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:17,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:28:17,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-08 17:28:17,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:17,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 89 transitions, 828 flow. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-08 17:28:17,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:17,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:17,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:18,297 INFO L124 PetriNetUnfolderBase]: 7431/10860 cut-off events. [2025-03-08 17:28:18,297 INFO L125 PetriNetUnfolderBase]: For 37708/38044 co-relation queries the response was YES. [2025-03-08 17:28:18,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37145 conditions, 10860 events. 7431/10860 cut-off events. For 37708/38044 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 64982 event pairs, 1459 based on Foata normal form. 2/10843 useless extension candidates. Maximal degree in co-relation 37103. Up to 2821 conditions per place. [2025-03-08 17:28:18,347 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 167 selfloop transitions, 37 changer transitions 1/210 dead transitions. [2025-03-08 17:28:18,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 210 transitions, 1925 flow [2025-03-08 17:28:18,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 17:28:18,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-08 17:28:18,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 208 transitions. [2025-03-08 17:28:18,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.52 [2025-03-08 17:28:18,348 INFO L175 Difference]: Start difference. First operand has 85 places, 89 transitions, 828 flow. Second operand 10 states and 208 transitions. [2025-03-08 17:28:18,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 210 transitions, 1925 flow [2025-03-08 17:28:18,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 210 transitions, 1898 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-03-08 17:28:18,395 INFO L231 Difference]: Finished difference. Result has 97 places, 102 transitions, 1075 flow [2025-03-08 17:28:18,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1075, PETRI_PLACES=97, PETRI_TRANSITIONS=102} [2025-03-08 17:28:18,396 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 60 predicate places. [2025-03-08 17:28:18,396 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 102 transitions, 1075 flow [2025-03-08 17:28:18,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-08 17:28:18,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:18,396 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, 1, 1, 1, 1, 1] [2025-03-08 17:28:18,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 17:28:18,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:28:18,597 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:18,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:18,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1052154849, now seen corresponding path program 6 times [2025-03-08 17:28:18,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:18,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27093300] [2025-03-08 17:28:18,597 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 17:28:18,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:18,603 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-03-08 17:28:18,620 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-03-08 17:28:18,621 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-08 17:28:18,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:18,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:28:18,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:18,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27093300] [2025-03-08 17:28:18,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27093300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:28:18,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:28:18,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:28:18,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327237539] [2025-03-08 17:28:18,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:18,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 17:28:18,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:18,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 17:28:18,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:28:18,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:18,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 102 transitions, 1075 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:18,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:18,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:18,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:19,740 INFO L124 PetriNetUnfolderBase]: 7641/11245 cut-off events. [2025-03-08 17:28:19,741 INFO L125 PetriNetUnfolderBase]: For 47106/47444 co-relation queries the response was YES. [2025-03-08 17:28:19,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40529 conditions, 11245 events. 7641/11245 cut-off events. For 47106/47444 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 68186 event pairs, 1354 based on Foata normal form. 3/11225 useless extension candidates. Maximal degree in co-relation 40482. Up to 3266 conditions per place. [2025-03-08 17:28:19,786 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 145 selfloop transitions, 48 changer transitions 1/199 dead transitions. [2025-03-08 17:28:19,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 199 transitions, 2029 flow [2025-03-08 17:28:19,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 17:28:19,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 17:28:19,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2025-03-08 17:28:19,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-03-08 17:28:19,787 INFO L175 Difference]: Start difference. First operand has 97 places, 102 transitions, 1075 flow. Second operand 11 states and 198 transitions. [2025-03-08 17:28:19,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 199 transitions, 2029 flow [2025-03-08 17:28:19,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 199 transitions, 1968 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-03-08 17:28:19,842 INFO L231 Difference]: Finished difference. Result has 106 places, 113 transitions, 1402 flow [2025-03-08 17:28:19,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1026, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1402, PETRI_PLACES=106, PETRI_TRANSITIONS=113} [2025-03-08 17:28:19,843 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 69 predicate places. [2025-03-08 17:28:19,843 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 113 transitions, 1402 flow [2025-03-08 17:28:19,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:19,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:19,843 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, 1, 1, 1, 1, 1] [2025-03-08 17:28:19,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 17:28:19,843 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:19,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:19,843 INFO L85 PathProgramCache]: Analyzing trace with hash -974181385, now seen corresponding path program 7 times [2025-03-08 17:28:19,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:19,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110967877] [2025-03-08 17:28:19,843 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 17:28:19,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:19,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 17:28:19,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 17:28:19,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:19,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:20,025 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-08 17:28:20,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:20,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110967877] [2025-03-08 17:28:20,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110967877] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:28:20,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019126493] [2025-03-08 17:28:20,025 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 17:28:20,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:28:20,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:28:20,027 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-08 17:28:20,029 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-08 17:28:20,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 17:28:20,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 17:28:20,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:20,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:20,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 17:28:20,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:28:20,222 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-08 17:28:20,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:28:20,435 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-08 17:28:20,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019126493] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 17:28:20,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 17:28:20,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 21 [2025-03-08 17:28:20,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237148468] [2025-03-08 17:28:20,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:20,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 17:28:20,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:20,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 17:28:20,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2025-03-08 17:28:20,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:20,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 113 transitions, 1402 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:20,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:20,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:20,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:21,322 INFO L124 PetriNetUnfolderBase]: 7641/11246 cut-off events. [2025-03-08 17:28:21,323 INFO L125 PetriNetUnfolderBase]: For 60754/61128 co-relation queries the response was YES. [2025-03-08 17:28:21,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41700 conditions, 11246 events. 7641/11246 cut-off events. For 60754/61128 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 68680 event pairs, 1695 based on Foata normal form. 6/11237 useless extension candidates. Maximal degree in co-relation 41648. Up to 2941 conditions per place. [2025-03-08 17:28:21,388 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 154 selfloop transitions, 42 changer transitions 1/202 dead transitions. [2025-03-08 17:28:21,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 202 transitions, 2211 flow [2025-03-08 17:28:21,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 17:28:21,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 17:28:21,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 203 transitions. [2025-03-08 17:28:21,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46136363636363636 [2025-03-08 17:28:21,388 INFO L175 Difference]: Start difference. First operand has 106 places, 113 transitions, 1402 flow. Second operand 11 states and 203 transitions. [2025-03-08 17:28:21,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 202 transitions, 2211 flow [2025-03-08 17:28:21,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 202 transitions, 2129 flow, removed 33 selfloop flow, removed 5 redundant places. [2025-03-08 17:28:21,538 INFO L231 Difference]: Finished difference. Result has 112 places, 113 transitions, 1427 flow [2025-03-08 17:28:21,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1332, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1427, PETRI_PLACES=112, PETRI_TRANSITIONS=113} [2025-03-08 17:28:21,538 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 75 predicate places. [2025-03-08 17:28:21,538 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 113 transitions, 1427 flow [2025-03-08 17:28:21,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:21,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:21,539 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, 1, 1, 1, 1, 1] [2025-03-08 17:28:21,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 17:28:21,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:28:21,739 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:21,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:21,739 INFO L85 PathProgramCache]: Analyzing trace with hash -30477113, now seen corresponding path program 8 times [2025-03-08 17:28:21,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:21,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190114640] [2025-03-08 17:28:21,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:28:21,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:21,744 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-08 17:28:21,748 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 28 statements. [2025-03-08 17:28:21,748 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:28:21,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:21,873 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-08 17:28:21,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:21,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190114640] [2025-03-08 17:28:21,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190114640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:28:21,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:28:21,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 17:28:21,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499066405] [2025-03-08 17:28:21,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:21,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 17:28:21,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:21,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 17:28:21,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:28:21,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:21,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 113 transitions, 1427 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:21,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:21,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:21,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:22,955 INFO L124 PetriNetUnfolderBase]: 7809/11450 cut-off events. [2025-03-08 17:28:22,956 INFO L125 PetriNetUnfolderBase]: For 60712/61084 co-relation queries the response was YES. [2025-03-08 17:28:22,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42595 conditions, 11450 events. 7809/11450 cut-off events. For 60712/61084 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 69442 event pairs, 1977 based on Foata normal form. 7/11429 useless extension candidates. Maximal degree in co-relation 42542. Up to 4195 conditions per place. [2025-03-08 17:28:23,027 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 154 selfloop transitions, 55 changer transitions 2/216 dead transitions. [2025-03-08 17:28:23,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 216 transitions, 2411 flow [2025-03-08 17:28:23,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 17:28:23,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 17:28:23,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions. [2025-03-08 17:28:23,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5194444444444445 [2025-03-08 17:28:23,028 INFO L175 Difference]: Start difference. First operand has 112 places, 113 transitions, 1427 flow. Second operand 9 states and 187 transitions. [2025-03-08 17:28:23,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 216 transitions, 2411 flow [2025-03-08 17:28:23,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 216 transitions, 2317 flow, removed 15 selfloop flow, removed 7 redundant places. [2025-03-08 17:28:23,121 INFO L231 Difference]: Finished difference. Result has 118 places, 129 transitions, 1756 flow [2025-03-08 17:28:23,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1346, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1756, PETRI_PLACES=118, PETRI_TRANSITIONS=129} [2025-03-08 17:28:23,121 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 81 predicate places. [2025-03-08 17:28:23,121 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 129 transitions, 1756 flow [2025-03-08 17:28:23,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:23,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:23,121 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, 1, 1, 1, 1, 1, 1] [2025-03-08 17:28:23,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 17:28:23,121 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:23,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:23,122 INFO L85 PathProgramCache]: Analyzing trace with hash 166588968, now seen corresponding path program 1 times [2025-03-08 17:28:23,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:23,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186965829] [2025-03-08 17:28:23,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:23,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:23,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 17:28:23,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:28:23,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:23,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:23,185 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-08 17:28:23,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:23,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186965829] [2025-03-08 17:28:23,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186965829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:28:23,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:28:23,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:28:23,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553220168] [2025-03-08 17:28:23,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:23,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:28:23,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:23,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:28:23,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:28:23,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:23,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 129 transitions, 1756 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:23,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:23,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:23,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:23,735 INFO L124 PetriNetUnfolderBase]: 3837/5909 cut-off events. [2025-03-08 17:28:23,736 INFO L125 PetriNetUnfolderBase]: For 30282/30471 co-relation queries the response was YES. [2025-03-08 17:28:23,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21292 conditions, 5909 events. 3837/5909 cut-off events. For 30282/30471 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 35090 event pairs, 1699 based on Foata normal form. 270/6165 useless extension candidates. Maximal degree in co-relation 21236. Up to 2655 conditions per place. [2025-03-08 17:28:23,773 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 113 selfloop transitions, 11 changer transitions 0/129 dead transitions. [2025-03-08 17:28:23,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 129 transitions, 1520 flow [2025-03-08 17:28:23,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:28:23,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:28:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2025-03-08 17:28:23,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.51 [2025-03-08 17:28:23,775 INFO L175 Difference]: Start difference. First operand has 118 places, 129 transitions, 1756 flow. Second operand 5 states and 102 transitions. [2025-03-08 17:28:23,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 129 transitions, 1520 flow [2025-03-08 17:28:23,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 129 transitions, 1440 flow, removed 17 selfloop flow, removed 7 redundant places. [2025-03-08 17:28:23,836 INFO L231 Difference]: Finished difference. Result has 116 places, 99 transitions, 1100 flow [2025-03-08 17:28:23,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1100, PETRI_PLACES=116, PETRI_TRANSITIONS=99} [2025-03-08 17:28:23,837 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 79 predicate places. [2025-03-08 17:28:23,837 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 99 transitions, 1100 flow [2025-03-08 17:28:23,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:23,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:23,837 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, 1, 1, 1, 1, 1, 1] [2025-03-08 17:28:23,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 17:28:23,837 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:23,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:23,838 INFO L85 PathProgramCache]: Analyzing trace with hash 831386237, now seen corresponding path program 1 times [2025-03-08 17:28:23,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:23,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99112718] [2025-03-08 17:28:23,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:23,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:23,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 17:28:23,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:28:23,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:23,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:23,915 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-08 17:28:23,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:23,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99112718] [2025-03-08 17:28:23,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99112718] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:28:23,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885471518] [2025-03-08 17:28:23,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:23,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:28:23,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:28:23,917 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-08 17:28:23,919 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-08 17:28:23,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 17:28:23,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:28:23,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:23,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:23,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 17:28:23,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:28:24,030 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-08 17:28:24,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:28:24,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:28:24,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885471518] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 17:28:24,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 17:28:24,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-03-08 17:28:24,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990122846] [2025-03-08 17:28:24,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:24,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:28:24,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:24,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:28:24,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:28:24,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-08 17:28:24,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 99 transitions, 1100 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:24,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:24,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-08 17:28:24,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:24,610 INFO L124 PetriNetUnfolderBase]: 5179/7784 cut-off events. [2025-03-08 17:28:24,610 INFO L125 PetriNetUnfolderBase]: For 31846/32152 co-relation queries the response was YES. [2025-03-08 17:28:24,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26970 conditions, 7784 events. 5179/7784 cut-off events. For 31846/32152 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 45423 event pairs, 2364 based on Foata normal form. 0/7389 useless extension candidates. Maximal degree in co-relation 26917. Up to 2518 conditions per place. [2025-03-08 17:28:24,649 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 151 selfloop transitions, 13 changer transitions 4/172 dead transitions. [2025-03-08 17:28:24,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 172 transitions, 2031 flow [2025-03-08 17:28:24,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:28:24,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-08 17:28:24,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2025-03-08 17:28:24,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.428125 [2025-03-08 17:28:24,650 INFO L175 Difference]: Start difference. First operand has 116 places, 99 transitions, 1100 flow. Second operand 8 states and 137 transitions. [2025-03-08 17:28:24,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 172 transitions, 2031 flow [2025-03-08 17:28:24,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 172 transitions, 2013 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-08 17:28:24,693 INFO L231 Difference]: Finished difference. Result has 121 places, 102 transitions, 1128 flow [2025-03-08 17:28:24,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1128, PETRI_PLACES=121, PETRI_TRANSITIONS=102} [2025-03-08 17:28:24,693 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 84 predicate places. [2025-03-08 17:28:24,693 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 102 transitions, 1128 flow [2025-03-08 17:28:24,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:24,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:24,693 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, 1, 1, 1, 1, 1, 1] [2025-03-08 17:28:24,700 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-08 17:28:24,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:28:24,894 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:24,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:24,894 INFO L85 PathProgramCache]: Analyzing trace with hash -631906492, now seen corresponding path program 1 times [2025-03-08 17:28:24,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:24,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641665115] [2025-03-08 17:28:24,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:24,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:24,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 17:28:24,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:28:24,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:24,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:24,936 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-08 17:28:24,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:24,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641665115] [2025-03-08 17:28:24,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641665115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:28:24,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:28:24,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:28:24,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436062037] [2025-03-08 17:28:24,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:24,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:28:24,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:24,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:28:24,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:28:24,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:24,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 102 transitions, 1128 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:24,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:24,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:24,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:25,271 INFO L124 PetriNetUnfolderBase]: 3137/5005 cut-off events. [2025-03-08 17:28:25,272 INFO L125 PetriNetUnfolderBase]: For 19321/19622 co-relation queries the response was YES. [2025-03-08 17:28:25,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17756 conditions, 5005 events. 3137/5005 cut-off events. For 19321/19622 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 30271 event pairs, 1812 based on Foata normal form. 248/5237 useless extension candidates. Maximal degree in co-relation 17700. Up to 3065 conditions per place. [2025-03-08 17:28:25,300 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 46 selfloop transitions, 2 changer transitions 52/105 dead transitions. [2025-03-08 17:28:25,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 105 transitions, 1129 flow [2025-03-08 17:28:25,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:28:25,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:28:25,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-03-08 17:28:25,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-03-08 17:28:25,301 INFO L175 Difference]: Start difference. First operand has 121 places, 102 transitions, 1128 flow. Second operand 5 states and 96 transitions. [2025-03-08 17:28:25,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 105 transitions, 1129 flow [2025-03-08 17:28:25,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 105 transitions, 1085 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-08 17:28:25,323 INFO L231 Difference]: Finished difference. Result has 116 places, 53 transitions, 333 flow [2025-03-08 17:28:25,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=333, PETRI_PLACES=116, PETRI_TRANSITIONS=53} [2025-03-08 17:28:25,324 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 79 predicate places. [2025-03-08 17:28:25,324 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 53 transitions, 333 flow [2025-03-08 17:28:25,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:25,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:25,324 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:28:25,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 17:28:25,324 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:25,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:25,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1985640656, now seen corresponding path program 1 times [2025-03-08 17:28:25,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:25,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317126505] [2025-03-08 17:28:25,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:25,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:25,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 17:28:25,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 17:28:25,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:25,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:25,404 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-08 17:28:25,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:25,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317126505] [2025-03-08 17:28:25,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317126505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:28:25,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940081442] [2025-03-08 17:28:25,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:25,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:28:25,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:28:25,407 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-08 17:28:25,409 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-08 17:28:25,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 17:28:25,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 17:28:25,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:25,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:25,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 17:28:25,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:28:25,559 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-08 17:28:25,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:28:25,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:28:25,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940081442] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 17:28:25,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 17:28:25,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13 [2025-03-08 17:28:25,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758670783] [2025-03-08 17:28:25,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:25,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:28:25,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:25,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:28:25,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:28:25,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-08 17:28:25,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 53 transitions, 333 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-08 17:28:25,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:25,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-08 17:28:25,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:25,844 INFO L124 PetriNetUnfolderBase]: 1952/2786 cut-off events. [2025-03-08 17:28:25,844 INFO L125 PetriNetUnfolderBase]: For 7599/7813 co-relation queries the response was YES. [2025-03-08 17:28:25,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9965 conditions, 2786 events. 1952/2786 cut-off events. For 7599/7813 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 11927 event pairs, 611 based on Foata normal form. 79/2861 useless extension candidates. Maximal degree in co-relation 9929. Up to 1433 conditions per place. [2025-03-08 17:28:25,856 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 52 selfloop transitions, 10 changer transitions 0/65 dead transitions. [2025-03-08 17:28:25,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 65 transitions, 508 flow [2025-03-08 17:28:25,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:28:25,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 17:28:25,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2025-03-08 17:28:25,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33214285714285713 [2025-03-08 17:28:25,857 INFO L175 Difference]: Start difference. First operand has 116 places, 53 transitions, 333 flow. Second operand 7 states and 93 transitions. [2025-03-08 17:28:25,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 65 transitions, 508 flow [2025-03-08 17:28:25,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 65 transitions, 440 flow, removed 32 selfloop flow, removed 18 redundant places. [2025-03-08 17:28:25,863 INFO L231 Difference]: Finished difference. Result has 70 places, 48 transitions, 269 flow [2025-03-08 17:28:25,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=269, PETRI_PLACES=70, PETRI_TRANSITIONS=48} [2025-03-08 17:28:25,863 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 33 predicate places. [2025-03-08 17:28:25,863 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 48 transitions, 269 flow [2025-03-08 17:28:25,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-08 17:28:25,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:25,863 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:28:25,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 17:28:26,064 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,SelfDestructingSolverStorable23 [2025-03-08 17:28:26,065 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:26,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:26,065 INFO L85 PathProgramCache]: Analyzing trace with hash -298283675, now seen corresponding path program 1 times [2025-03-08 17:28:26,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:26,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797975548] [2025-03-08 17:28:26,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:28:26,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:26,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 17:28:26,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:28:26,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:28:26,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:26,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:28:26,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:26,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797975548] [2025-03-08 17:28:26,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797975548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:28:26,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:28:26,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 17:28:26,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924655843] [2025-03-08 17:28:26,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:28:26,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 17:28:26,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:28:26,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 17:28:26,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-08 17:28:26,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-08 17:28:26,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 48 transitions, 269 flow. Second operand has 14 states, 14 states have (on average 9.071428571428571) internal successors, (127), 14 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:26,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:28:26,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-08 17:28:26,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:28:27,260 INFO L124 PetriNetUnfolderBase]: 2826/4179 cut-off events. [2025-03-08 17:28:27,260 INFO L125 PetriNetUnfolderBase]: For 8096/8286 co-relation queries the response was YES. [2025-03-08 17:28:27,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13735 conditions, 4179 events. 2826/4179 cut-off events. For 8096/8286 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 21879 event pairs, 207 based on Foata normal form. 1/4177 useless extension candidates. Maximal degree in co-relation 13715. Up to 1701 conditions per place. [2025-03-08 17:28:27,278 INFO L140 encePairwiseOnDemand]: 26/40 looper letters, 153 selfloop transitions, 14 changer transitions 10/181 dead transitions. [2025-03-08 17:28:27,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 181 transitions, 1309 flow [2025-03-08 17:28:27,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 17:28:27,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 17:28:27,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 233 transitions. [2025-03-08 17:28:27,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4480769230769231 [2025-03-08 17:28:27,279 INFO L175 Difference]: Start difference. First operand has 70 places, 48 transitions, 269 flow. Second operand 13 states and 233 transitions. [2025-03-08 17:28:27,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 181 transitions, 1309 flow [2025-03-08 17:28:27,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 181 transitions, 1271 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-08 17:28:27,283 INFO L231 Difference]: Finished difference. Result has 85 places, 56 transitions, 379 flow [2025-03-08 17:28:27,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=379, PETRI_PLACES=85, PETRI_TRANSITIONS=56} [2025-03-08 17:28:27,284 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 48 predicate places. [2025-03-08 17:28:27,284 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 56 transitions, 379 flow [2025-03-08 17:28:27,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.071428571428571) internal successors, (127), 14 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:28:27,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:28:27,284 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:28:27,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 17:28:27,284 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:28:27,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:28:27,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1322441827, now seen corresponding path program 2 times [2025-03-08 17:28:27,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:28:27,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788372064] [2025-03-08 17:28:27,284 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:28:27,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:28:27,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-08 17:28:27,320 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:28:27,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:28:27,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:28,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:28:28,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:28:28,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788372064] [2025-03-08 17:28:28,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788372064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:28:28,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250246357] [2025-03-08 17:28:28,073 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:28:28,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:28:28,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:28:28,075 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-08 17:28:28,077 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-08 17:28:28,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-08 17:28:28,158 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:28:28,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:28:28,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:28:28,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 17:28:28,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:28:28,394 INFO L349 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2025-03-08 17:28:28,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 41 [2025-03-08 17:28:28,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:28:28,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:28:30,571 INFO L349 Elim1Store]: treesize reduction 334, result has 76.4 percent of original size [2025-03-08 17:28:30,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 333 treesize of output 1157