./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-trans.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-trans.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 f36f5593156fc25b34b4c706b0d898a2d66ee8bab5f6d91cd69ff9cf3c129193 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:18:04,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:18:04,850 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:04,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:18:04,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:18:04,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:18:04,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:18:04,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:18:04,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:18:04,880 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:18:04,880 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:18:04,880 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:18:04,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:18:04,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:18:04,881 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:18:04,881 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:18:04,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:18:04,882 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:18:04,882 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:18:04,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:18:04,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:18:04,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:18:04,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:18:04,882 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:18:04,882 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:18:04,882 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:18:04,882 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:18:04,882 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:18:04,882 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:18:04,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:18:04,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:18:04,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:18:04,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:18:04,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:18:04,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:18:04,883 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:18:04,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:18:04,883 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:18:04,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:18:04,884 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:18:04,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:18:04,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:18:04,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:18:04,884 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 -> f36f5593156fc25b34b4c706b0d898a2d66ee8bab5f6d91cd69ff9cf3c129193 [2025-03-04 02:18:05,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:18:05,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:18:05,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:18:05,161 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:18:05,161 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:18:05,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c [2025-03-04 02:18:06,369 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd8abbe3c/8a5f2296a70a46a3ba2a58b78d4a44f1/FLAG443bafc87 [2025-03-04 02:18:06,611 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:18:06,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c [2025-03-04 02:18:06,621 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd8abbe3c/8a5f2296a70a46a3ba2a58b78d4a44f1/FLAG443bafc87 [2025-03-04 02:18:06,635 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd8abbe3c/8a5f2296a70a46a3ba2a58b78d4a44f1 [2025-03-04 02:18:06,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:18:06,638 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:18:06,640 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:18:06,640 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:18:06,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:18:06,644 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:18:06" (1/1) ... [2025-03-04 02:18:06,645 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d7098a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:06, skipping insertion in model container [2025-03-04 02:18:06,645 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:18:06" (1/1) ... [2025-03-04 02:18:06,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:18:06,801 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-trans.wvr.c[3073,3086] [2025-03-04 02:18:06,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:18:06,821 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:18:06,844 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-trans.wvr.c[3073,3086] [2025-03-04 02:18:06,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:18:06,865 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:18:06,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:06 WrapperNode [2025-03-04 02:18:06,866 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:18:06,867 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:18:06,867 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:18:06,867 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:18:06,871 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:06" (1/1) ... [2025-03-04 02:18:06,878 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:06" (1/1) ... [2025-03-04 02:18:06,898 INFO L138 Inliner]: procedures = 25, calls = 31, calls flagged for inlining = 16, calls inlined = 24, statements flattened = 249 [2025-03-04 02:18:06,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:18:06,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:18:06,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:18:06,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:18:06,905 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:06" (1/1) ... [2025-03-04 02:18:06,905 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:06" (1/1) ... [2025-03-04 02:18:06,911 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:06" (1/1) ... [2025-03-04 02:18:06,924 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:06,924 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:06" (1/1) ... [2025-03-04 02:18:06,924 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:06" (1/1) ... [2025-03-04 02:18:06,934 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:06" (1/1) ... [2025-03-04 02:18:06,938 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:06" (1/1) ... [2025-03-04 02:18:06,939 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:06" (1/1) ... [2025-03-04 02:18:06,940 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:06" (1/1) ... [2025-03-04 02:18:06,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:18:06,946 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:18:06,946 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:18:06,946 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:18:06,946 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:06" (1/1) ... [2025-03-04 02:18:06,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:18:06,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:06,967 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:06,969 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:06,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:18:06,984 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:18:06,984 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:18:06,984 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:18:06,984 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:18:06,984 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 02:18:06,984 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 02:18:06,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:18:06,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:18:06,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:18:06,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:18:06,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:18:06,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:18:06,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:18:06,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:18:06,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:18:06,986 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:07,067 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:18:07,069 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:18:07,384 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:18:07,384 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:18:07,677 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:18:07,677 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:18:07,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:18:07 BoogieIcfgContainer [2025-03-04 02:18:07,678 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:18:07,679 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:18:07,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:18:07,683 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:18:07,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:18:06" (1/3) ... [2025-03-04 02:18:07,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5f6f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:18:07, skipping insertion in model container [2025-03-04 02:18:07,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:06" (2/3) ... [2025-03-04 02:18:07,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5f6f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:18:07, skipping insertion in model container [2025-03-04 02:18:07,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:18:07" (3/3) ... [2025-03-04 02:18:07,685 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-trans.wvr.c [2025-03-04 02:18:07,696 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:18:07,697 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-trans.wvr.c that has 4 procedures, 26 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-04 02:18:07,697 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:18:07,749 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 02:18:07,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 83 flow [2025-03-04 02:18:07,789 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2025-03-04 02:18:07,791 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:18:07,794 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:07,795 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 31 transitions, 83 flow [2025-03-04 02:18:07,797 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 27 transitions, 72 flow [2025-03-04 02:18:07,803 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:18:07,814 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;@6a776046, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:18:07,814 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 02:18:07,823 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:18:07,824 INFO L124 PetriNetUnfolderBase]: 6/26 cut-off events. [2025-03-04 02:18:07,824 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:18:07,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:07,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] [2025-03-04 02:18:07,824 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:07,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:07,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2043801596, now seen corresponding path program 1 times [2025-03-04 02:18:07,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:07,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332740635] [2025-03-04 02:18:07,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:07,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:07,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:18:07,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:18:07,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:07,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:08,141 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:08,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:08,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332740635] [2025-03-04 02:18:08,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332740635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:08,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:08,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:18:08,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875538079] [2025-03-04 02:18:08,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:08,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:18:08,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:08,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:18:08,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:18:08,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:08,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:08,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:08,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:08,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:08,293 INFO L124 PetriNetUnfolderBase]: 202/302 cut-off events. [2025-03-04 02:18:08,293 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 02:18:08,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 302 events. 202/302 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 695 event pairs, 124 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 534. Up to 299 conditions per place. [2025-03-04 02:18:08,298 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 23 selfloop transitions, 6 changer transitions 0/30 dead transitions. [2025-03-04 02:18:08,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 136 flow [2025-03-04 02:18:08,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:18:08,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:18:08,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-03-04 02:18:08,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2025-03-04 02:18:08,310 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 72 flow. Second operand 3 states and 44 transitions. [2025-03-04 02:18:08,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 136 flow [2025-03-04 02:18:08,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 30 transitions, 124 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 02:18:08,317 INFO L231 Difference]: Finished difference. Result has 28 places, 30 transitions, 92 flow [2025-03-04 02:18:08,318 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=28, PETRI_TRANSITIONS=30} [2025-03-04 02:18:08,322 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2025-03-04 02:18:08,322 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 30 transitions, 92 flow [2025-03-04 02:18:08,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:08,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:08,322 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:08,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:18:08,322 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:08,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:08,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1853182815, now seen corresponding path program 1 times [2025-03-04 02:18:08,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:08,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765854945] [2025-03-04 02:18:08,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:08,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:08,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:18:08,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:18:08,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:08,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:08,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:18:08,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:08,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765854945] [2025-03-04 02:18:08,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765854945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:08,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:08,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:18:08,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504000207] [2025-03-04 02:18:08,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:08,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:18:08,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:08,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:18:08,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:18:08,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:08,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 30 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:08,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:08,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:08,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:08,698 INFO L124 PetriNetUnfolderBase]: 306/451 cut-off events. [2025-03-04 02:18:08,698 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-04 02:18:08,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 451 events. 306/451 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1209 event pairs, 124 based on Foata normal form. 1/328 useless extension candidates. Maximal degree in co-relation 900. Up to 302 conditions per place. [2025-03-04 02:18:08,700 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 37 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2025-03-04 02:18:08,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 42 transitions, 201 flow [2025-03-04 02:18:08,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:18:08,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:18:08,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2025-03-04 02:18:08,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935 [2025-03-04 02:18:08,701 INFO L175 Difference]: Start difference. First operand has 28 places, 30 transitions, 92 flow. Second operand 3 states and 51 transitions. [2025-03-04 02:18:08,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 42 transitions, 201 flow [2025-03-04 02:18:08,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 42 transitions, 195 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:18:08,703 INFO L231 Difference]: Finished difference. Result has 30 places, 31 transitions, 98 flow [2025-03-04 02:18:08,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=30, PETRI_TRANSITIONS=31} [2025-03-04 02:18:08,703 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2025-03-04 02:18:08,703 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 31 transitions, 98 flow [2025-03-04 02:18:08,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:08,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:08,703 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:08,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:18:08,704 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:08,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:08,704 INFO L85 PathProgramCache]: Analyzing trace with hash -2078689962, now seen corresponding path program 1 times [2025-03-04 02:18:08,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:08,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347343613] [2025-03-04 02:18:08,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:08,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:08,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:18:08,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:18:08,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:08,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:08,817 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:08,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:08,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347343613] [2025-03-04 02:18:08,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347343613] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:08,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942068854] [2025-03-04 02:18:08,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:08,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:08,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:08,820 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:08,821 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:08,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:18:08,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:18:08,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:08,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:08,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 02:18:08,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:08,947 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:08,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:08,966 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:08,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942068854] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:08,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:08,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-03-04 02:18:08,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697967327] [2025-03-04 02:18:08,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:08,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:18:08,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:08,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:18:08,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:18:08,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:08,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 31 transitions, 98 flow. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:08,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:08,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:08,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:09,059 INFO L124 PetriNetUnfolderBase]: 306/460 cut-off events. [2025-03-04 02:18:09,059 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-03-04 02:18:09,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1045 conditions, 460 events. 306/460 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1193 event pairs, 202 based on Foata normal form. 0/378 useless extension candidates. Maximal degree in co-relation 983. Up to 448 conditions per place. [2025-03-04 02:18:09,061 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 24 selfloop transitions, 15 changer transitions 0/40 dead transitions. [2025-03-04 02:18:09,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 212 flow [2025-03-04 02:18:09,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:18:09,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:18:09,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2025-03-04 02:18:09,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3817204301075269 [2025-03-04 02:18:09,062 INFO L175 Difference]: Start difference. First operand has 30 places, 31 transitions, 98 flow. Second operand 6 states and 71 transitions. [2025-03-04 02:18:09,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 40 transitions, 212 flow [2025-03-04 02:18:09,063 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:09,064 INFO L231 Difference]: Finished difference. Result has 37 places, 40 transitions, 192 flow [2025-03-04 02:18:09,064 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:09,064 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2025-03-04 02:18:09,065 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 40 transitions, 192 flow [2025-03-04 02:18:09,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:09,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:09,065 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:09,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 02:18:09,269 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:09,269 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:09,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:09,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1240161033, now seen corresponding path program 2 times [2025-03-04 02:18:09,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:09,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998934345] [2025-03-04 02:18:09,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:09,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:09,287 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 02:18:09,314 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:09,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:18:09,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:09,431 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:09,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:09,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998934345] [2025-03-04 02:18:09,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998934345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:09,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:09,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:18:09,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844539293] [2025-03-04 02:18:09,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:09,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:18:09,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:09,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:18:09,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:18:09,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:09,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 40 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:09,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:09,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:09,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:09,607 INFO L124 PetriNetUnfolderBase]: 502/756 cut-off events. [2025-03-04 02:18:09,607 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-03-04 02:18:09,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1704 conditions, 756 events. 502/756 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2547 event pairs, 202 based on Foata normal form. 17/625 useless extension candidates. Maximal degree in co-relation 1615. Up to 460 conditions per place. [2025-03-04 02:18:09,611 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 63 selfloop transitions, 3 changer transitions 2/69 dead transitions. [2025-03-04 02:18:09,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 69 transitions, 407 flow [2025-03-04 02:18:09,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:18:09,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:18:09,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-03-04 02:18:09,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5645161290322581 [2025-03-04 02:18:09,613 INFO L175 Difference]: Start difference. First operand has 37 places, 40 transitions, 192 flow. Second operand 4 states and 70 transitions. [2025-03-04 02:18:09,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 69 transitions, 407 flow [2025-03-04 02:18:09,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 69 transitions, 383 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-03-04 02:18:09,616 INFO L231 Difference]: Finished difference. Result has 41 places, 42 transitions, 188 flow [2025-03-04 02:18:09,617 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=41, PETRI_TRANSITIONS=42} [2025-03-04 02:18:09,617 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2025-03-04 02:18:09,618 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 42 transitions, 188 flow [2025-03-04 02:18:09,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:09,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:09,618 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:09,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:18:09,618 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:09,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:09,619 INFO L85 PathProgramCache]: Analyzing trace with hash 666430253, now seen corresponding path program 3 times [2025-03-04 02:18:09,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:09,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6480755] [2025-03-04 02:18:09,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:09,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:09,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 3 equivalence classes. [2025-03-04 02:18:09,655 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:09,655 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:18:09,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:09,746 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:09,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:09,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6480755] [2025-03-04 02:18:09,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6480755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:09,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:09,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:18:09,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975658878] [2025-03-04 02:18:09,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:09,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:18:09,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:09,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:18:09,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:18:09,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:09,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 42 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:09,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:09,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:09,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:09,907 INFO L124 PetriNetUnfolderBase]: 560/838 cut-off events. [2025-03-04 02:18:09,907 INFO L125 PetriNetUnfolderBase]: For 440/440 co-relation queries the response was YES. [2025-03-04 02:18:09,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2240 conditions, 838 events. 560/838 cut-off events. For 440/440 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2951 event pairs, 97 based on Foata normal form. 24/740 useless extension candidates. Maximal degree in co-relation 2160. Up to 567 conditions per place. [2025-03-04 02:18:09,913 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 58 selfloop transitions, 5 changer transitions 1/65 dead transitions. [2025-03-04 02:18:09,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 65 transitions, 394 flow [2025-03-04 02:18:09,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:18:09,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:18:09,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-03-04 02:18:09,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 02:18:09,915 INFO L175 Difference]: Start difference. First operand has 41 places, 42 transitions, 188 flow. Second operand 4 states and 62 transitions. [2025-03-04 02:18:09,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 65 transitions, 394 flow [2025-03-04 02:18:09,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 65 transitions, 383 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 02:18:09,918 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 213 flow [2025-03-04 02:18:09,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=213, PETRI_PLACES=45, PETRI_TRANSITIONS=44} [2025-03-04 02:18:09,921 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 14 predicate places. [2025-03-04 02:18:09,921 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 213 flow [2025-03-04 02:18:09,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:09,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:09,922 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:09,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:18:09,922 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:09,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:09,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1625277359, now seen corresponding path program 4 times [2025-03-04 02:18:09,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:09,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804319168] [2025-03-04 02:18:09,922 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:09,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:09,941 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-04 02:18:09,959 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:18:09,959 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:18:09,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:10,110 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 02:18:10,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:10,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804319168] [2025-03-04 02:18:10,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804319168] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:10,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469380819] [2025-03-04 02:18:10,111 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:10,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:10,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:10,113 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:10,114 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:10,184 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-04 02:18:10,223 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 02:18:10,223 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:18:10,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:10,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:18:10,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:10,291 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 02:18:10,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:10,363 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 02:18:10,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469380819] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:10,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:10,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-03-04 02:18:10,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786229091] [2025-03-04 02:18:10,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:10,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 02:18:10,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:10,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 02:18:10,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:18:10,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:10,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 213 flow. Second operand has 17 states, 17 states have (on average 6.529411764705882) internal successors, (111), 17 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:10,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:10,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:10,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:10,562 INFO L124 PetriNetUnfolderBase]: 560/841 cut-off events. [2025-03-04 02:18:10,562 INFO L125 PetriNetUnfolderBase]: For 911/911 co-relation queries the response was YES. [2025-03-04 02:18:10,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2372 conditions, 841 events. 560/841 cut-off events. For 911/911 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2703 event pairs, 371 based on Foata normal form. 1/720 useless extension candidates. Maximal degree in co-relation 2277. Up to 825 conditions per place. [2025-03-04 02:18:10,566 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 28 selfloop transitions, 18 changer transitions 0/47 dead transitions. [2025-03-04 02:18:10,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 47 transitions, 323 flow [2025-03-04 02:18:10,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:18:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:18:10,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2025-03-04 02:18:10,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3317972350230415 [2025-03-04 02:18:10,568 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 213 flow. Second operand 7 states and 72 transitions. [2025-03-04 02:18:10,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 47 transitions, 323 flow [2025-03-04 02:18:10,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 47 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:18:10,570 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 278 flow [2025-03-04 02:18:10,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=278, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2025-03-04 02:18:10,571 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2025-03-04 02:18:10,571 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 278 flow [2025-03-04 02:18:10,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.529411764705882) internal successors, (111), 17 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:10,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:10,571 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] [2025-03-04 02:18:10,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 02:18:10,775 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:10,775 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:10,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:10,776 INFO L85 PathProgramCache]: Analyzing trace with hash -48956378, now seen corresponding path program 5 times [2025-03-04 02:18:10,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:10,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070637987] [2025-03-04 02:18:10,776 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:10,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:10,790 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-03-04 02:18:10,826 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 02:18:10,826 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 02:18:10,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:11,056 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:11,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:11,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070637987] [2025-03-04 02:18:11,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070637987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:11,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:11,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:18:11,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757072364] [2025-03-04 02:18:11,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:11,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:18:11,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:11,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:18:11,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:18:11,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:11,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 278 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:11,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:11,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:11,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:11,256 INFO L124 PetriNetUnfolderBase]: 477/715 cut-off events. [2025-03-04 02:18:11,256 INFO L125 PetriNetUnfolderBase]: For 572/572 co-relation queries the response was YES. [2025-03-04 02:18:11,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2050 conditions, 715 events. 477/715 cut-off events. For 572/572 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2313 event pairs, 178 based on Foata normal form. 24/636 useless extension candidates. Maximal degree in co-relation 1935. Up to 487 conditions per place. [2025-03-04 02:18:11,261 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 61 selfloop transitions, 6 changer transitions 2/70 dead transitions. [2025-03-04 02:18:11,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 70 transitions, 484 flow [2025-03-04 02:18:11,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:18:11,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:18:11,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-03-04 02:18:11,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.532258064516129 [2025-03-04 02:18:11,262 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 278 flow. Second operand 4 states and 66 transitions. [2025-03-04 02:18:11,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 70 transitions, 484 flow [2025-03-04 02:18:11,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 70 transitions, 448 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-04 02:18:11,266 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 263 flow [2025-03-04 02:18:11,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=263, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2025-03-04 02:18:11,266 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2025-03-04 02:18:11,266 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 263 flow [2025-03-04 02:18:11,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:11,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:11,267 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,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:18:11,267 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:11,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:11,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1789843961, now seen corresponding path program 1 times [2025-03-04 02:18:11,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:11,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868242677] [2025-03-04 02:18:11,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:11,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:11,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 02:18:11,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 02:18:11,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:11,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:11,591 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,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:11,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868242677] [2025-03-04 02:18:11,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868242677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:11,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:11,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:18:11,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951122822] [2025-03-04 02:18:11,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:11,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:11,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:11,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:11,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:18:11,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:11,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 263 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,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:11,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:11,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:11,810 INFO L124 PetriNetUnfolderBase]: 790/1173 cut-off events. [2025-03-04 02:18:11,811 INFO L125 PetriNetUnfolderBase]: For 1740/1740 co-relation queries the response was YES. [2025-03-04 02:18:11,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3515 conditions, 1173 events. 790/1173 cut-off events. For 1740/1740 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4400 event pairs, 255 based on Foata normal form. 12/989 useless extension candidates. Maximal degree in co-relation 3416. Up to 684 conditions per place. [2025-03-04 02:18:11,817 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 71 selfloop transitions, 4 changer transitions 13/89 dead transitions. [2025-03-04 02:18:11,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 89 transitions, 616 flow [2025-03-04 02:18:11,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:11,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:11,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-03-04 02:18:11,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2025-03-04 02:18:11,818 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 263 flow. Second operand 5 states and 80 transitions. [2025-03-04 02:18:11,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 89 transitions, 616 flow [2025-03-04 02:18:11,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 89 transitions, 576 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 02:18:11,822 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 272 flow [2025-03-04 02:18:11,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=272, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2025-03-04 02:18:11,824 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 23 predicate places. [2025-03-04 02:18:11,824 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 272 flow [2025-03-04 02:18:11,824 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,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:11,824 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,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:18:11,825 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:11,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:11,826 INFO L85 PathProgramCache]: Analyzing trace with hash -31495155, now seen corresponding path program 2 times [2025-03-04 02:18:11,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:11,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375497144] [2025-03-04 02:18:11,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:11,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:11,841 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-04 02:18:11,862 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:11,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:11,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:12,083 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,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:12,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375497144] [2025-03-04 02:18:12,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375497144] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:12,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772895323] [2025-03-04 02:18:12,083 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:12,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:12,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:12,086 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:12,096 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:12,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-04 02:18:12,211 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:12,212 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:12,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:12,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:18:12,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:12,279 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,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:12,342 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,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772895323] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:12,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:18:12,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 8 [2025-03-04 02:18:12,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723269558] [2025-03-04 02:18:12,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:12,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:12,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:12,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:12,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:18:12,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:12,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 272 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,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:12,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:12,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:12,606 INFO L124 PetriNetUnfolderBase]: 810/1190 cut-off events. [2025-03-04 02:18:12,606 INFO L125 PetriNetUnfolderBase]: For 1756/1756 co-relation queries the response was YES. [2025-03-04 02:18:12,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3846 conditions, 1190 events. 810/1190 cut-off events. For 1756/1756 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4193 event pairs, 119 based on Foata normal form. 22/1081 useless extension candidates. Maximal degree in co-relation 3745. Up to 458 conditions per place. [2025-03-04 02:18:12,613 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 83 selfloop transitions, 7 changer transitions 3/94 dead transitions. [2025-03-04 02:18:12,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 94 transitions, 673 flow [2025-03-04 02:18:12,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:12,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2025-03-04 02:18:12,615 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49032258064516127 [2025-03-04 02:18:12,615 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 272 flow. Second operand 5 states and 76 transitions. [2025-03-04 02:18:12,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 94 transitions, 673 flow [2025-03-04 02:18:12,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 94 transitions, 653 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 02:18:12,620 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 315 flow [2025-03-04 02:18:12,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=315, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2025-03-04 02:18:12,621 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 26 predicate places. [2025-03-04 02:18:12,621 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 315 flow [2025-03-04 02:18:12,621 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,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:12,621 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,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 02:18:12,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:12,822 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:12,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:12,823 INFO L85 PathProgramCache]: Analyzing trace with hash 695761203, now seen corresponding path program 3 times [2025-03-04 02:18:12,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:12,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288665163] [2025-03-04 02:18:12,825 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:12,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:12,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-03-04 02:18:12,885 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,889 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:18:12,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:13,122 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,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:13,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288665163] [2025-03-04 02:18:13,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288665163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:13,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:13,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:18:13,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134387216] [2025-03-04 02:18:13,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:13,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:13,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:13,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:13,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:18:13,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:13,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 315 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,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:13,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:13,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:13,424 INFO L124 PetriNetUnfolderBase]: 1006/1482 cut-off events. [2025-03-04 02:18:13,425 INFO L125 PetriNetUnfolderBase]: For 2650/2650 co-relation queries the response was YES. [2025-03-04 02:18:13,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4885 conditions, 1482 events. 1006/1482 cut-off events. For 2650/2650 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5754 event pairs, 273 based on Foata normal form. 24/1359 useless extension candidates. Maximal degree in co-relation 4782. Up to 750 conditions per place. [2025-03-04 02:18:13,433 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 82 selfloop transitions, 9 changer transitions 0/92 dead transitions. [2025-03-04 02:18:13,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 92 transitions, 663 flow [2025-03-04 02:18:13,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:13,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:13,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-03-04 02:18:13,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2025-03-04 02:18:13,435 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 315 flow. Second operand 5 states and 80 transitions. [2025-03-04 02:18:13,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 92 transitions, 663 flow [2025-03-04 02:18:13,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 92 transitions, 654 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:18:13,439 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 365 flow [2025-03-04 02:18:13,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=365, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2025-03-04 02:18:13,439 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 31 predicate places. [2025-03-04 02:18:13,439 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 365 flow [2025-03-04 02:18:13,439 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,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:13,440 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,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:18:13,440 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:13,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:13,440 INFO L85 PathProgramCache]: Analyzing trace with hash -301719829, now seen corresponding path program 4 times [2025-03-04 02:18:13,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:13,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284366229] [2025-03-04 02:18:13,440 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:13,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:13,452 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-03-04 02:18:13,464 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,464 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:18:13,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:13,697 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,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:13,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284366229] [2025-03-04 02:18:13,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284366229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:13,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:13,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:18:13,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420686341] [2025-03-04 02:18:13,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:13,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:13,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:13,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:13,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:18:13,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:13,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 365 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,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:13,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:13,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:13,944 INFO L124 PetriNetUnfolderBase]: 994/1470 cut-off events. [2025-03-04 02:18:13,944 INFO L125 PetriNetUnfolderBase]: For 3944/3944 co-relation queries the response was YES. [2025-03-04 02:18:13,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5449 conditions, 1470 events. 994/1470 cut-off events. For 3944/3944 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5606 event pairs, 334 based on Foata normal form. 12/1335 useless extension candidates. Maximal degree in co-relation 5343. Up to 970 conditions per place. [2025-03-04 02:18:13,951 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 72 selfloop transitions, 7 changer transitions 15/95 dead transitions. [2025-03-04 02:18:13,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 95 transitions, 755 flow [2025-03-04 02:18:13,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:13,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:13,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2025-03-04 02:18:13,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49032258064516127 [2025-03-04 02:18:13,952 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 365 flow. Second operand 5 states and 76 transitions. [2025-03-04 02:18:13,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 95 transitions, 755 flow [2025-03-04 02:18:13,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 95 transitions, 736 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-04 02:18:13,959 INFO L231 Difference]: Finished difference. Result has 67 places, 60 transitions, 425 flow [2025-03-04 02:18:13,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=425, PETRI_PLACES=67, PETRI_TRANSITIONS=60} [2025-03-04 02:18:13,959 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 36 predicate places. [2025-03-04 02:18:13,960 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 425 flow [2025-03-04 02:18:13,960 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,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:13,960 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,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:18:13,961 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,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:13,961 INFO L85 PathProgramCache]: Analyzing trace with hash 621118229, now seen corresponding path program 5 times [2025-03-04 02:18:13,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:13,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146630606] [2025-03-04 02:18:13,961 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:13,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:13,975 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-03-04 02:18:13,994 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:13,994 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 02:18:13,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:14,174 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,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:14,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146630606] [2025-03-04 02:18:14,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146630606] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:14,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782365942] [2025-03-04 02:18:14,175 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:14,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:14,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:14,177 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:14,179 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:14,257 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-03-04 02:18:14,476 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,477 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 02:18:14,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:14,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:18:14,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:14,609 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,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:14,686 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,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782365942] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:14,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:18:14,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-03-04 02:18:14,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760699659] [2025-03-04 02:18:14,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:14,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:14,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:14,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:14,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:18:14,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:14,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 425 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,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:14,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:14,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:14,909 INFO L124 PetriNetUnfolderBase]: 906/1330 cut-off events. [2025-03-04 02:18:14,909 INFO L125 PetriNetUnfolderBase]: For 3846/3846 co-relation queries the response was YES. [2025-03-04 02:18:14,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5046 conditions, 1330 events. 906/1330 cut-off events. For 3846/3846 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4898 event pairs, 247 based on Foata normal form. 22/1213 useless extension candidates. Maximal degree in co-relation 4938. Up to 750 conditions per place. [2025-03-04 02:18:14,916 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 77 selfloop transitions, 13 changer transitions 4/95 dead transitions. [2025-03-04 02:18:14,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 95 transitions, 760 flow [2025-03-04 02:18:14,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:14,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:14,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2025-03-04 02:18:14,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5225806451612903 [2025-03-04 02:18:14,917 INFO L175 Difference]: Start difference. First operand has 67 places, 60 transitions, 425 flow. Second operand 5 states and 81 transitions. [2025-03-04 02:18:14,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 95 transitions, 760 flow [2025-03-04 02:18:14,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 95 transitions, 736 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-03-04 02:18:14,924 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 441 flow [2025-03-04 02:18:14,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2025-03-04 02:18:14,925 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 38 predicate places. [2025-03-04 02:18:14,925 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 441 flow [2025-03-04 02:18:14,925 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,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:14,925 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,933 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:15,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:15,129 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:15,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:15,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1161189005, now seen corresponding path program 6 times [2025-03-04 02:18:15,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:15,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731657197] [2025-03-04 02:18:15,130 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:18:15,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:15,148 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-03-04 02:18:15,197 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,197 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:18:15,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:15,355 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,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:15,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731657197] [2025-03-04 02:18:15,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731657197] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:15,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736847894] [2025-03-04 02:18:15,355 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:18:15,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:15,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:15,360 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:15,361 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:15,444 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-03-04 02:18:15,482 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,483 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:18:15,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:15,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:18:15,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:15,556 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,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:15,612 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,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736847894] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:15,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:18:15,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2025-03-04 02:18:15,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944080012] [2025-03-04 02:18:15,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:15,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:15,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:15,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:15,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:18:15,614 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:15,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 441 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,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:15,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:15,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:15,970 INFO L124 PetriNetUnfolderBase]: 860/1254 cut-off events. [2025-03-04 02:18:15,970 INFO L125 PetriNetUnfolderBase]: For 4100/4100 co-relation queries the response was YES. [2025-03-04 02:18:15,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4798 conditions, 1254 events. 860/1254 cut-off events. For 4100/4100 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4469 event pairs, 107 based on Foata normal form. 22/1141 useless extension candidates. Maximal degree in co-relation 4689. Up to 707 conditions per place. [2025-03-04 02:18:15,985 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 77 selfloop transitions, 14 changer transitions 1/93 dead transitions. [2025-03-04 02:18:15,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 93 transitions, 773 flow [2025-03-04 02:18:15,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:15,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:15,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2025-03-04 02:18:15,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4645161290322581 [2025-03-04 02:18:15,986 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 441 flow. Second operand 5 states and 72 transitions. [2025-03-04 02:18:15,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 93 transitions, 773 flow [2025-03-04 02:18:15,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 93 transitions, 739 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-03-04 02:18:15,995 INFO L231 Difference]: Finished difference. Result has 70 places, 63 transitions, 463 flow [2025-03-04 02:18:15,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=463, PETRI_PLACES=70, PETRI_TRANSITIONS=63} [2025-03-04 02:18:15,996 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 39 predicate places. [2025-03-04 02:18:15,996 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 63 transitions, 463 flow [2025-03-04 02:18:15,996 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,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:15,996 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:16,014 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:16,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 02:18:16,200 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:16,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:16,200 INFO L85 PathProgramCache]: Analyzing trace with hash -59669837, now seen corresponding path program 1 times [2025-03-04 02:18:16,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:16,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260823640] [2025-03-04 02:18:16,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:16,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:16,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 02:18:16,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:18:16,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:16,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:17,201 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:17,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:17,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260823640] [2025-03-04 02:18:17,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260823640] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:17,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812799798] [2025-03-04 02:18:17,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:17,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:17,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:17,204 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:17,205 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:17,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 02:18:17,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:18:17,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:17,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:17,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 02:18:17,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:17,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:18:17,580 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:17,610 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:17,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:17,968 INFO L349 Elim1Store]: treesize reduction 32, result has 73.6 percent of original size [2025-03-04 02:18:17,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 102 [2025-03-04 02:18:18,113 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:18,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812799798] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:18,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:18,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 9] total 28 [2025-03-04 02:18:18,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049503692] [2025-03-04 02:18:18,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:18,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 02:18:18,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:18,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 02:18:18,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2025-03-04 02:18:18,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:18,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 63 transitions, 463 flow. Second operand has 28 states, 28 states have (on average 6.285714285714286) internal successors, (176), 28 states have internal predecessors, (176), 0 states have call successors, (0), 0 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,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:18,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:18,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:19,418 INFO L124 PetriNetUnfolderBase]: 1882/2723 cut-off events. [2025-03-04 02:18:19,418 INFO L125 PetriNetUnfolderBase]: For 7222/7222 co-relation queries the response was YES. [2025-03-04 02:18:19,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10065 conditions, 2723 events. 1882/2723 cut-off events. For 7222/7222 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 11904 event pairs, 149 based on Foata normal form. 1/2317 useless extension candidates. Maximal degree in co-relation 9954. Up to 886 conditions per place. [2025-03-04 02:18:19,435 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 148 selfloop transitions, 66 changer transitions 9/224 dead transitions. [2025-03-04 02:18:19,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 224 transitions, 1851 flow [2025-03-04 02:18:19,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 02:18:19,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 02:18:19,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 216 transitions. [2025-03-04 02:18:19,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4098671726755218 [2025-03-04 02:18:19,436 INFO L175 Difference]: Start difference. First operand has 70 places, 63 transitions, 463 flow. Second operand 17 states and 216 transitions. [2025-03-04 02:18:19,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 224 transitions, 1851 flow [2025-03-04 02:18:19,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 224 transitions, 1764 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-03-04 02:18:19,450 INFO L231 Difference]: Finished difference. Result has 89 places, 125 transitions, 1160 flow [2025-03-04 02:18:19,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1160, PETRI_PLACES=89, PETRI_TRANSITIONS=125} [2025-03-04 02:18:19,451 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 58 predicate places. [2025-03-04 02:18:19,451 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 125 transitions, 1160 flow [2025-03-04 02:18:19,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.285714285714286) internal successors, (176), 28 states have internal predecessors, (176), 0 states have call successors, (0), 0 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:19,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:19,451 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:19,458 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:19,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:19,656 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:19,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:19,657 INFO L85 PathProgramCache]: Analyzing trace with hash -426979597, now seen corresponding path program 2 times [2025-03-04 02:18:19,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:19,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509176732] [2025-03-04 02:18:19,657 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:19,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:19,670 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-04 02:18:19,726 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:18:19,726 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:19,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:20,403 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:20,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:20,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509176732] [2025-03-04 02:18:20,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509176732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:20,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883116206] [2025-03-04 02:18:20,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:20,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:20,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:20,406 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:20,407 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:20,490 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-04 02:18:20,529 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:18:20,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:20,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:20,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 02:18:20,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:20,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:18:20,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 75 [2025-03-04 02:18:20,856 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:20,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:21,169 INFO L349 Elim1Store]: treesize reduction 32, result has 73.6 percent of original size [2025-03-04 02:18:21,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 102 [2025-03-04 02:18:21,289 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:21,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883116206] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:21,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:21,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 9] total 25 [2025-03-04 02:18:21,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469488611] [2025-03-04 02:18:21,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:21,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 02:18:21,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:21,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 02:18:21,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2025-03-04 02:18:21,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:21,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 125 transitions, 1160 flow. Second operand has 25 states, 25 states have (on average 6.36) internal successors, (159), 25 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:21,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:21,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:21,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:22,802 INFO L124 PetriNetUnfolderBase]: 2166/3133 cut-off events. [2025-03-04 02:18:22,802 INFO L125 PetriNetUnfolderBase]: For 12679/12679 co-relation queries the response was YES. [2025-03-04 02:18:22,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13498 conditions, 3133 events. 2166/3133 cut-off events. For 12679/12679 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 14021 event pairs, 151 based on Foata normal form. 1/3134 useless extension candidates. Maximal degree in co-relation 13379. Up to 938 conditions per place. [2025-03-04 02:18:22,823 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 181 selfloop transitions, 120 changer transitions 51/353 dead transitions. [2025-03-04 02:18:22,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 353 transitions, 3331 flow [2025-03-04 02:18:22,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 02:18:22,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-04 02:18:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 340 transitions. [2025-03-04 02:18:22,825 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3781979977753059 [2025-03-04 02:18:22,826 INFO L175 Difference]: Start difference. First operand has 89 places, 125 transitions, 1160 flow. Second operand 29 states and 340 transitions. [2025-03-04 02:18:22,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 353 transitions, 3331 flow [2025-03-04 02:18:22,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 353 transitions, 3268 flow, removed 30 selfloop flow, removed 2 redundant places. [2025-03-04 02:18:22,851 INFO L231 Difference]: Finished difference. Result has 128 places, 186 transitions, 2073 flow [2025-03-04 02:18:22,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1119, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=2073, PETRI_PLACES=128, PETRI_TRANSITIONS=186} [2025-03-04 02:18:22,852 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 97 predicate places. [2025-03-04 02:18:22,852 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 186 transitions, 2073 flow [2025-03-04 02:18:22,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.36) internal successors, (159), 25 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:22,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:22,852 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:22,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 02:18:23,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:23,053 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:23,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:23,054 INFO L85 PathProgramCache]: Analyzing trace with hash -73971909, now seen corresponding path program 3 times [2025-03-04 02:18:23,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:23,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382986878] [2025-03-04 02:18:23,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:23,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:23,067 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 4 equivalence classes. [2025-03-04 02:18:23,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 39 statements. [2025-03-04 02:18:23,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:18:23,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:23,787 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 02:18:23,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:23,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382986878] [2025-03-04 02:18:23,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382986878] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:23,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315118961] [2025-03-04 02:18:23,788 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:23,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:23,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:23,790 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:23,792 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:23,882 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 4 equivalence classes. [2025-03-04 02:18:23,919 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 39 statements. [2025-03-04 02:18:23,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:18:23,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:23,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 02:18:23,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:24,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:18:24,072 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 40 [2025-03-04 02:18:24,153 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 02:18:24,153 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:24,443 INFO L349 Elim1Store]: treesize reduction 32, result has 73.6 percent of original size [2025-03-04 02:18:24,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 102 [2025-03-04 02:18:24,564 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 02:18:24,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315118961] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:24,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:24,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 9] total 26 [2025-03-04 02:18:24,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919966796] [2025-03-04 02:18:24,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:24,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 02:18:24,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:24,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 02:18:24,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2025-03-04 02:18:24,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:24,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 186 transitions, 2073 flow. Second operand has 26 states, 26 states have (on average 6.346153846153846) internal successors, (165), 26 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:24,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:24,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:24,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:26,105 INFO L124 PetriNetUnfolderBase]: 1975/2875 cut-off events. [2025-03-04 02:18:26,105 INFO L125 PetriNetUnfolderBase]: For 32738/32738 co-relation queries the response was YES. [2025-03-04 02:18:26,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17773 conditions, 2875 events. 1975/2875 cut-off events. For 32738/32738 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 12795 event pairs, 197 based on Foata normal form. 3/2878 useless extension candidates. Maximal degree in co-relation 17641. Up to 923 conditions per place. [2025-03-04 02:18:26,130 INFO L140 encePairwiseOnDemand]: 17/31 looper letters, 191 selfloop transitions, 117 changer transitions 7/316 dead transitions. [2025-03-04 02:18:26,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 316 transitions, 3765 flow [2025-03-04 02:18:26,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 02:18:26,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 02:18:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 266 transitions. [2025-03-04 02:18:26,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37307152875175315 [2025-03-04 02:18:26,132 INFO L175 Difference]: Start difference. First operand has 128 places, 186 transitions, 2073 flow. Second operand 23 states and 266 transitions. [2025-03-04 02:18:26,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 316 transitions, 3765 flow [2025-03-04 02:18:26,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 316 transitions, 3518 flow, removed 90 selfloop flow, removed 8 redundant places. [2025-03-04 02:18:26,238 INFO L231 Difference]: Finished difference. Result has 144 places, 200 transitions, 2305 flow [2025-03-04 02:18:26,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1852, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2305, PETRI_PLACES=144, PETRI_TRANSITIONS=200} [2025-03-04 02:18:26,238 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 113 predicate places. [2025-03-04 02:18:26,238 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 200 transitions, 2305 flow [2025-03-04 02:18:26,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.346153846153846) internal successors, (165), 26 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:18:26,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:26,239 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:26,245 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:26,439 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,SelfDestructingSolverStorable15 [2025-03-04 02:18:26,439 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:26,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:26,440 INFO L85 PathProgramCache]: Analyzing trace with hash 463883669, now seen corresponding path program 4 times [2025-03-04 02:18:26,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:26,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048999300] [2025-03-04 02:18:26,440 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:26,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:26,457 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-03-04 02:18:26,493 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:18:26,493 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:18:26,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:27,407 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 02:18:27,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:27,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048999300] [2025-03-04 02:18:27,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048999300] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:27,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863315390] [2025-03-04 02:18:27,407 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:27,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:27,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:27,410 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:27,412 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:27,503 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-03-04 02:18:27,538 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:18:27,538 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:18:27,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:27,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 02:18:27,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:27,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:18:27,678 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:27,775 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 02:18:27,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:32,737 INFO L349 Elim1Store]: treesize reduction 32, result has 73.6 percent of original size [2025-03-04 02:18:32,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 102 [2025-03-04 02:18:32,914 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 02:18:32,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863315390] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:32,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:32,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 9] total 30 [2025-03-04 02:18:32,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663767692] [2025-03-04 02:18:32,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:32,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 02:18:32,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:32,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 02:18:32,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=767, Unknown=1, NotChecked=0, Total=870 [2025-03-04 02:18:32,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:32,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 200 transitions, 2305 flow. Second operand has 30 states, 30 states have (on average 6.133333333333334) internal successors, (184), 30 states have internal predecessors, (184), 0 states have call successors, (0), 0 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:32,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:32,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:32,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:36,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 02:18:39,311 INFO L124 PetriNetUnfolderBase]: 2018/2954 cut-off events. [2025-03-04 02:18:39,311 INFO L125 PetriNetUnfolderBase]: For 44059/44059 co-relation queries the response was YES. [2025-03-04 02:18:39,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19672 conditions, 2954 events. 2018/2954 cut-off events. For 44059/44059 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13332 event pairs, 245 based on Foata normal form. 1/2940 useless extension candidates. Maximal degree in co-relation 19534. Up to 1085 conditions per place. [2025-03-04 02:18:39,328 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 173 selfloop transitions, 133 changer transitions 3/310 dead transitions. [2025-03-04 02:18:39,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 310 transitions, 3766 flow [2025-03-04 02:18:39,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 02:18:39,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 02:18:39,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 269 transitions. [2025-03-04 02:18:39,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36155913978494625 [2025-03-04 02:18:39,330 INFO L175 Difference]: Start difference. First operand has 144 places, 200 transitions, 2305 flow. Second operand 24 states and 269 transitions. [2025-03-04 02:18:39,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 310 transitions, 3766 flow [2025-03-04 02:18:39,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 310 transitions, 3532 flow, removed 42 selfloop flow, removed 14 redundant places. [2025-03-04 02:18:39,413 INFO L231 Difference]: Finished difference. Result has 157 places, 218 transitions, 2612 flow [2025-03-04 02:18:39,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2091, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2612, PETRI_PLACES=157, PETRI_TRANSITIONS=218} [2025-03-04 02:18:39,413 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 126 predicate places. [2025-03-04 02:18:39,413 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 218 transitions, 2612 flow [2025-03-04 02:18:39,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.133333333333334) internal successors, (184), 30 states have internal predecessors, (184), 0 states have call successors, (0), 0 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:39,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:39,414 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:39,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 02:18:39,618 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:39,618 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:39,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:39,618 INFO L85 PathProgramCache]: Analyzing trace with hash -563600465, now seen corresponding path program 5 times [2025-03-04 02:18:39,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:39,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681182616] [2025-03-04 02:18:39,619 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:39,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:39,628 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 4 equivalence classes. [2025-03-04 02:18:39,672 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:18:39,672 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 02:18:39,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:40,396 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 02:18:40,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:40,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681182616] [2025-03-04 02:18:40,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681182616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:40,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301365250] [2025-03-04 02:18:40,396 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:40,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:40,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:40,398 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:40,399 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:40,522 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 4 equivalence classes. [2025-03-04 02:18:40,683 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:18:40,683 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 02:18:40,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:40,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 02:18:40,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:40,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:18:40,864 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 48 [2025-03-04 02:18:40,889 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:40,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:41,193 INFO L349 Elim1Store]: treesize reduction 8, result has 96.1 percent of original size [2025-03-04 02:18:41,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 56 treesize of output 212 [2025-03-04 02:18:48,583 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:48,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301365250] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:48,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:48,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 9] total 26 [2025-03-04 02:18:48,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666992479] [2025-03-04 02:18:48,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:48,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 02:18:48,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:48,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 02:18:48,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2025-03-04 02:18:48,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:48,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 218 transitions, 2612 flow. Second operand has 26 states, 26 states have (on average 6.269230769230769) internal successors, (163), 26 states have internal predecessors, (163), 0 states have call successors, (0), 0 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:48,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:48,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:48,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:50,298 INFO L124 PetriNetUnfolderBase]: 2975/4300 cut-off events. [2025-03-04 02:18:50,299 INFO L125 PetriNetUnfolderBase]: For 77217/77217 co-relation queries the response was YES. [2025-03-04 02:18:50,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30833 conditions, 4300 events. 2975/4300 cut-off events. For 77217/77217 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 20457 event pairs, 263 based on Foata normal form. 1/4301 useless extension candidates. Maximal degree in co-relation 30691. Up to 2505 conditions per place. [2025-03-04 02:18:50,348 INFO L140 encePairwiseOnDemand]: 16/31 looper letters, 218 selfloop transitions, 165 changer transitions 40/424 dead transitions. [2025-03-04 02:18:50,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 424 transitions, 5630 flow [2025-03-04 02:18:50,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 02:18:50,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 02:18:50,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 280 transitions. [2025-03-04 02:18:50,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2025-03-04 02:18:50,350 INFO L175 Difference]: Start difference. First operand has 157 places, 218 transitions, 2612 flow. Second operand 24 states and 280 transitions. [2025-03-04 02:18:50,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 424 transitions, 5630 flow [2025-03-04 02:18:50,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 424 transitions, 5398 flow, removed 14 selfloop flow, removed 17 redundant places. [2025-03-04 02:18:50,636 INFO L231 Difference]: Finished difference. Result has 175 places, 291 transitions, 4070 flow [2025-03-04 02:18:50,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2440, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=4070, PETRI_PLACES=175, PETRI_TRANSITIONS=291} [2025-03-04 02:18:50,637 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 144 predicate places. [2025-03-04 02:18:50,637 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 291 transitions, 4070 flow [2025-03-04 02:18:50,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.269230769230769) internal successors, (163), 26 states have internal predecessors, (163), 0 states have call successors, (0), 0 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:50,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:50,637 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:50,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 02:18:50,837 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:50,838 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:50,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:50,838 INFO L85 PathProgramCache]: Analyzing trace with hash -869247321, now seen corresponding path program 6 times [2025-03-04 02:18:50,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:50,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206231848] [2025-03-04 02:18:50,838 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:18:50,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:50,848 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 4 equivalence classes. [2025-03-04 02:18:50,875 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 39 statements. [2025-03-04 02:18:50,875 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:18:50,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:51,661 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:51,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:51,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206231848] [2025-03-04 02:18:51,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206231848] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:51,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073355044] [2025-03-04 02:18:51,662 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:18:51,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:51,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:51,665 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:51,667 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:51,764 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 4 equivalence classes. [2025-03-04 02:18:51,804 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 39 statements. [2025-03-04 02:18:51,804 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:18:51,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:51,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 02:18:51,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:51,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:18:51,985 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 40 [2025-03-04 02:18:52,053 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:52,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:52,341 INFO L349 Elim1Store]: treesize reduction 32, result has 73.6 percent of original size [2025-03-04 02:18:52,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 102 [2025-03-04 02:18:52,470 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:52,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073355044] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:52,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:52,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 9] total 27 [2025-03-04 02:18:52,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986201697] [2025-03-04 02:18:52,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:52,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 02:18:52,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:52,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 02:18:52,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2025-03-04 02:18:52,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:52,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 291 transitions, 4070 flow. Second operand has 27 states, 27 states have (on average 6.2592592592592595) internal successors, (169), 27 states have internal predecessors, (169), 0 states have call successors, (0), 0 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:52,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:52,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:52,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:54,353 INFO L124 PetriNetUnfolderBase]: 2862/4180 cut-off events. [2025-03-04 02:18:54,353 INFO L125 PetriNetUnfolderBase]: For 127567/127567 co-relation queries the response was YES. [2025-03-04 02:18:54,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34737 conditions, 4180 events. 2862/4180 cut-off events. For 127567/127567 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 20454 event pairs, 252 based on Foata normal form. 2/4182 useless extension candidates. Maximal degree in co-relation 34581. Up to 1221 conditions per place. [2025-03-04 02:18:54,381 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 292 selfloop transitions, 177 changer transitions 2/472 dead transitions. [2025-03-04 02:18:54,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 472 transitions, 7166 flow [2025-03-04 02:18:54,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 02:18:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-04 02:18:54,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 348 transitions. [2025-03-04 02:18:54,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35080645161290325 [2025-03-04 02:18:54,383 INFO L175 Difference]: Start difference. First operand has 175 places, 291 transitions, 4070 flow. Second operand 32 states and 348 transitions. [2025-03-04 02:18:54,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 472 transitions, 7166 flow [2025-03-04 02:18:54,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 472 transitions, 6531 flow, removed 245 selfloop flow, removed 9 redundant places. [2025-03-04 02:18:54,669 INFO L231 Difference]: Finished difference. Result has 202 places, 337 transitions, 4918 flow [2025-03-04 02:18:54,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3697, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=4918, PETRI_PLACES=202, PETRI_TRANSITIONS=337} [2025-03-04 02:18:54,669 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 171 predicate places. [2025-03-04 02:18:54,669 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 337 transitions, 4918 flow [2025-03-04 02:18:54,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.2592592592592595) internal successors, (169), 27 states have internal predecessors, (169), 0 states have call successors, (0), 0 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:54,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:54,670 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:54,676 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:54,870 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:54,870 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:54,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:54,871 INFO L85 PathProgramCache]: Analyzing trace with hash 148950831, now seen corresponding path program 7 times [2025-03-04 02:18:54,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:54,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605341893] [2025-03-04 02:18:54,871 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:18:54,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:54,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 02:18:54,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:18:54,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:54,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:55,538 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 02:18:55,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:55,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605341893] [2025-03-04 02:18:55,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605341893] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:18:55,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666012301] [2025-03-04 02:18:55,539 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:18:55,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:55,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:55,541 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:55,543 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:55,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 02:18:55,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:18:55,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:55,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:55,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 02:18:55,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:18:55,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:18:55,878 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:55,900 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:55,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:18:56,277 INFO L349 Elim1Store]: treesize reduction 32, result has 73.6 percent of original size [2025-03-04 02:18:56,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 102 [2025-03-04 02:18:56,459 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:18:56,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666012301] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:18:56,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:18:56,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 9] total 27 [2025-03-04 02:18:56,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142469526] [2025-03-04 02:18:56,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:18:56,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 02:18:56,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:56,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 02:18:56,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2025-03-04 02:18:56,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:18:56,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 337 transitions, 4918 flow. Second operand has 27 states, 27 states have (on average 6.148148148148148) internal successors, (166), 27 states have internal predecessors, (166), 0 states have call successors, (0), 0 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:56,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:56,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:18:56,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:58,683 INFO L124 PetriNetUnfolderBase]: 3084/4505 cut-off events. [2025-03-04 02:18:58,684 INFO L125 PetriNetUnfolderBase]: For 150800/150800 co-relation queries the response was YES. [2025-03-04 02:18:58,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38208 conditions, 4505 events. 3084/4505 cut-off events. For 150800/150800 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 22194 event pairs, 292 based on Foata normal form. 1/4495 useless extension candidates. Maximal degree in co-relation 38051. Up to 1561 conditions per place. [2025-03-04 02:18:58,764 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 265 selfloop transitions, 187 changer transitions 8/461 dead transitions. [2025-03-04 02:18:58,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 461 transitions, 7227 flow [2025-03-04 02:18:58,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 02:18:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 02:18:58,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 275 transitions. [2025-03-04 02:18:58,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3856942496493689 [2025-03-04 02:18:58,765 INFO L175 Difference]: Start difference. First operand has 202 places, 337 transitions, 4918 flow. Second operand 23 states and 275 transitions. [2025-03-04 02:18:58,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 461 transitions, 7227 flow [2025-03-04 02:18:59,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 461 transitions, 6694 flow, removed 173 selfloop flow, removed 17 redundant places. [2025-03-04 02:18:59,068 INFO L231 Difference]: Finished difference. Result has 212 places, 352 transitions, 5194 flow [2025-03-04 02:18:59,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=4447, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=5194, PETRI_PLACES=212, PETRI_TRANSITIONS=352} [2025-03-04 02:18:59,069 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 181 predicate places. [2025-03-04 02:18:59,069 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 352 transitions, 5194 flow [2025-03-04 02:18:59,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.148148148148148) internal successors, (166), 27 states have internal predecessors, (166), 0 states have call successors, (0), 0 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:59,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:59,069 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:59,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 02:18:59,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:18:59,270 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:18:59,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:59,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1128215151, now seen corresponding path program 8 times [2025-03-04 02:18:59,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:59,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917548826] [2025-03-04 02:18:59,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:59,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:59,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-04 02:18:59,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:18:59,327 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:18:59,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:00,155 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 02:19:00,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:00,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917548826] [2025-03-04 02:19:00,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917548826] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:00,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843296] [2025-03-04 02:19:00,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:19:00,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:00,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:00,159 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:19:00,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 02:19:00,301 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-04 02:19:00,340 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:19:00,340 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:19:00,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:00,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 02:19:00,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:00,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:19:00,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 99 [2025-03-04 02:19:00,802 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:19:00,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:05,131 INFO L349 Elim1Store]: treesize reduction 32, result has 73.6 percent of original size [2025-03-04 02:19:05,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 102 [2025-03-04 02:19:05,186 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:19:05,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843296] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:05,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:05,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 9] total 30 [2025-03-04 02:19:05,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911876754] [2025-03-04 02:19:05,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:05,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 02:19:05,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:05,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 02:19:05,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2025-03-04 02:19:05,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:19:05,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 352 transitions, 5194 flow. Second operand has 30 states, 30 states have (on average 6.133333333333334) internal successors, (184), 30 states have internal predecessors, (184), 0 states have call successors, (0), 0 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:19:05,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:05,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:19:05,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:09,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 02:19:13,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 02:19:15,406 INFO L124 PetriNetUnfolderBase]: 3092/4527 cut-off events. [2025-03-04 02:19:15,406 INFO L125 PetriNetUnfolderBase]: For 142083/142083 co-relation queries the response was YES. [2025-03-04 02:19:15,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38060 conditions, 4527 events. 3092/4527 cut-off events. For 142083/142083 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 22528 event pairs, 263 based on Foata normal form. 2/4518 useless extension candidates. Maximal degree in co-relation 37901. Up to 1409 conditions per place. [2025-03-04 02:19:15,452 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 305 selfloop transitions, 169 changer transitions 3/478 dead transitions. [2025-03-04 02:19:15,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 478 transitions, 7497 flow [2025-03-04 02:19:15,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 02:19:15,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 02:19:15,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 264 transitions. [2025-03-04 02:19:15,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2025-03-04 02:19:15,453 INFO L175 Difference]: Start difference. First operand has 212 places, 352 transitions, 5194 flow. Second operand 24 states and 264 transitions. [2025-03-04 02:19:15,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 478 transitions, 7497 flow [2025-03-04 02:19:15,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 478 transitions, 7193 flow, removed 47 selfloop flow, removed 15 redundant places. [2025-03-04 02:19:15,791 INFO L231 Difference]: Finished difference. Result has 222 places, 365 transitions, 5482 flow [2025-03-04 02:19:15,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=4902, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=5482, PETRI_PLACES=222, PETRI_TRANSITIONS=365} [2025-03-04 02:19:15,791 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 191 predicate places. [2025-03-04 02:19:15,791 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 365 transitions, 5482 flow [2025-03-04 02:19:15,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.133333333333334) internal successors, (184), 30 states have internal predecessors, (184), 0 states have call successors, (0), 0 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:19:15,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:15,792 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:19:15,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 02:19:15,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 02:19:15,992 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:19:15,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:15,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1947018607, now seen corresponding path program 9 times [2025-03-04 02:19:15,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:15,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417458890] [2025-03-04 02:19:15,993 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:19:15,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:16,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 5 equivalence classes. [2025-03-04 02:19:16,013 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 39 statements. [2025-03-04 02:19:16,014 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:19:16,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:16,523 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 02:19:16,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:16,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417458890] [2025-03-04 02:19:16,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417458890] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:19:16,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997717812] [2025-03-04 02:19:16,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:19:16,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:19:16,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:16,527 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:19:16,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 02:19:16,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 5 equivalence classes. [2025-03-04 02:19:16,680 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 39 statements. [2025-03-04 02:19:16,680 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:19:16,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:16,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 02:19:16,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:19:16,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:19:16,935 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:19:17,039 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:19:17,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:19:21,507 INFO L349 Elim1Store]: treesize reduction 32, result has 73.6 percent of original size [2025-03-04 02:19:21,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 102 [2025-03-04 02:19:21,666 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:19:21,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997717812] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:19:21,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:19:21,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 9] total 30 [2025-03-04 02:19:21,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183342206] [2025-03-04 02:19:21,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:19:21,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 02:19:21,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:21,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 02:19:21,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=742, Unknown=1, NotChecked=0, Total=870 [2025-03-04 02:19:21,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-03-04 02:19:21,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 365 transitions, 5482 flow. Second operand has 30 states, 30 states have (on average 6.133333333333334) internal successors, (184), 30 states have internal predecessors, (184), 0 states have call successors, (0), 0 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:19:21,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:21,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-03-04 02:19:21,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:25,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 02:19:30,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]