./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-chromosome-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 60539e5483ee028af31550fcc6bdc40a30b35263f2407e34b5392a698998aa9c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:18:01,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:18:01,885 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:18:01,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:18:01,891 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:18:01,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:18:01,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:18:01,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:18:01,917 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:18:01,917 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:18:01,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:18:01,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:18:01,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:18:01,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:18:01,918 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:18:01,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:18:01,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:18:01,918 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:18:01,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:18:01,918 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:18:01,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:18:01,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:18:01,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:18:01,918 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:18:01,918 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:18:01,918 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:18:01,918 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:18:01,918 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:18:01,918 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:18:01,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:18:01,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:18:01,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:18:01,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:18:01,919 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:18:01,919 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:18:01,919 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:18:01,919 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:18:01,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:18:01,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:18:01,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:18:01,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:18:01,919 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:18:01,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:18:01,919 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 -> 60539e5483ee028af31550fcc6bdc40a30b35263f2407e34b5392a698998aa9c [2025-03-04 02:18:02,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:18:02,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:18:02,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:18:02,137 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:18:02,138 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:18:02,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c [2025-03-04 02:18:03,292 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6dc50cbc/521511a065d545a5afb2fbe5d7452998/FLAGe2c0ac253 [2025-03-04 02:18:03,540 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:18:03,541 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c [2025-03-04 02:18:03,546 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6dc50cbc/521511a065d545a5afb2fbe5d7452998/FLAGe2c0ac253 [2025-03-04 02:18:03,559 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6dc50cbc/521511a065d545a5afb2fbe5d7452998 [2025-03-04 02:18:03,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:18:03,561 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:18:03,562 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:18:03,562 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:18:03,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:18:03,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:18:03" (1/1) ... [2025-03-04 02:18:03,567 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a7259e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:03, skipping insertion in model container [2025-03-04 02:18:03,568 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:18:03" (1/1) ... [2025-03-04 02:18:03,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:18:03,709 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-chromosome-subst.wvr.c[3136,3149] [2025-03-04 02:18:03,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:18:03,727 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:18:03,748 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-chromosome-subst.wvr.c[3136,3149] [2025-03-04 02:18:03,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:18:03,768 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:18:03,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:03 WrapperNode [2025-03-04 02:18:03,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:18:03,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:18:03,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:18:03,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:18:03,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:03" (1/1) ... [2025-03-04 02:18:03,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:03" (1/1) ... [2025-03-04 02:18:03,812 INFO L138 Inliner]: procedures = 25, calls = 32, calls flagged for inlining = 17, calls inlined = 25, statements flattened = 253 [2025-03-04 02:18:03,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:18:03,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:18:03,817 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:18:03,817 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:18:03,823 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:03" (1/1) ... [2025-03-04 02:18:03,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:03" (1/1) ... [2025-03-04 02:18:03,828 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:03" (1/1) ... [2025-03-04 02:18:03,845 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 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-04 02:18:03,846 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:03" (1/1) ... [2025-03-04 02:18:03,846 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:03" (1/1) ... [2025-03-04 02:18:03,852 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:03" (1/1) ... [2025-03-04 02:18:03,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:03" (1/1) ... [2025-03-04 02:18:03,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:03" (1/1) ... [2025-03-04 02:18:03,857 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:03" (1/1) ... [2025-03-04 02:18:03,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:18:03,859 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:18:03,860 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:18:03,860 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:18:03,862 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:03" (1/1) ... [2025-03-04 02:18:03,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:18:03,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:03,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:18:03,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:18:03,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:18:03,906 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:18:03,906 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:18:03,906 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:18:03,906 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:18:03,906 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 02:18:03,906 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 02:18:03,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:18:03,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:18:03,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:18:03,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:18:03,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:18:03,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:18:03,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:18:03,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:18:03,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:18:03,908 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:18:04,003 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:18:04,005 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:18:04,360 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:18:04,360 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:18:04,659 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:18:04,660 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:18:04,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:18:04 BoogieIcfgContainer [2025-03-04 02:18:04,660 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:18:04,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:18:04,662 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:18:04,665 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:18:04,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:18:03" (1/3) ... [2025-03-04 02:18:04,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67709409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:18:04, skipping insertion in model container [2025-03-04 02:18:04,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:03" (2/3) ... [2025-03-04 02:18:04,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67709409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:18:04, skipping insertion in model container [2025-03-04 02:18:04,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:18:04" (3/3) ... [2025-03-04 02:18:04,669 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-subst.wvr.c [2025-03-04 02:18:04,680 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:18:04,681 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-subst.wvr.c that has 4 procedures, 26 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-04 02:18:04,681 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:18:04,733 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 02:18:04,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 83 flow [2025-03-04 02:18:04,783 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2025-03-04 02:18:04,785 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:18:04,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 6/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-03-04 02:18:04,790 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 31 transitions, 83 flow [2025-03-04 02:18:04,792 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 27 transitions, 72 flow [2025-03-04 02:18:04,801 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:18:04,809 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;@6b762759, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:18:04,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 02:18:04,820 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:18:04,821 INFO L124 PetriNetUnfolderBase]: 6/26 cut-off events. [2025-03-04 02:18:04,821 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:18:04,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:04,822 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:04,823 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-04 02:18:04,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:04,827 INFO L85 PathProgramCache]: Analyzing trace with hash 2130209362, now seen corresponding path program 1 times [2025-03-04 02:18:04,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:04,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824806876] [2025-03-04 02:18:04,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:04,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:04,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:18:04,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:18:04,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:04,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:05,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:18:05,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:05,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824806876] [2025-03-04 02:18:05,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824806876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:05,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:05,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:18:05,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935756556] [2025-03-04 02:18:05,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:05,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:18:05,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:05,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:18:05,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:18:05,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:05,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:05,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:05,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:05,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:05,518 INFO L124 PetriNetUnfolderBase]: 341/503 cut-off events. [2025-03-04 02:18:05,519 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2025-03-04 02:18:05,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 503 events. 341/503 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1551 event pairs, 124 based on Foata normal form. 1/365 useless extension candidates. Maximal degree in co-relation 890. Up to 299 conditions per place. [2025-03-04 02:18:05,524 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 36 selfloop transitions, 2 changer transitions 4/43 dead transitions. [2025-03-04 02:18:05,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 43 transitions, 203 flow [2025-03-04 02:18:05,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:18:05,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:18:05,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-03-04 02:18:05,537 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5913978494623656 [2025-03-04 02:18:05,538 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 72 flow. Second operand 3 states and 55 transitions. [2025-03-04 02:18:05,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 43 transitions, 203 flow [2025-03-04 02:18:05,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 43 transitions, 181 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 02:18:05,546 INFO L231 Difference]: Finished difference. Result has 28 places, 28 transitions, 72 flow [2025-03-04 02:18:05,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=28, PETRI_TRANSITIONS=28} [2025-03-04 02:18:05,551 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2025-03-04 02:18:05,552 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 28 transitions, 72 flow [2025-03-04 02:18:05,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:05,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:05,553 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:05,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:18:05,553 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-04 02:18:05,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:05,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1412122613, now seen corresponding path program 1 times [2025-03-04 02:18:05,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:05,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662383875] [2025-03-04 02:18:05,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:05,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:05,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:18:05,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:18:05,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:05,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:05,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:18:05,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:05,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662383875] [2025-03-04 02:18:05,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662383875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:05,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:05,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:18:05,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791824203] [2025-03-04 02:18:05,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:05,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:18:05,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:05,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:18:05,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:18:05,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:05,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 28 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:05,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:05,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:05,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:05,815 INFO L124 PetriNetUnfolderBase]: 341/506 cut-off events. [2025-03-04 02:18:05,815 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2025-03-04 02:18:05,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 506 events. 341/506 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1400 event pairs, 228 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 437. Up to 503 conditions per place. [2025-03-04 02:18:05,819 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 24 selfloop transitions, 6 changer transitions 0/31 dead transitions. [2025-03-04 02:18:05,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 31 transitions, 138 flow [2025-03-04 02:18:05,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:18:05,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:18:05,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-03-04 02:18:05,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2025-03-04 02:18:05,822 INFO L175 Difference]: Start difference. First operand has 28 places, 28 transitions, 72 flow. Second operand 3 states and 44 transitions. [2025-03-04 02:18:05,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 31 transitions, 138 flow [2025-03-04 02:18:05,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 136 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:18:05,823 INFO L231 Difference]: Finished difference. Result has 30 places, 31 transitions, 102 flow [2025-03-04 02:18:05,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=30, PETRI_TRANSITIONS=31} [2025-03-04 02:18:05,824 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2025-03-04 02:18:05,824 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 31 transitions, 102 flow [2025-03-04 02:18:05,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:05,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:05,824 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-04 02:18:05,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:18:05,824 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-04 02:18:05,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:05,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1644772774, now seen corresponding path program 1 times [2025-03-04 02:18:05,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:05,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146867609] [2025-03-04 02:18:05,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:05,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:05,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:18:05,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:18:05,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:05,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:05,951 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-04 02:18:05,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:05,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146867609] [2025-03-04 02:18:05,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146867609] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:05,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836191149] [2025-03-04 02:18:05,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:05,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:05,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:05,954 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:18:05,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:18:06,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:18:06,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:18:06,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:06,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:06,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 02:18:06,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:06,095 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-04 02:18:06,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:06,117 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-04 02:18:06,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836191149] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:06,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:06,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-03-04 02:18:06,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120230493] [2025-03-04 02:18:06,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:06,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:18:06,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:06,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:18:06,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:18:06,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:06,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 31 transitions, 102 flow. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:06,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:06,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:06,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:06,245 INFO L124 PetriNetUnfolderBase]: 341/515 cut-off events. [2025-03-04 02:18:06,245 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-03-04 02:18:06,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1156 conditions, 515 events. 341/515 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1400 event pairs, 228 based on Foata normal form. 6/436 useless extension candidates. Maximal degree in co-relation 1106. Up to 503 conditions per place. [2025-03-04 02:18:06,248 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 24 selfloop transitions, 15 changer transitions 0/40 dead transitions. [2025-03-04 02:18:06,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 216 flow [2025-03-04 02:18:06,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:18:06,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:18:06,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2025-03-04 02:18:06,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3817204301075269 [2025-03-04 02:18:06,252 INFO L175 Difference]: Start difference. First operand has 30 places, 31 transitions, 102 flow. Second operand 6 states and 71 transitions. [2025-03-04 02:18:06,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 40 transitions, 216 flow [2025-03-04 02:18:06,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 210 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:18:06,253 INFO L231 Difference]: Finished difference. Result has 37 places, 40 transitions, 192 flow [2025-03-04 02:18:06,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=37, PETRI_TRANSITIONS=40} [2025-03-04 02:18:06,254 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2025-03-04 02:18:06,254 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 40 transitions, 192 flow [2025-03-04 02:18:06,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:06,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:06,254 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:06,261 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-04 02:18:06,458 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-04 02:18:06,458 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-04 02:18:06,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:06,459 INFO L85 PathProgramCache]: Analyzing trace with hash -474163093, now seen corresponding path program 2 times [2025-03-04 02:18:06,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:06,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547885997] [2025-03-04 02:18:06,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:06,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:06,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 02:18:06,517 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 34 statements. [2025-03-04 02:18:06,517 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:18:06,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:06,883 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-04 02:18:06,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:06,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547885997] [2025-03-04 02:18:06,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547885997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:06,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:06,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:18:06,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620131556] [2025-03-04 02:18:06,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:06,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:18:06,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:06,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:18:06,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:18:06,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:06,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 40 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:06,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:06,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:06,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:07,162 INFO L124 PetriNetUnfolderBase]: 681/1011 cut-off events. [2025-03-04 02:18:07,162 INFO L125 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2025-03-04 02:18:07,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2260 conditions, 1011 events. 681/1011 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3584 event pairs, 228 based on Foata normal form. 1/804 useless extension candidates. Maximal degree in co-relation 2171. Up to 539 conditions per place. [2025-03-04 02:18:07,166 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 61 selfloop transitions, 5 changer transitions 1/68 dead transitions. [2025-03-04 02:18:07,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 68 transitions, 403 flow [2025-03-04 02:18:07,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:18:07,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:18:07,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-03-04 02:18:07,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5564516129032258 [2025-03-04 02:18:07,167 INFO L175 Difference]: Start difference. First operand has 37 places, 40 transitions, 192 flow. Second operand 4 states and 69 transitions. [2025-03-04 02:18:07,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 68 transitions, 403 flow [2025-03-04 02:18:07,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 68 transitions, 379 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-03-04 02:18:07,169 INFO L231 Difference]: Finished difference. Result has 41 places, 44 transitions, 201 flow [2025-03-04 02:18:07,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=41, PETRI_TRANSITIONS=44} [2025-03-04 02:18:07,170 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2025-03-04 02:18:07,170 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 44 transitions, 201 flow [2025-03-04 02:18:07,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:07,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:07,170 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:07,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:18:07,171 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-04 02:18:07,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:07,171 INFO L85 PathProgramCache]: Analyzing trace with hash 863113697, now seen corresponding path program 3 times [2025-03-04 02:18:07,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:07,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806015347] [2025-03-04 02:18:07,171 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:07,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:07,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 3 equivalence classes. [2025-03-04 02:18:07,206 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 34 statements. [2025-03-04 02:18:07,206 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:18:07,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:07,492 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-04 02:18:07,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:07,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806015347] [2025-03-04 02:18:07,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806015347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:07,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:07,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:18:07,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443590781] [2025-03-04 02:18:07,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:07,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:18:07,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:07,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:18:07,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:18:07,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:07,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 44 transitions, 201 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:07,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:07,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:07,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:07,761 INFO L124 PetriNetUnfolderBase]: 979/1443 cut-off events. [2025-03-04 02:18:07,761 INFO L125 PetriNetUnfolderBase]: For 694/694 co-relation queries the response was YES. [2025-03-04 02:18:07,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3776 conditions, 1443 events. 979/1443 cut-off events. For 694/694 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5435 event pairs, 380 based on Foata normal form. 1/1442 useless extension candidates. Maximal degree in co-relation 3696. Up to 862 conditions per place. [2025-03-04 02:18:07,767 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 61 selfloop transitions, 7 changer transitions 1/70 dead transitions. [2025-03-04 02:18:07,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 70 transitions, 425 flow [2025-03-04 02:18:07,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:18:07,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:18:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-03-04 02:18:07,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5403225806451613 [2025-03-04 02:18:07,768 INFO L175 Difference]: Start difference. First operand has 41 places, 44 transitions, 201 flow. Second operand 4 states and 67 transitions. [2025-03-04 02:18:07,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 70 transitions, 425 flow [2025-03-04 02:18:07,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 70 transitions, 425 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:18:07,771 INFO L231 Difference]: Finished difference. Result has 46 places, 48 transitions, 250 flow [2025-03-04 02:18:07,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=250, PETRI_PLACES=46, PETRI_TRANSITIONS=48} [2025-03-04 02:18:07,772 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2025-03-04 02:18:07,772 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 48 transitions, 250 flow [2025-03-04 02:18:07,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:07,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:07,772 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:07,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:18:07,772 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-04 02:18:07,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:07,773 INFO L85 PathProgramCache]: Analyzing trace with hash -261290427, now seen corresponding path program 1 times [2025-03-04 02:18:07,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:07,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432903856] [2025-03-04 02:18:07,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:07,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:07,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 02:18:07,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 02:18:07,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:07,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 02:18:07,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:07,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432903856] [2025-03-04 02:18:07,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432903856] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:07,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833672659] [2025-03-04 02:18:07,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:07,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:07,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:07,951 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:18:07,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:18:08,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 02:18:08,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 02:18:08,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:08,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:08,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:18:08,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:08,108 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 02:18:08,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:08,141 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 02:18:08,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833672659] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:08,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:08,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 02:18:08,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753055973] [2025-03-04 02:18:08,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:08,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:18:08,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:08,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:18:08,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:18:08,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:08,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 48 transitions, 250 flow. Second operand has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:08,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:08,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:08,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:08,366 INFO L124 PetriNetUnfolderBase]: 979/1446 cut-off events. [2025-03-04 02:18:08,367 INFO L125 PetriNetUnfolderBase]: For 1559/1559 co-relation queries the response was YES. [2025-03-04 02:18:08,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4290 conditions, 1446 events. 979/1446 cut-off events. For 1559/1559 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5373 event pairs, 672 based on Foata normal form. 1/1445 useless extension candidates. Maximal degree in co-relation 4195. Up to 1429 conditions per place. [2025-03-04 02:18:08,375 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 32 selfloop transitions, 18 changer transitions 0/51 dead transitions. [2025-03-04 02:18:08,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 368 flow [2025-03-04 02:18:08,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:18:08,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:18:08,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2025-03-04 02:18:08,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3317972350230415 [2025-03-04 02:18:08,377 INFO L175 Difference]: Start difference. First operand has 46 places, 48 transitions, 250 flow. Second operand 7 states and 72 transitions. [2025-03-04 02:18:08,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 368 flow [2025-03-04 02:18:08,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 366 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 02:18:08,383 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 316 flow [2025-03-04 02:18:08,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=316, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2025-03-04 02:18:08,384 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 22 predicate places. [2025-03-04 02:18:08,384 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 316 flow [2025-03-04 02:18:08,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:08,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:08,385 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:08,391 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-04 02:18:08,585 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,SelfDestructingSolverStorable5 [2025-03-04 02:18:08,586 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-04 02:18:08,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:08,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1854521258, now seen corresponding path program 2 times [2025-03-04 02:18:08,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:08,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608604964] [2025-03-04 02:18:08,586 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:08,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:08,599 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-04 02:18:08,644 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:18:08,644 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:08,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:08,873 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:08,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:08,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608604964] [2025-03-04 02:18:08,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608604964] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:08,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745085954] [2025-03-04 02:18:08,873 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:08,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:08,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:08,875 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:18:08,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:18:08,952 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-04 02:18:08,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:18:08,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:08,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:09,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:18:09,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:09,073 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:09,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:09,136 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:09,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745085954] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:09,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:18:09,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2025-03-04 02:18:09,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922082385] [2025-03-04 02:18:09,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:09,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:09,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:09,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:09,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:18:09,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:09,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:09,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:09,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:09,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:09,389 INFO L124 PetriNetUnfolderBase]: 1039/1532 cut-off events. [2025-03-04 02:18:09,389 INFO L125 PetriNetUnfolderBase]: For 1322/1322 co-relation queries the response was YES. [2025-03-04 02:18:09,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4565 conditions, 1532 events. 1039/1532 cut-off events. For 1322/1322 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6126 event pairs, 108 based on Foata normal form. 26/1558 useless extension candidates. Maximal degree in co-relation 4449. Up to 645 conditions per place. [2025-03-04 02:18:09,394 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 77 selfloop transitions, 9 changer transitions 0/87 dead transitions. [2025-03-04 02:18:09,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 87 transitions, 617 flow [2025-03-04 02:18:09,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:09,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:09,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2025-03-04 02:18:09,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5225806451612903 [2025-03-04 02:18:09,397 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 316 flow. Second operand 5 states and 81 transitions. [2025-03-04 02:18:09,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 87 transitions, 617 flow [2025-03-04 02:18:09,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 87 transitions, 581 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-04 02:18:09,401 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 327 flow [2025-03-04 02:18:09,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=327, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2025-03-04 02:18:09,402 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 24 predicate places. [2025-03-04 02:18:09,402 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 327 flow [2025-03-04 02:18:09,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:09,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:09,403 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:09,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 02:18:09,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:09,603 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-04 02:18:09,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:09,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1967193479, now seen corresponding path program 1 times [2025-03-04 02:18:09,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:09,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83651730] [2025-03-04 02:18:09,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:09,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:09,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 02:18:09,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:18:09,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:09,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:09,857 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:09,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:09,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83651730] [2025-03-04 02:18:09,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83651730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:09,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763197825] [2025-03-04 02:18:09,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:09,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:09,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:09,859 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:18:09,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:18:09,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 02:18:09,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:18:09,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:09,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:09,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:18:09,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:10,015 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:10,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:10,065 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:10,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763197825] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:10,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:18:10,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 8 [2025-03-04 02:18:10,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927786257] [2025-03-04 02:18:10,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:10,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:10,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:10,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:10,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:18:10,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:10,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 327 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:10,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:10,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:10,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:10,307 INFO L124 PetriNetUnfolderBase]: 1097/1614 cut-off events. [2025-03-04 02:18:10,307 INFO L125 PetriNetUnfolderBase]: For 2576/2576 co-relation queries the response was YES. [2025-03-04 02:18:10,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5333 conditions, 1614 events. 1097/1614 cut-off events. For 2576/2576 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6270 event pairs, 204 based on Foata normal form. 24/1638 useless extension candidates. Maximal degree in co-relation 5231. Up to 639 conditions per place. [2025-03-04 02:18:10,315 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 73 selfloop transitions, 11 changer transitions 0/85 dead transitions. [2025-03-04 02:18:10,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 85 transitions, 624 flow [2025-03-04 02:18:10,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:10,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:10,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2025-03-04 02:18:10,316 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4967741935483871 [2025-03-04 02:18:10,316 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 327 flow. Second operand 5 states and 77 transitions. [2025-03-04 02:18:10,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 85 transitions, 624 flow [2025-03-04 02:18:10,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 85 transitions, 605 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 02:18:10,326 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 366 flow [2025-03-04 02:18:10,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=366, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2025-03-04 02:18:10,328 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 28 predicate places. [2025-03-04 02:18:10,328 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 366 flow [2025-03-04 02:18:10,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:10,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:10,328 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:10,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 02:18:10,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:10,533 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-04 02:18:10,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:10,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1507332167, now seen corresponding path program 2 times [2025-03-04 02:18:10,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:10,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442087371] [2025-03-04 02:18:10,534 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:10,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:10,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-04 02:18:10,565 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:18:10,566 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:10,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:10,726 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:10,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:10,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442087371] [2025-03-04 02:18:10,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442087371] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:10,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199280358] [2025-03-04 02:18:10,727 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:10,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:10,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:10,729 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:18:10,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 02:18:10,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-04 02:18:10,861 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:18:10,862 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:10,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:10,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:18:10,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:10,930 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:10,930 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:18:10,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199280358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:10,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:18:10,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-04 02:18:10,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581785910] [2025-03-04 02:18:10,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:10,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:10,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:10,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:10,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:18:10,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:10,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:10,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:10,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:10,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:11,161 INFO L124 PetriNetUnfolderBase]: 1121/1668 cut-off events. [2025-03-04 02:18:11,162 INFO L125 PetriNetUnfolderBase]: For 3380/3380 co-relation queries the response was YES. [2025-03-04 02:18:11,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5843 conditions, 1668 events. 1121/1668 cut-off events. For 3380/3380 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6851 event pairs, 338 based on Foata normal form. 14/1682 useless extension candidates. Maximal degree in co-relation 5738. Up to 909 conditions per place. [2025-03-04 02:18:11,170 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 70 selfloop transitions, 8 changer transitions 12/91 dead transitions. [2025-03-04 02:18:11,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 91 transitions, 692 flow [2025-03-04 02:18:11,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:11,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:11,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-03-04 02:18:11,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2025-03-04 02:18:11,171 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 366 flow. Second operand 5 states and 80 transitions. [2025-03-04 02:18:11,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 91 transitions, 692 flow [2025-03-04 02:18:11,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 91 transitions, 670 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 02:18:11,178 INFO L231 Difference]: Finished difference. Result has 64 places, 56 transitions, 383 flow [2025-03-04 02:18:11,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=383, PETRI_PLACES=64, PETRI_TRANSITIONS=56} [2025-03-04 02:18:11,179 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 33 predicate places. [2025-03-04 02:18:11,179 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 383 flow [2025-03-04 02:18:11,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:11,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:11,179 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:11,186 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-04 02:18:11,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:11,380 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-04 02:18:11,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:11,381 INFO L85 PathProgramCache]: Analyzing trace with hash -773009621, now seen corresponding path program 3 times [2025-03-04 02:18:11,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:11,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961151269] [2025-03-04 02:18:11,381 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:11,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:11,392 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-03-04 02:18:11,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-03-04 02:18:11,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:18:11,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:11,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:11,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961151269] [2025-03-04 02:18:11,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961151269] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:11,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353196459] [2025-03-04 02:18:11,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:11,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:11,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:11,569 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:18:11,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 02:18:11,654 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-03-04 02:18:11,690 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-03-04 02:18:11,690 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:18:11,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:11,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:18:11,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:11,783 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:11,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:11,849 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:11,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353196459] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:11,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:18:11,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-03-04 02:18:11,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421397693] [2025-03-04 02:18:11,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:11,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:11,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:11,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:11,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:18:11,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:11,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 383 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:11,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:11,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:11,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:12,097 INFO L124 PetriNetUnfolderBase]: 1179/1752 cut-off events. [2025-03-04 02:18:12,098 INFO L125 PetriNetUnfolderBase]: For 4316/4316 co-relation queries the response was YES. [2025-03-04 02:18:12,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6695 conditions, 1752 events. 1179/1752 cut-off events. For 4316/4316 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7151 event pairs, 394 based on Foata normal form. 24/1776 useless extension candidates. Maximal degree in co-relation 6587. Up to 933 conditions per place. [2025-03-04 02:18:12,107 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 79 selfloop transitions, 10 changer transitions 1/91 dead transitions. [2025-03-04 02:18:12,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 91 transitions, 705 flow [2025-03-04 02:18:12,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:12,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:12,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2025-03-04 02:18:12,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5419354838709678 [2025-03-04 02:18:12,108 INFO L175 Difference]: Start difference. First operand has 64 places, 56 transitions, 383 flow. Second operand 5 states and 84 transitions. [2025-03-04 02:18:12,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 91 transitions, 705 flow [2025-03-04 02:18:12,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 91 transitions, 685 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-04 02:18:12,116 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 401 flow [2025-03-04 02:18:12,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=61, 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=5, PETRI_FLOW=401, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2025-03-04 02:18:12,116 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 35 predicate places. [2025-03-04 02:18:12,116 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 401 flow [2025-03-04 02:18:12,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:12,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:12,117 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:12,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 02:18:12,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:12,321 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-04 02:18:12,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:12,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1134574818, now seen corresponding path program 3 times [2025-03-04 02:18:12,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:12,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425446102] [2025-03-04 02:18:12,321 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:12,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:12,333 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-03-04 02:18:12,365 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-03-04 02:18:12,365 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:18:12,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:12,481 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:12,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:12,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425446102] [2025-03-04 02:18:12,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425446102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:12,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985787597] [2025-03-04 02:18:12,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:12,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:12,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:12,484 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:18:12,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 02:18:12,562 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-03-04 02:18:12,597 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-03-04 02:18:12,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:18:12,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:12,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:18:12,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:12,664 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:12,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:12,726 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:12,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985787597] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:12,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:18:12,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-03-04 02:18:12,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668467283] [2025-03-04 02:18:12,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:12,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:12,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:12,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:12,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:18:12,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:12,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 401 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:12,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:12,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:12,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:13,000 INFO L124 PetriNetUnfolderBase]: 1333/1988 cut-off events. [2025-03-04 02:18:13,000 INFO L125 PetriNetUnfolderBase]: For 4539/4539 co-relation queries the response was YES. [2025-03-04 02:18:13,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7511 conditions, 1988 events. 1333/1988 cut-off events. For 4539/4539 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 8517 event pairs, 152 based on Foata normal form. 26/2014 useless extension candidates. Maximal degree in co-relation 7403. Up to 1367 conditions per place. [2025-03-04 02:18:13,008 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 78 selfloop transitions, 13 changer transitions 1/93 dead transitions. [2025-03-04 02:18:13,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 93 transitions, 738 flow [2025-03-04 02:18:13,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:13,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:13,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2025-03-04 02:18:13,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5096774193548387 [2025-03-04 02:18:13,010 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 401 flow. Second operand 5 states and 79 transitions. [2025-03-04 02:18:13,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 93 transitions, 738 flow [2025-03-04 02:18:13,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 93 transitions, 716 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 02:18:13,020 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 445 flow [2025-03-04 02:18:13,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=445, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2025-03-04 02:18:13,020 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 38 predicate places. [2025-03-04 02:18:13,020 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 445 flow [2025-03-04 02:18:13,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:13,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:13,021 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:13,028 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-04 02:18:13,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:13,225 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-04 02:18:13,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:13,227 INFO L85 PathProgramCache]: Analyzing trace with hash 3342665, now seen corresponding path program 4 times [2025-03-04 02:18:13,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:13,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154029077] [2025-03-04 02:18:13,227 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:13,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:13,242 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-03-04 02:18:13,254 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:18:13,254 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:18:13,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:13,439 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:13,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:13,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154029077] [2025-03-04 02:18:13,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154029077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:13,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:13,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:18:13,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275592522] [2025-03-04 02:18:13,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:13,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:13,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:13,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:13,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:18:13,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:13,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 445 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:13,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:13,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:13,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:13,753 INFO L124 PetriNetUnfolderBase]: 1281/1904 cut-off events. [2025-03-04 02:18:13,753 INFO L125 PetriNetUnfolderBase]: For 5477/5477 co-relation queries the response was YES. [2025-03-04 02:18:13,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7629 conditions, 1904 events. 1281/1904 cut-off events. For 5477/5477 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 7979 event pairs, 482 based on Foata normal form. 14/1918 useless extension candidates. Maximal degree in co-relation 7518. Up to 1168 conditions per place. [2025-03-04 02:18:13,762 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 69 selfloop transitions, 10 changer transitions 10/90 dead transitions. [2025-03-04 02:18:13,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 90 transitions, 739 flow [2025-03-04 02:18:13,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:13,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:13,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2025-03-04 02:18:13,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5096774193548387 [2025-03-04 02:18:13,763 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 445 flow. Second operand 5 states and 79 transitions. [2025-03-04 02:18:13,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 90 transitions, 739 flow [2025-03-04 02:18:13,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 90 transitions, 732 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:18:13,774 INFO L231 Difference]: Finished difference. Result has 73 places, 60 transitions, 463 flow [2025-03-04 02:18:13,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=463, PETRI_PLACES=73, PETRI_TRANSITIONS=60} [2025-03-04 02:18:13,776 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 42 predicate places. [2025-03-04 02:18:13,776 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 60 transitions, 463 flow [2025-03-04 02:18:13,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:13,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:13,776 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:13,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:18:13,776 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-04 02:18:13,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:13,777 INFO L85 PathProgramCache]: Analyzing trace with hash -823411226, now seen corresponding path program 4 times [2025-03-04 02:18:13,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:13,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262067417] [2025-03-04 02:18:13,777 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:13,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:13,787 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-03-04 02:18:13,817 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:18:13,819 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:18:13,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:13,970 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:13,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:13,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262067417] [2025-03-04 02:18:13,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262067417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:13,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:13,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:18:13,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211031317] [2025-03-04 02:18:13,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:13,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:13,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:13,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:13,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:18:13,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:13,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 60 transitions, 463 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:13,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:13,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:13,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:14,234 INFO L124 PetriNetUnfolderBase]: 1187/1750 cut-off events. [2025-03-04 02:18:14,234 INFO L125 PetriNetUnfolderBase]: For 5440/5440 co-relation queries the response was YES. [2025-03-04 02:18:14,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7369 conditions, 1750 events. 1187/1750 cut-off events. For 5440/5440 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7082 event pairs, 452 based on Foata normal form. 12/1762 useless extension candidates. Maximal degree in co-relation 7257. Up to 1093 conditions per place. [2025-03-04 02:18:14,243 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 68 selfloop transitions, 10 changer transitions 7/86 dead transitions. [2025-03-04 02:18:14,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 86 transitions, 727 flow [2025-03-04 02:18:14,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:14,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:14,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2025-03-04 02:18:14,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4838709677419355 [2025-03-04 02:18:14,244 INFO L175 Difference]: Start difference. First operand has 73 places, 60 transitions, 463 flow. Second operand 5 states and 75 transitions. [2025-03-04 02:18:14,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 86 transitions, 727 flow [2025-03-04 02:18:14,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 86 transitions, 699 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-04 02:18:14,254 INFO L231 Difference]: Finished difference. Result has 74 places, 60 transitions, 462 flow [2025-03-04 02:18:14,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=462, PETRI_PLACES=74, PETRI_TRANSITIONS=60} [2025-03-04 02:18:14,255 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 43 predicate places. [2025-03-04 02:18:14,255 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 60 transitions, 462 flow [2025-03-04 02:18:14,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:14,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:14,255 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:14,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 02:18:14,255 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-04 02:18:14,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:14,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1696968805, now seen corresponding path program 5 times [2025-03-04 02:18:14,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:14,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295380050] [2025-03-04 02:18:14,256 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:14,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:14,270 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-03-04 02:18:14,291 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:18:14,294 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 02:18:14,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:14,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:14,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295380050] [2025-03-04 02:18:14,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295380050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:14,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:14,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:18:14,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323587890] [2025-03-04 02:18:14,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:14,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:14,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:14,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:14,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:18:14,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:14,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 60 transitions, 462 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:14,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:14,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:14,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:14,730 INFO L124 PetriNetUnfolderBase]: 1142/1693 cut-off events. [2025-03-04 02:18:14,730 INFO L125 PetriNetUnfolderBase]: For 5940/5940 co-relation queries the response was YES. [2025-03-04 02:18:14,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7277 conditions, 1693 events. 1142/1693 cut-off events. For 5940/5940 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6818 event pairs, 178 based on Foata normal form. 28/1721 useless extension candidates. Maximal degree in co-relation 7164. Up to 969 conditions per place. [2025-03-04 02:18:14,741 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 78 selfloop transitions, 9 changer transitions 1/89 dead transitions. [2025-03-04 02:18:14,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 89 transitions, 767 flow [2025-03-04 02:18:14,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:14,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:14,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-03-04 02:18:14,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4774193548387097 [2025-03-04 02:18:14,743 INFO L175 Difference]: Start difference. First operand has 74 places, 60 transitions, 462 flow. Second operand 5 states and 74 transitions. [2025-03-04 02:18:14,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 89 transitions, 767 flow [2025-03-04 02:18:14,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 89 transitions, 739 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-04 02:18:14,756 INFO L231 Difference]: Finished difference. Result has 76 places, 61 transitions, 480 flow [2025-03-04 02:18:14,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=480, PETRI_PLACES=76, PETRI_TRANSITIONS=61} [2025-03-04 02:18:14,757 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 45 predicate places. [2025-03-04 02:18:14,757 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 61 transitions, 480 flow [2025-03-04 02:18:14,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:14,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:14,757 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:14,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 02:18:14,758 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-04 02:18:14,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:14,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1201413170, now seen corresponding path program 5 times [2025-03-04 02:18:14,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:14,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077225469] [2025-03-04 02:18:14,758 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:14,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:14,771 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-03-04 02:18:14,787 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:18:14,787 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 02:18:14,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:14,926 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:14,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:14,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077225469] [2025-03-04 02:18:14,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077225469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:14,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577667702] [2025-03-04 02:18:14,927 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:14,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:14,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:14,929 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:18:14,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 02:18:15,024 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-03-04 02:18:15,242 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:18:15,243 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 02:18:15,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:15,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:18:15,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:15,395 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:15,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:15,447 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:15,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577667702] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:15,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:18:15,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 12 [2025-03-04 02:18:15,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654275839] [2025-03-04 02:18:15,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:15,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:15,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:15,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:15,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:18:15,448 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:15,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 61 transitions, 480 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:15,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:15,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:15,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:15,684 INFO L124 PetriNetUnfolderBase]: 1079/1606 cut-off events. [2025-03-04 02:18:15,684 INFO L125 PetriNetUnfolderBase]: For 6779/6779 co-relation queries the response was YES. [2025-03-04 02:18:15,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7036 conditions, 1606 events. 1079/1606 cut-off events. For 6779/6779 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 6383 event pairs, 383 based on Foata normal form. 26/1632 useless extension candidates. Maximal degree in co-relation 6921. Up to 1004 conditions per place. [2025-03-04 02:18:15,692 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 77 selfloop transitions, 12 changer transitions 3/93 dead transitions. [2025-03-04 02:18:15,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 93 transitions, 807 flow [2025-03-04 02:18:15,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:15,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:15,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-03-04 02:18:15,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2025-03-04 02:18:15,693 INFO L175 Difference]: Start difference. First operand has 76 places, 61 transitions, 480 flow. Second operand 5 states and 80 transitions. [2025-03-04 02:18:15,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 93 transitions, 807 flow [2025-03-04 02:18:15,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 93 transitions, 785 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-04 02:18:15,707 INFO L231 Difference]: Finished difference. Result has 77 places, 62 transitions, 504 flow [2025-03-04 02:18:15,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=504, PETRI_PLACES=77, PETRI_TRANSITIONS=62} [2025-03-04 02:18:15,708 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 46 predicate places. [2025-03-04 02:18:15,708 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 62 transitions, 504 flow [2025-03-04 02:18:15,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:15,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:15,708 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:15,715 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-04 02:18:15,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 02:18:15,909 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-04 02:18:15,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:15,909 INFO L85 PathProgramCache]: Analyzing trace with hash -357404790, now seen corresponding path program 6 times [2025-03-04 02:18:15,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:15,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241096748] [2025-03-04 02:18:15,909 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:18:15,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:15,923 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-03-04 02:18:15,955 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 38 statements. [2025-03-04 02:18:15,955 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:18:15,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:16,087 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:16,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:16,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241096748] [2025-03-04 02:18:16,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241096748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:16,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:16,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:18:16,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484687881] [2025-03-04 02:18:16,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:16,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:16,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:16,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:16,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:18:16,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:16,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 62 transitions, 504 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:16,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:16,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:16,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:16,334 INFO L124 PetriNetUnfolderBase]: 1101/1656 cut-off events. [2025-03-04 02:18:16,335 INFO L125 PetriNetUnfolderBase]: For 6595/6595 co-relation queries the response was YES. [2025-03-04 02:18:16,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7418 conditions, 1656 events. 1101/1656 cut-off events. For 6595/6595 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6740 event pairs, 383 based on Foata normal form. 12/1668 useless extension candidates. Maximal degree in co-relation 7305. Up to 1004 conditions per place. [2025-03-04 02:18:16,342 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 72 selfloop transitions, 11 changer transitions 12/96 dead transitions. [2025-03-04 02:18:16,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 96 transitions, 869 flow [2025-03-04 02:18:16,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:16,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2025-03-04 02:18:16,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4967741935483871 [2025-03-04 02:18:16,343 INFO L175 Difference]: Start difference. First operand has 77 places, 62 transitions, 504 flow. Second operand 5 states and 77 transitions. [2025-03-04 02:18:16,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 96 transitions, 869 flow [2025-03-04 02:18:16,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 96 transitions, 835 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-04 02:18:16,357 INFO L231 Difference]: Finished difference. Result has 81 places, 63 transitions, 524 flow [2025-03-04 02:18:16,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=524, PETRI_PLACES=81, PETRI_TRANSITIONS=63} [2025-03-04 02:18:16,358 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 50 predicate places. [2025-03-04 02:18:16,358 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 63 transitions, 524 flow [2025-03-04 02:18:16,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:16,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:16,358 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:16,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 02:18:16,358 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-04 02:18:16,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:16,359 INFO L85 PathProgramCache]: Analyzing trace with hash 516335890, now seen corresponding path program 7 times [2025-03-04 02:18:16,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:16,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128838217] [2025-03-04 02:18:16,359 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:18:16,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:16,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 02:18:16,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:18:16,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:16,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:16,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:16,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128838217] [2025-03-04 02:18:16,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128838217] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:16,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695008687] [2025-03-04 02:18:16,509 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:18:16,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:16,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:16,511 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:18:16,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 02:18:16,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 02:18:16,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:18:16,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:16,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:16,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 02:18:16,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:16,810 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 02:18:16,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:16,871 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:16,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695008687] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:16,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:18:16,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 15 [2025-03-04 02:18:16,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563301716] [2025-03-04 02:18:16,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:16,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:18:16,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:16,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:18:16,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:18:16,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:16,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 63 transitions, 524 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:16,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:16,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:16,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:17,141 INFO L124 PetriNetUnfolderBase]: 1334/2015 cut-off events. [2025-03-04 02:18:17,141 INFO L125 PetriNetUnfolderBase]: For 10242/10242 co-relation queries the response was YES. [2025-03-04 02:18:17,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9545 conditions, 2015 events. 1334/2015 cut-off events. For 10242/10242 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 9049 event pairs, 366 based on Foata normal form. 1/2016 useless extension candidates. Maximal degree in co-relation 9429. Up to 1396 conditions per place. [2025-03-04 02:18:17,151 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 103 selfloop transitions, 26 changer transitions 9/139 dead transitions. [2025-03-04 02:18:17,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 139 transitions, 1451 flow [2025-03-04 02:18:17,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:18:17,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:18:17,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2025-03-04 02:18:17,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5268817204301075 [2025-03-04 02:18:17,151 INFO L175 Difference]: Start difference. First operand has 81 places, 63 transitions, 524 flow. Second operand 6 states and 98 transitions. [2025-03-04 02:18:17,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 139 transitions, 1451 flow [2025-03-04 02:18:17,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 139 transitions, 1386 flow, removed 19 selfloop flow, removed 2 redundant places. [2025-03-04 02:18:17,168 INFO L231 Difference]: Finished difference. Result has 88 places, 88 transitions, 852 flow [2025-03-04 02:18:17,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=852, PETRI_PLACES=88, PETRI_TRANSITIONS=88} [2025-03-04 02:18:17,169 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 57 predicate places. [2025-03-04 02:18:17,169 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 88 transitions, 852 flow [2025-03-04 02:18:17,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:17,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:17,169 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:17,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 02:18:17,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 02:18:17,373 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-04 02:18:17,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:17,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1527684646, now seen corresponding path program 8 times [2025-03-04 02:18:17,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:17,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045136779] [2025-03-04 02:18:17,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:17,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:17,387 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-04 02:18:17,410 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:18:17,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:17,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:17,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:17,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045136779] [2025-03-04 02:18:17,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045136779] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:17,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108096021] [2025-03-04 02:18:17,536 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:17,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:17,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:17,538 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:18:17,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 02:18:17,633 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-04 02:18:17,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:18:17,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:17,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:17,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:18:17,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:17,724 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:17,724 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:18:17,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108096021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:17,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:18:17,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-04 02:18:17,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979089117] [2025-03-04 02:18:17,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:17,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:17,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:17,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:17,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:18:17,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:17,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 88 transitions, 852 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:17,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:17,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:17,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:17,996 INFO L124 PetriNetUnfolderBase]: 1262/1893 cut-off events. [2025-03-04 02:18:17,996 INFO L125 PetriNetUnfolderBase]: For 11781/11781 co-relation queries the response was YES. [2025-03-04 02:18:18,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9775 conditions, 1893 events. 1262/1893 cut-off events. For 11781/11781 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 8091 event pairs, 427 based on Foata normal form. 20/1913 useless extension candidates. Maximal degree in co-relation 9656. Up to 1100 conditions per place. [2025-03-04 02:18:18,005 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 71 selfloop transitions, 23 changer transitions 20/115 dead transitions. [2025-03-04 02:18:18,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 115 transitions, 1216 flow [2025-03-04 02:18:18,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:18,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2025-03-04 02:18:18,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49032258064516127 [2025-03-04 02:18:18,006 INFO L175 Difference]: Start difference. First operand has 88 places, 88 transitions, 852 flow. Second operand 5 states and 76 transitions. [2025-03-04 02:18:18,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 115 transitions, 1216 flow [2025-03-04 02:18:18,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 115 transitions, 1176 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-04 02:18:18,024 INFO L231 Difference]: Finished difference. Result has 90 places, 79 transitions, 789 flow [2025-03-04 02:18:18,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=789, PETRI_PLACES=90, PETRI_TRANSITIONS=79} [2025-03-04 02:18:18,025 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 59 predicate places. [2025-03-04 02:18:18,025 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 789 flow [2025-03-04 02:18:18,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:18,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:18,025 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:18,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 02:18:18,225 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,SelfDestructingSolverStorable17 [2025-03-04 02:18:18,226 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-04 02:18:18,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:18,226 INFO L85 PathProgramCache]: Analyzing trace with hash 28263449, now seen corresponding path program 6 times [2025-03-04 02:18:18,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:18,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55536685] [2025-03-04 02:18:18,227 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:18:18,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:18,237 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-03-04 02:18:18,264 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 38 statements. [2025-03-04 02:18:18,265 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:18:18,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:18,370 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:18,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:18,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55536685] [2025-03-04 02:18:18,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55536685] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:18,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192937320] [2025-03-04 02:18:18,371 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:18:18,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:18,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:18,373 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:18:18,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 02:18:18,468 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-03-04 02:18:18,502 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 38 statements. [2025-03-04 02:18:18,502 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:18:18,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:18,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:18:18,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:18,569 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:18,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:18,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192937320] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:18,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:18:18,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-03-04 02:18:18,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92881467] [2025-03-04 02:18:18,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:18,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:18,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:18,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:18,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:18:18,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:18,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 79 transitions, 789 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:18,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:18,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:18,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:18,848 INFO L124 PetriNetUnfolderBase]: 877/1282 cut-off events. [2025-03-04 02:18:18,848 INFO L125 PetriNetUnfolderBase]: For 7346/7346 co-relation queries the response was YES. [2025-03-04 02:18:18,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6510 conditions, 1282 events. 877/1282 cut-off events. For 7346/7346 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4633 event pairs, 118 based on Foata normal form. 18/1300 useless extension candidates. Maximal degree in co-relation 6391. Up to 844 conditions per place. [2025-03-04 02:18:18,854 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 88 selfloop transitions, 18 changer transitions 2/109 dead transitions. [2025-03-04 02:18:18,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 109 transitions, 1150 flow [2025-03-04 02:18:18,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:18,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:18,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-03-04 02:18:18,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4774193548387097 [2025-03-04 02:18:18,856 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 789 flow. Second operand 5 states and 74 transitions. [2025-03-04 02:18:18,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 109 transitions, 1150 flow [2025-03-04 02:18:18,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 109 transitions, 1054 flow, removed 11 selfloop flow, removed 8 redundant places. [2025-03-04 02:18:18,866 INFO L231 Difference]: Finished difference. Result has 84 places, 80 transitions, 752 flow [2025-03-04 02:18:18,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=752, PETRI_PLACES=84, PETRI_TRANSITIONS=80} [2025-03-04 02:18:18,867 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 53 predicate places. [2025-03-04 02:18:18,867 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 80 transitions, 752 flow [2025-03-04 02:18:18,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:18,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:18,867 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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-04 02:18:18,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 02:18:19,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:19,068 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-04 02:18:19,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:19,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1730938163, now seen corresponding path program 1 times [2025-03-04 02:18:19,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:19,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133107304] [2025-03-04 02:18:19,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:19,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:19,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 02:18:19,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:18:19,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:19,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:19,211 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-04 02:18:19,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:19,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133107304] [2025-03-04 02:18:19,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133107304] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:19,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554638874] [2025-03-04 02:18:19,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:19,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:19,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:19,213 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:18:19,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 02:18:19,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 02:18:19,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:18:19,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:19,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:19,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 02:18:19,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:19,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:18:19,544 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 40 treesize of output 52 [2025-03-04 02:18:19,584 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 02:18:19,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:33,337 INFO L349 Elim1Store]: treesize reduction 28, result has 94.9 percent of original size [2025-03-04 02:18:33,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 210 treesize of output 583