./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 2c579ed20cf5b381709dcc4ef9fbcf839f80c68ac017a29b947b11bd3a57dd56 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:35:12,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:35:12,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:35:12,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:35:12,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:35:12,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:35:12,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:35:12,849 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:35:12,849 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:35:12,849 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:35:12,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:35:12,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:35:12,851 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:35:12,851 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:35:12,851 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:35:12,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:35:12,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:35:12,851 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:35:12,852 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:35:12,852 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:35:12,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:35:12,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:35:12,852 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:35:12,852 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:35:12,852 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:35:12,852 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:35:12,852 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:35:12,852 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:35:12,853 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:35:12,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:35:12,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:35:12,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:35:12,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:35:12,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:35:12,854 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:35:12,854 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:35:12,854 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:35:12,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:35:12,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:35:12,854 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:35:12,854 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:35:12,854 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:35:12,854 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:35:12,854 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-jdk21/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 -> 2c579ed20cf5b381709dcc4ef9fbcf839f80c68ac017a29b947b11bd3a57dd56 [2025-02-06 04:35:13,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:35:13,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:35:13,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:35:13,086 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:35:13,086 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:35:13,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2025-02-06 04:35:14,225 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/795d9c6d2/1689cba523fc45b28b29ed574f44f083/FLAGf1b1b4a9d [2025-02-06 04:35:14,504 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:35:14,505 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2025-02-06 04:35:14,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/795d9c6d2/1689cba523fc45b28b29ed574f44f083/FLAGf1b1b4a9d [2025-02-06 04:35:14,807 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/795d9c6d2/1689cba523fc45b28b29ed574f44f083 [2025-02-06 04:35:14,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:35:14,813 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:35:14,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:35:14,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:35:14,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:35:14,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:35:14" (1/1) ... [2025-02-06 04:35:14,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40e8459e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:14, skipping insertion in model container [2025-02-06 04:35:14,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:35:14" (1/1) ... [2025-02-06 04:35:14,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:35:14,958 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c[2644,2657] [2025-02-06 04:35:14,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:35:14,979 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:35:15,000 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c[2644,2657] [2025-02-06 04:35:15,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:35:15,020 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:35:15,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:15 WrapperNode [2025-02-06 04:35:15,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:35:15,021 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:35:15,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:35:15,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:35:15,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:15" (1/1) ... [2025-02-06 04:35:15,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:15" (1/1) ... [2025-02-06 04:35:15,054 INFO L138 Inliner]: procedures = 24, calls = 31, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 172 [2025-02-06 04:35:15,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:35:15,055 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:35:15,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:35:15,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:35:15,061 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:15" (1/1) ... [2025-02-06 04:35:15,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:15" (1/1) ... [2025-02-06 04:35:15,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:15" (1/1) ... [2025-02-06 04:35:15,084 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 3, 9]. 64 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 1, 5]. [2025-02-06 04:35:15,085 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:15" (1/1) ... [2025-02-06 04:35:15,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:15" (1/1) ... [2025-02-06 04:35:15,093 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:15" (1/1) ... [2025-02-06 04:35:15,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:15" (1/1) ... [2025-02-06 04:35:15,098 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:15" (1/1) ... [2025-02-06 04:35:15,099 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:15" (1/1) ... [2025-02-06 04:35:15,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:35:15,101 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:35:15,101 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:35:15,101 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:35:15,106 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:15" (1/1) ... [2025-02-06 04:35:15,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:35:15,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:35:15,137 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:35:15,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 04:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 04:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 04:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 04:35:15,177 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 04:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 04:35:15,177 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 04:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 04:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 04:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 04:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 04:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 04:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 04:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:35:15,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:35:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:35:15,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 04:35:15,182 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:35:15,270 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:35:15,271 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:35:15,497 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:35:15,498 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:35:15,694 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:35:15,696 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:35:15,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:35:15 BoogieIcfgContainer [2025-02-06 04:35:15,696 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:35:15,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:35:15,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:35:15,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:35:15,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:35:14" (1/3) ... [2025-02-06 04:35:15,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d51601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:35:15, skipping insertion in model container [2025-02-06 04:35:15,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:35:15" (2/3) ... [2025-02-06 04:35:15,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d51601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:35:15, skipping insertion in model container [2025-02-06 04:35:15,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:35:15" (3/3) ... [2025-02-06 04:35:15,704 INFO L128 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2025-02-06 04:35:15,714 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:35:15,716 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG loop-tiling-eq.wvr.c that has 3 procedures, 22 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-02-06 04:35:15,716 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:35:15,764 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 04:35:15,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 28 transitions, 70 flow [2025-02-06 04:35:15,848 INFO L124 PetriNetUnfolderBase]: 7/26 cut-off events. [2025-02-06 04:35:15,853 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:35:15,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 7/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 16. Up to 2 conditions per place. [2025-02-06 04:35:15,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 28 transitions, 70 flow [2025-02-06 04:35:15,864 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 25 transitions, 62 flow [2025-02-06 04:35:15,874 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:35:15,890 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;@56383b67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:35:15,890 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-06 04:35:15,897 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:35:15,898 INFO L124 PetriNetUnfolderBase]: 7/24 cut-off events. [2025-02-06 04:35:15,898 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:35:15,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:15,898 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:35:15,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:35:15,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:15,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1741058234, now seen corresponding path program 1 times [2025-02-06 04:35:15,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:15,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144640766] [2025-02-06 04:35:15,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:35:15,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:15,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 04:35:16,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 04:35:16,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:35:16,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:16,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:16,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:16,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144640766] [2025-02-06 04:35:16,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144640766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:16,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:16,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:35:16,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022355] [2025-02-06 04:35:16,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:16,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:35:16,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:16,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:35:16,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:35:16,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-02-06 04:35:16,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:16,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:16,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-02-06 04:35:16,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:16,442 INFO L124 PetriNetUnfolderBase]: 113/193 cut-off events. [2025-02-06 04:35:16,443 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-06 04:35:16,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 193 events. 113/193 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 474 event pairs, 60 based on Foata normal form. 1/140 useless extension candidates. Maximal degree in co-relation 162. Up to 100 conditions per place. [2025-02-06 04:35:16,450 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 25 selfloop transitions, 2 changer transitions 15/43 dead transitions. [2025-02-06 04:35:16,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 43 transitions, 194 flow [2025-02-06 04:35:16,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:35:16,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:35:16,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2025-02-06 04:35:16,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49107142857142855 [2025-02-06 04:35:16,459 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 62 flow. Second operand 4 states and 55 transitions. [2025-02-06 04:35:16,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 43 transitions, 194 flow [2025-02-06 04:35:16,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 43 transitions, 178 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 04:35:16,463 INFO L231 Difference]: Finished difference. Result has 26 places, 26 transitions, 68 flow [2025-02-06 04:35:16,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=26, PETRI_TRANSITIONS=26} [2025-02-06 04:35:16,467 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 1 predicate places. [2025-02-06 04:35:16,467 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 26 transitions, 68 flow [2025-02-06 04:35:16,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:16,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:16,467 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:35:16,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:35:16,468 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:35:16,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:16,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2042191423, now seen corresponding path program 1 times [2025-02-06 04:35:16,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:16,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154347991] [2025-02-06 04:35:16,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:35:16,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:16,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 04:35:16,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 04:35:16,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:35:16,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:16,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:16,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:16,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154347991] [2025-02-06 04:35:16,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154347991] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:35:16,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653488859] [2025-02-06 04:35:16,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:35:16,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:35:16,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:35:16,637 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:35:16,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:35:16,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 04:35:16,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 04:35:16,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:35:16,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:16,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 04:35:16,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:35:16,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:16,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:35:16,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:16,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653488859] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:35:16,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:35:16,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-02-06 04:35:16,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303230621] [2025-02-06 04:35:16,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:35:16,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:35:16,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:16,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:35:16,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:35:16,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-02-06 04:35:16,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 26 transitions, 68 flow. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:16,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:16,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-02-06 04:35:16,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:17,029 INFO L124 PetriNetUnfolderBase]: 86/144 cut-off events. [2025-02-06 04:35:17,030 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-06 04:35:17,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 144 events. 86/144 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 292 event pairs, 22 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 293. Up to 67 conditions per place. [2025-02-06 04:35:17,031 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 32 selfloop transitions, 8 changer transitions 0/41 dead transitions. [2025-02-06 04:35:17,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 180 flow [2025-02-06 04:35:17,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:35:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:35:17,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2025-02-06 04:35:17,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29017857142857145 [2025-02-06 04:35:17,033 INFO L175 Difference]: Start difference. First operand has 26 places, 26 transitions, 68 flow. Second operand 8 states and 65 transitions. [2025-02-06 04:35:17,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 180 flow [2025-02-06 04:35:17,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 41 transitions, 176 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 04:35:17,034 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 101 flow [2025-02-06 04:35:17,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=101, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2025-02-06 04:35:17,035 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2025-02-06 04:35:17,035 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 101 flow [2025-02-06 04:35:17,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:17,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:17,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:35:17,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 04:35:17,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:35:17,236 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:35:17,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:17,237 INFO L85 PathProgramCache]: Analyzing trace with hash -17699628, now seen corresponding path program 1 times [2025-02-06 04:35:17,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:17,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703314047] [2025-02-06 04:35:17,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:35:17,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:17,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 04:35:17,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:35:17,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:35:17,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:17,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:35:17,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:17,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703314047] [2025-02-06 04:35:17,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703314047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:17,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:17,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:35:17,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972751683] [2025-02-06 04:35:17,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:17,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:35:17,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:17,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:35:17,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:35:17,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-02-06 04:35:17,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:17,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:17,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-02-06 04:35:17,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:17,514 INFO L124 PetriNetUnfolderBase]: 171/284 cut-off events. [2025-02-06 04:35:17,514 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-02-06 04:35:17,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 284 events. 171/284 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 745 event pairs, 92 based on Foata normal form. 1/256 useless extension candidates. Maximal degree in co-relation 677. Up to 144 conditions per place. [2025-02-06 04:35:17,516 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 26 selfloop transitions, 3 changer transitions 24/54 dead transitions. [2025-02-06 04:35:17,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 54 transitions, 296 flow [2025-02-06 04:35:17,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:35:17,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:35:17,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2025-02-06 04:35:17,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2025-02-06 04:35:17,517 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 101 flow. Second operand 5 states and 62 transitions. [2025-02-06 04:35:17,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 54 transitions, 296 flow [2025-02-06 04:35:17,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 54 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:35:17,519 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 121 flow [2025-02-06 04:35:17,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2025-02-06 04:35:17,520 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 13 predicate places. [2025-02-06 04:35:17,520 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 121 flow [2025-02-06 04:35:17,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:17,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:17,520 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-02-06 04:35:17,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:35:17,521 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:35:17,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:17,521 INFO L85 PathProgramCache]: Analyzing trace with hash -303024657, now seen corresponding path program 1 times [2025-02-06 04:35:17,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:17,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270157765] [2025-02-06 04:35:17,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:35:17,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:17,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 04:35:17,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 04:35:17,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:35:17,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:17,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:17,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:17,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270157765] [2025-02-06 04:35:17,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270157765] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:35:17,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453458322] [2025-02-06 04:35:17,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:35:17,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:35:17,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:35:17,672 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:35:17,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 04:35:17,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 04:35:17,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 04:35:17,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:35:17,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:17,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 04:35:17,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:35:17,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:17,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:35:17,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:35:17,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453458322] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 04:35:17,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:35:17,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2025-02-06 04:35:17,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591322119] [2025-02-06 04:35:17,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:17,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:17,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:17,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:17,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:35:17,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-02-06 04:35:17,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 121 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:17,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:17,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-02-06 04:35:17,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:17,971 INFO L124 PetriNetUnfolderBase]: 108/186 cut-off events. [2025-02-06 04:35:17,972 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-02-06 04:35:17,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 186 events. 108/186 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 385 event pairs, 46 based on Foata normal form. 14/180 useless extension candidates. Maximal degree in co-relation 463. Up to 146 conditions per place. [2025-02-06 04:35:17,973 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 33 selfloop transitions, 8 changer transitions 0/42 dead transitions. [2025-02-06 04:35:17,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 240 flow [2025-02-06 04:35:17,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:35:17,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:35:17,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2025-02-06 04:35:17,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37142857142857144 [2025-02-06 04:35:17,975 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 121 flow. Second operand 5 states and 52 transitions. [2025-02-06 04:35:17,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 240 flow [2025-02-06 04:35:17,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 225 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-02-06 04:35:17,976 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 166 flow [2025-02-06 04:35:17,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2025-02-06 04:35:17,977 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 15 predicate places. [2025-02-06 04:35:17,977 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 166 flow [2025-02-06 04:35:17,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:17,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:17,977 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:35:17,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 04:35:18,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:35:18,179 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:35:18,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:18,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1689681217, now seen corresponding path program 1 times [2025-02-06 04:35:18,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:18,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552674390] [2025-02-06 04:35:18,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:35:18,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:18,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 04:35:18,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 04:35:18,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:35:18,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 04:35:18,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [470754599] [2025-02-06 04:35:18,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:35:18,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:35:18,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:35:18,220 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:35:18,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 04:35:18,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 04:35:18,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 04:35:18,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:35:18,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:18,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 04:35:18,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:35:18,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:35:18,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:35:18,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:35:18,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:18,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552674390] [2025-02-06 04:35:18,531 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 04:35:18,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470754599] [2025-02-06 04:35:18,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470754599] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 04:35:18,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:35:18,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2025-02-06 04:35:18,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850276264] [2025-02-06 04:35:18,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:18,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:35:18,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:18,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:35:18,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:35:18,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-02-06 04:35:18,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 166 flow. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:18,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:18,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-02-06 04:35:18,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:18,689 INFO L124 PetriNetUnfolderBase]: 142/258 cut-off events. [2025-02-06 04:35:18,689 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2025-02-06 04:35:18,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 258 events. 142/258 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 638 event pairs, 76 based on Foata normal form. 7/238 useless extension candidates. Maximal degree in co-relation 498. Up to 181 conditions per place. [2025-02-06 04:35:18,691 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 26 selfloop transitions, 9 changer transitions 25/61 dead transitions. [2025-02-06 04:35:18,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 61 transitions, 395 flow [2025-02-06 04:35:18,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:35:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:35:18,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 71 transitions. [2025-02-06 04:35:18,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3622448979591837 [2025-02-06 04:35:18,692 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 166 flow. Second operand 7 states and 71 transitions. [2025-02-06 04:35:18,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 61 transitions, 395 flow [2025-02-06 04:35:18,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 386 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 04:35:18,694 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 196 flow [2025-02-06 04:35:18,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=196, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2025-02-06 04:35:18,695 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 23 predicate places. [2025-02-06 04:35:18,695 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 196 flow [2025-02-06 04:35:18,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:18,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:18,696 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:35:18,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 04:35:18,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:35:18,900 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:35:18,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:18,900 INFO L85 PathProgramCache]: Analyzing trace with hash 922276900, now seen corresponding path program 1 times [2025-02-06 04:35:18,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:18,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485507755] [2025-02-06 04:35:18,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:35:18,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:18,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 04:35:18,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 04:35:18,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:35:18,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:19,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 04:35:19,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:19,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485507755] [2025-02-06 04:35:19,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485507755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:35:19,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:35:19,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:35:19,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543631024] [2025-02-06 04:35:19,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:19,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:35:19,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:19,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:35:19,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:35:19,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-02-06 04:35:19,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 196 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:19,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:19,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-02-06 04:35:19,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:19,211 INFO L124 PetriNetUnfolderBase]: 106/183 cut-off events. [2025-02-06 04:35:19,211 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2025-02-06 04:35:19,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 183 events. 106/183 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 374 event pairs, 62 based on Foata normal form. 1/166 useless extension candidates. Maximal degree in co-relation 495. Up to 180 conditions per place. [2025-02-06 04:35:19,213 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 28 selfloop transitions, 4 changer transitions 1/34 dead transitions. [2025-02-06 04:35:19,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 34 transitions, 241 flow [2025-02-06 04:35:19,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:35:19,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:35:19,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2025-02-06 04:35:19,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2025-02-06 04:35:19,214 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 196 flow. Second operand 4 states and 40 transitions. [2025-02-06 04:35:19,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 34 transitions, 241 flow [2025-02-06 04:35:19,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 34 transitions, 226 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-02-06 04:35:19,216 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 164 flow [2025-02-06 04:35:19,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2025-02-06 04:35:19,217 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 18 predicate places. [2025-02-06 04:35:19,217 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 164 flow [2025-02-06 04:35:19,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:19,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:19,217 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-02-06 04:35:19,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:35:19,217 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:35:19,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:19,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1369110256, now seen corresponding path program 1 times [2025-02-06 04:35:19,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:19,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853954592] [2025-02-06 04:35:19,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:35:19,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:19,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:35:19,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:35:19,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:35:19,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:19,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:35:19,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:35:19,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853954592] [2025-02-06 04:35:19,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853954592] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:35:19,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001620043] [2025-02-06 04:35:19,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:35:19,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:35:19,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:35:19,358 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:35:19,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 04:35:19,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:35:19,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:35:19,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:35:19,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:19,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 04:35:19,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:35:19,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:35:19,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:35:19,543 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 04:35:19,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001620043] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 04:35:19,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:35:19,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-02-06 04:35:19,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608768110] [2025-02-06 04:35:19,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:35:19,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:35:19,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:35:19,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:35:19,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:35:19,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-02-06 04:35:19,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:19,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:35:19,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-02-06 04:35:19,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:35:19,657 INFO L124 PetriNetUnfolderBase]: 136/230 cut-off events. [2025-02-06 04:35:19,657 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-02-06 04:35:19,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 230 events. 136/230 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 566 event pairs, 62 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 617. Up to 180 conditions per place. [2025-02-06 04:35:19,658 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 40 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2025-02-06 04:35:19,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 305 flow [2025-02-06 04:35:19,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:35:19,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:35:19,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2025-02-06 04:35:19,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2025-02-06 04:35:19,659 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 164 flow. Second operand 5 states and 50 transitions. [2025-02-06 04:35:19,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 305 flow [2025-02-06 04:35:19,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:35:19,660 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 169 flow [2025-02-06 04:35:19,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2025-02-06 04:35:19,661 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 20 predicate places. [2025-02-06 04:35:19,661 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 169 flow [2025-02-06 04:35:19,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:35:19,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:35:19,661 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-02-06 04:35:19,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 04:35:19,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-06 04:35:19,865 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-06 04:35:19,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:35:19,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1273556433, now seen corresponding path program 1 times [2025-02-06 04:35:19,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:35:19,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910817795] [2025-02-06 04:35:19,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:35:19,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:35:19,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 04:35:19,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:35:19,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:35:19,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 04:35:19,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1510499022] [2025-02-06 04:35:19,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:35:19,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:35:19,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:35:19,933 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:35:19,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 04:35:19,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 04:35:20,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:35:20,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:35:20,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:35:20,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-02-06 04:35:20,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:35:20,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 04:35:20,074 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 04:35:20,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-06 04:35:20,112 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 04:35:20,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-06 04:35:20,151 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 04:35:20,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 04:35:20,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 04:35:20,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 04:35:20,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2025-02-06 04:35:20,557 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2025-02-06 04:35:20,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 33 [2025-02-06 04:35:20,737 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 04:35:20,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:35:47,289 INFO L349 Elim1Store]: treesize reduction 4, result has 97.4 percent of original size [2025-02-06 04:35:47,291 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 2192 treesize of output 1915 [2025-02-06 04:36:15,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2305 treesize of output 2169 [2025-02-06 04:36:15,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2169 treesize of output 2117 [2025-02-06 04:36:41,953 WARN L286 SmtUtils]: Spent 26.61s on a formula simplification that was a NOOP. DAG size: 1153 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-02-06 04:36:41,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:36:41,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 24 select indices, 24 select index equivalence classes, 0 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 276 case distinctions, treesize of input 3133 treesize of output 4982