./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/popl20-more-vector-add.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 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:18:35,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:18:35,610 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:18:35,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:18:35,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:18:35,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:18:35,629 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:18:35,629 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:18:35,629 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:18:35,629 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:18:35,630 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:18:35,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:18:35,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:18:35,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:18:35,630 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:18:35,630 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:18:35,630 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:18:35,630 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:18:35,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:18:35,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:18:35,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:18:35,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:18:35,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:18:35,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:18:35,631 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:18:35,631 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:18:35,631 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:18:35,631 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:18:35,631 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:18:35,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:18:35,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:18:35,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:18:35,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:18:35,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:18:35,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:18:35,632 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:18:35,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:18:35,632 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:18:35,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:18:35,632 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:18:35,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:18:35,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:18:35,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:18:35,633 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 -> 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 [2025-02-08 01:18:35,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:18:35,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:18:35,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:18:35,845 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:18:35,845 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:18:35,846 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2025-02-08 01:18:37,063 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fada6f20f/6ca96e2c50614cc7b88bc9efda85ac04/FLAGf328136aa [2025-02-08 01:18:37,325 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:18:37,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2025-02-08 01:18:37,337 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fada6f20f/6ca96e2c50614cc7b88bc9efda85ac04/FLAGf328136aa [2025-02-08 01:18:37,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fada6f20f/6ca96e2c50614cc7b88bc9efda85ac04 [2025-02-08 01:18:37,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:18:37,358 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:18:37,359 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:18:37,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:18:37,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:18:37,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:18:37" (1/1) ... [2025-02-08 01:18:37,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@283cf62a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:37, skipping insertion in model container [2025-02-08 01:18:37,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:18:37" (1/1) ... [2025-02-08 01:18:37,379 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:18:37,498 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/popl20-more-vector-add.wvr.c[2637,2650] [2025-02-08 01:18:37,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:18:37,515 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:18:37,534 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/popl20-more-vector-add.wvr.c[2637,2650] [2025-02-08 01:18:37,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:18:37,548 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:18:37,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:37 WrapperNode [2025-02-08 01:18:37,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:18:37,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:18:37,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:18:37,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:18:37,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:37" (1/1) ... [2025-02-08 01:18:37,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:37" (1/1) ... [2025-02-08 01:18:37,582 INFO L138 Inliner]: procedures = 24, calls = 31, calls flagged for inlining = 11, calls inlined = 17, statements flattened = 173 [2025-02-08 01:18:37,586 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:18:37,586 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:18:37,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:18:37,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:18:37,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:37" (1/1) ... [2025-02-08 01:18:37,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:37" (1/1) ... [2025-02-08 01:18:37,597 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:37" (1/1) ... [2025-02-08 01:18:37,616 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2025-02-08 01:18:37,618 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:37" (1/1) ... [2025-02-08 01:18:37,618 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:37" (1/1) ... [2025-02-08 01:18:37,628 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:37" (1/1) ... [2025-02-08 01:18:37,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:37" (1/1) ... [2025-02-08 01:18:37,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:37" (1/1) ... [2025-02-08 01:18:37,631 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:37" (1/1) ... [2025-02-08 01:18:37,634 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:18:37,634 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:18:37,636 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:18:37,636 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:18:37,637 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:37" (1/1) ... [2025-02-08 01:18:37,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:18:37,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:18:37,661 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-08 01:18:37,663 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-08 01:18:37,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:18:37,681 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 01:18:37,681 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 01:18:37,683 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 01:18:37,683 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 01:18:37,683 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 01:18:37,683 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 01:18:37,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:18:37,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:18:37,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:18:37,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:18:37,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:18:37,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:18:37,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:18:37,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:18:37,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:18:37,685 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:18:37,780 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:18:37,781 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:18:38,089 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:18:38,090 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:18:38,263 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:18:38,263 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:18:38,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:18:38 BoogieIcfgContainer [2025-02-08 01:18:38,264 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:18:38,265 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:18:38,265 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:18:38,268 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:18:38,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:18:37" (1/3) ... [2025-02-08 01:18:38,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d54efd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:18:38, skipping insertion in model container [2025-02-08 01:18:38,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:37" (2/3) ... [2025-02-08 01:18:38,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d54efd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:18:38, skipping insertion in model container [2025-02-08 01:18:38,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:18:38" (3/3) ... [2025-02-08 01:18:38,269 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-vector-add.wvr.c [2025-02-08 01:18:38,278 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:18:38,279 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-vector-add.wvr.c that has 4 procedures, 27 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-02-08 01:18:38,279 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:18:38,310 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 01:18:38,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 33 transitions, 87 flow [2025-02-08 01:18:38,350 INFO L124 PetriNetUnfolderBase]: 7/30 cut-off events. [2025-02-08 01:18:38,352 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:18:38,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 7/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-02-08 01:18:38,354 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 33 transitions, 87 flow [2025-02-08 01:18:38,355 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 29 transitions, 76 flow [2025-02-08 01:18:38,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:18:38,367 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;@4c71472d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:18:38,367 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 01:18:38,375 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:18:38,375 INFO L124 PetriNetUnfolderBase]: 7/28 cut-off events. [2025-02-08 01:18:38,375 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:18:38,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:38,376 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-08 01:18:38,377 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:38,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:38,380 INFO L85 PathProgramCache]: Analyzing trace with hash 2004153798, now seen corresponding path program 1 times [2025-02-08 01:18:38,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:38,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43745096] [2025-02-08 01:18:38,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:18:38,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:38,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 01:18:38,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 01:18:38,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:18:38,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:38,742 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-08 01:18:38,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:38,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43745096] [2025-02-08 01:18:38,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43745096] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:38,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:38,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:18:38,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448790073] [2025-02-08 01:18:38,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:38,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:18:38,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:38,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:18:38,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:18:38,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-02-08 01:18:38,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-08 01:18:38,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:38,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-02-08 01:18:38,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:38,942 INFO L124 PetriNetUnfolderBase]: 411/611 cut-off events. [2025-02-08 01:18:38,943 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-02-08 01:18:38,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1304 conditions, 611 events. 411/611 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1675 event pairs, 248 based on Foata normal form. 1/448 useless extension candidates. Maximal degree in co-relation 534. Up to 301 conditions per place. [2025-02-08 01:18:38,946 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 24 selfloop transitions, 8 changer transitions 34/67 dead transitions. [2025-02-08 01:18:38,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 67 transitions, 302 flow [2025-02-08 01:18:38,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:18:38,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:18:38,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2025-02-08 01:18:38,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5272727272727272 [2025-02-08 01:18:38,955 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 76 flow. Second operand 5 states and 87 transitions. [2025-02-08 01:18:38,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 67 transitions, 302 flow [2025-02-08 01:18:38,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 67 transitions, 278 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 01:18:38,961 INFO L231 Difference]: Finished difference. Result has 33 places, 33 transitions, 116 flow [2025-02-08 01:18:38,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=33, PETRI_TRANSITIONS=33} [2025-02-08 01:18:38,964 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2025-02-08 01:18:38,964 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 33 transitions, 116 flow [2025-02-08 01:18:38,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-08 01:18:38,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:38,964 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:38,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:18:38,965 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:38,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:38,965 INFO L85 PathProgramCache]: Analyzing trace with hash 631241777, now seen corresponding path program 1 times [2025-02-08 01:18:38,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:38,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49714002] [2025-02-08 01:18:38,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:18:38,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:38,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:18:38,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:18:38,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:18:38,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:39,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:18:39,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:39,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49714002] [2025-02-08 01:18:39,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49714002] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:18:39,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622990946] [2025-02-08 01:18:39,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:18:39,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:18:39,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:18:39,105 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-08 01:18:39,107 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-08 01:18:39,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:18:39,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:18:39,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:18:39,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:39,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 01:18:39,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:18:39,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:18:39,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:18:39,296 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-08 01:18:39,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622990946] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:18:39,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:18:39,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-02-08 01:18:39,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393773809] [2025-02-08 01:18:39,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:39,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:18:39,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:39,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:18:39,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:18:39,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-02-08 01:18:39,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 33 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:18:39,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:39,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-02-08 01:18:39,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:39,397 INFO L124 PetriNetUnfolderBase]: 262/390 cut-off events. [2025-02-08 01:18:39,397 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:18:39,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 390 events. 262/390 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1026 event pairs, 124 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 814. Up to 303 conditions per place. [2025-02-08 01:18:39,400 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 40 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2025-02-08 01:18:39,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 45 transitions, 230 flow [2025-02-08 01:18:39,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:18:39,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:18:39,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2025-02-08 01:18:39,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2025-02-08 01:18:39,402 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 116 flow. Second operand 5 states and 62 transitions. [2025-02-08 01:18:39,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 45 transitions, 230 flow [2025-02-08 01:18:39,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 45 transitions, 212 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-02-08 01:18:39,403 INFO L231 Difference]: Finished difference. Result has 33 places, 34 transitions, 114 flow [2025-02-08 01:18:39,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=28, 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=114, PETRI_PLACES=33, PETRI_TRANSITIONS=34} [2025-02-08 01:18:39,404 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2025-02-08 01:18:39,404 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 34 transitions, 114 flow [2025-02-08 01:18:39,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:18:39,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:39,405 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:39,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 01:18:39,605 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-08 01:18:39,606 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:39,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:39,607 INFO L85 PathProgramCache]: Analyzing trace with hash -709419050, now seen corresponding path program 1 times [2025-02-08 01:18:39,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:39,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102554677] [2025-02-08 01:18:39,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:18:39,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:39,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 01:18:39,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:18:39,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:18:39,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:39,762 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-08 01:18:39,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:39,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102554677] [2025-02-08 01:18:39,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102554677] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:18:39,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744788707] [2025-02-08 01:18:39,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:18:39,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:18:39,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:18:39,765 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-08 01:18:39,771 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-08 01:18:39,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 01:18:39,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:18:39,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:18:39,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:39,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 01:18:39,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:18:39,931 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-08 01:18:39,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:18:39,992 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-08 01:18:39,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744788707] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:18:39,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:18:39,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-02-08 01:18:39,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116705319] [2025-02-08 01:18:39,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:39,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:18:39,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:39,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:18:39,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-08 01:18:39,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-02-08 01:18:39,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 34 transitions, 114 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-08 01:18:39,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:39,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-02-08 01:18:39,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:40,189 INFO L124 PetriNetUnfolderBase]: 443/657 cut-off events. [2025-02-08 01:18:40,189 INFO L125 PetriNetUnfolderBase]: For 224/224 co-relation queries the response was YES. [2025-02-08 01:18:40,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1577 conditions, 657 events. 443/657 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2081 event pairs, 169 based on Foata normal form. 0/492 useless extension candidates. Maximal degree in co-relation 1531. Up to 388 conditions per place. [2025-02-08 01:18:40,193 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 61 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2025-02-08 01:18:40,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 69 transitions, 358 flow [2025-02-08 01:18:40,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:18:40,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:18:40,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2025-02-08 01:18:40,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38961038961038963 [2025-02-08 01:18:40,194 INFO L175 Difference]: Start difference. First operand has 33 places, 34 transitions, 114 flow. Second operand 7 states and 90 transitions. [2025-02-08 01:18:40,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 69 transitions, 358 flow [2025-02-08 01:18:40,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 69 transitions, 338 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-02-08 01:18:40,196 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 146 flow [2025-02-08 01:18:40,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=146, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2025-02-08 01:18:40,197 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2025-02-08 01:18:40,197 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 146 flow [2025-02-08 01:18:40,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-08 01:18:40,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:40,197 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:40,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 01:18:40,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:18:40,398 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:40,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:40,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1186776208, now seen corresponding path program 2 times [2025-02-08 01:18:40,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:40,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022898377] [2025-02-08 01:18:40,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:18:40,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:40,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-08 01:18:40,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 27 statements. [2025-02-08 01:18:40,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:18:40,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:40,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 01:18:40,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:40,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022898377] [2025-02-08 01:18:40,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022898377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:40,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:40,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:18:40,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129063538] [2025-02-08 01:18:40,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:40,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:18:40,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:40,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:18:40,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:18:40,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-02-08 01:18:40,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:18:40,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:40,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-02-08 01:18:40,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:40,750 INFO L124 PetriNetUnfolderBase]: 693/1027 cut-off events. [2025-02-08 01:18:40,751 INFO L125 PetriNetUnfolderBase]: For 618/618 co-relation queries the response was YES. [2025-02-08 01:18:40,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2974 conditions, 1027 events. 693/1027 cut-off events. For 618/618 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3660 event pairs, 291 based on Foata normal form. 1/809 useless extension candidates. Maximal degree in co-relation 2925. Up to 642 conditions per place. [2025-02-08 01:18:40,757 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 65 selfloop transitions, 7 changer transitions 9/82 dead transitions. [2025-02-08 01:18:40,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 82 transitions, 468 flow [2025-02-08 01:18:40,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:18:40,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:18:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2025-02-08 01:18:40,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4494949494949495 [2025-02-08 01:18:40,758 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 146 flow. Second operand 6 states and 89 transitions. [2025-02-08 01:18:40,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 82 transitions, 468 flow [2025-02-08 01:18:40,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 82 transitions, 447 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-02-08 01:18:40,761 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 186 flow [2025-02-08 01:18:40,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2025-02-08 01:18:40,762 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2025-02-08 01:18:40,762 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 186 flow [2025-02-08 01:18:40,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:18:40,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:40,762 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:40,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:18:40,762 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:40,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:40,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1024892104, now seen corresponding path program 3 times [2025-02-08 01:18:40,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:40,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984286618] [2025-02-08 01:18:40,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:18:40,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:40,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-02-08 01:18:40,782 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 27 statements. [2025-02-08 01:18:40,782 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:18:40,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:40,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 01:18:40,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:40,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984286618] [2025-02-08 01:18:40,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984286618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:40,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:40,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:18:40,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848106253] [2025-02-08 01:18:40,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:40,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:18:40,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:40,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:18:40,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:18:40,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-02-08 01:18:40,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:18:40,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:40,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-02-08 01:18:40,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:41,062 INFO L124 PetriNetUnfolderBase]: 748/1101 cut-off events. [2025-02-08 01:18:41,062 INFO L125 PetriNetUnfolderBase]: For 1154/1154 co-relation queries the response was YES. [2025-02-08 01:18:41,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3673 conditions, 1101 events. 748/1101 cut-off events. For 1154/1154 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3918 event pairs, 366 based on Foata normal form. 1/926 useless extension candidates. Maximal degree in co-relation 3645. Up to 827 conditions per place. [2025-02-08 01:18:41,069 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 61 selfloop transitions, 11 changer transitions 9/82 dead transitions. [2025-02-08 01:18:41,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 82 transitions, 514 flow [2025-02-08 01:18:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:18:41,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:18:41,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2025-02-08 01:18:41,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4494949494949495 [2025-02-08 01:18:41,070 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 186 flow. Second operand 6 states and 89 transitions. [2025-02-08 01:18:41,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 82 transitions, 514 flow [2025-02-08 01:18:41,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 82 transitions, 488 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-02-08 01:18:41,074 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 257 flow [2025-02-08 01:18:41,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=257, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2025-02-08 01:18:41,074 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2025-02-08 01:18:41,074 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 257 flow [2025-02-08 01:18:41,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:18:41,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:41,075 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:41,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:18:41,075 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:41,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:41,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1938792564, now seen corresponding path program 4 times [2025-02-08 01:18:41,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:41,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350084370] [2025-02-08 01:18:41,076 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:18:41,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:41,084 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-02-08 01:18:41,088 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 22 of 27 statements. [2025-02-08 01:18:41,088 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 01:18:41,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:41,133 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-08 01:18:41,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:41,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350084370] [2025-02-08 01:18:41,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350084370] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:18:41,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419260902] [2025-02-08 01:18:41,133 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:18:41,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:18:41,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:18:41,135 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-08 01:18:41,137 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-08 01:18:41,186 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-02-08 01:18:41,200 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 22 of 27 statements. [2025-02-08 01:18:41,200 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 01:18:41,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:41,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 01:18:41,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:18:41,243 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-08 01:18:41,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:18:41,284 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-08 01:18:41,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419260902] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:18:41,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:18:41,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-02-08 01:18:41,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817602107] [2025-02-08 01:18:41,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:18:41,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 01:18:41,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:41,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 01:18:41,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:18:41,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-02-08 01:18:41,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 257 flow. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 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-08 01:18:41,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:41,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-02-08 01:18:41,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:41,766 INFO L124 PetriNetUnfolderBase]: 911/1349 cut-off events. [2025-02-08 01:18:41,767 INFO L125 PetriNetUnfolderBase]: For 3655/3655 co-relation queries the response was YES. [2025-02-08 01:18:41,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5064 conditions, 1349 events. 911/1349 cut-off events. For 3655/3655 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5512 event pairs, 62 based on Foata normal form. 6/1139 useless extension candidates. Maximal degree in co-relation 5021. Up to 364 conditions per place. [2025-02-08 01:18:41,776 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 161 selfloop transitions, 47 changer transitions 0/209 dead transitions. [2025-02-08 01:18:41,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 209 transitions, 1706 flow [2025-02-08 01:18:41,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 01:18:41,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-08 01:18:41,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 200 transitions. [2025-02-08 01:18:41,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35650623885918004 [2025-02-08 01:18:41,779 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 257 flow. Second operand 17 states and 200 transitions. [2025-02-08 01:18:41,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 209 transitions, 1706 flow [2025-02-08 01:18:41,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 209 transitions, 1532 flow, removed 37 selfloop flow, removed 3 redundant places. [2025-02-08 01:18:41,787 INFO L231 Difference]: Finished difference. Result has 76 places, 95 transitions, 832 flow [2025-02-08 01:18:41,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=832, PETRI_PLACES=76, PETRI_TRANSITIONS=95} [2025-02-08 01:18:41,788 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 44 predicate places. [2025-02-08 01:18:41,789 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 95 transitions, 832 flow [2025-02-08 01:18:41,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 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-08 01:18:41,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:41,789 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:41,799 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-08 01:18:41,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:18:41,990 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:41,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:41,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1464888108, now seen corresponding path program 5 times [2025-02-08 01:18:41,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:41,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071954960] [2025-02-08 01:18:41,992 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:18:41,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:42,002 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-08 01:18:42,019 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:18:42,019 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:18:42,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:42,128 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-08 01:18:42,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:42,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071954960] [2025-02-08 01:18:42,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071954960] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:18:42,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670961431] [2025-02-08 01:18:42,128 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:18:42,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:18:42,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:18:42,134 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-08 01:18:42,137 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-08 01:18:42,193 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-08 01:18:42,220 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:18:42,220 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:18:42,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:42,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 01:18:42,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:18:42,276 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-08 01:18:42,278 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:18:42,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670961431] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:42,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:18:42,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2025-02-08 01:18:42,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610090531] [2025-02-08 01:18:42,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:42,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:18:42,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:42,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:18:42,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:18:42,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-02-08 01:18:42,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 95 transitions, 832 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-08 01:18:42,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:42,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-02-08 01:18:42,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:42,498 INFO L124 PetriNetUnfolderBase]: 914/1365 cut-off events. [2025-02-08 01:18:42,498 INFO L125 PetriNetUnfolderBase]: For 8253/8253 co-relation queries the response was YES. [2025-02-08 01:18:42,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6429 conditions, 1365 events. 914/1365 cut-off events. For 8253/8253 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5339 event pairs, 350 based on Foata normal form. 3/1254 useless extension candidates. Maximal degree in co-relation 6364. Up to 1020 conditions per place. [2025-02-08 01:18:42,508 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 74 selfloop transitions, 54 changer transitions 10/139 dead transitions. [2025-02-08 01:18:42,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 139 transitions, 1411 flow [2025-02-08 01:18:42,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:18:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:18:42,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2025-02-08 01:18:42,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4069264069264069 [2025-02-08 01:18:42,509 INFO L175 Difference]: Start difference. First operand has 76 places, 95 transitions, 832 flow. Second operand 7 states and 94 transitions. [2025-02-08 01:18:42,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 139 transitions, 1411 flow [2025-02-08 01:18:42,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 139 transitions, 1353 flow, removed 24 selfloop flow, removed 1 redundant places. [2025-02-08 01:18:42,526 INFO L231 Difference]: Finished difference. Result has 85 places, 107 transitions, 1101 flow [2025-02-08 01:18:42,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1101, PETRI_PLACES=85, PETRI_TRANSITIONS=107} [2025-02-08 01:18:42,528 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 53 predicate places. [2025-02-08 01:18:42,528 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 107 transitions, 1101 flow [2025-02-08 01:18:42,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-08 01:18:42,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:42,528 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:42,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 01:18:42,729 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-08 01:18:42,730 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:42,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:42,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1907867364, now seen corresponding path program 6 times [2025-02-08 01:18:42,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:42,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926661655] [2025-02-08 01:18:42,732 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:18:42,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:42,754 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-02-08 01:18:42,762 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 22 of 27 statements. [2025-02-08 01:18:42,764 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:18:42,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 01:18:42,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:42,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926661655] [2025-02-08 01:18:42,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926661655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:42,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:42,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:18:42,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562951290] [2025-02-08 01:18:42,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:42,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:18:42,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:42,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:18:42,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:18:42,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-02-08 01:18:42,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 107 transitions, 1101 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:18:42,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:42,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-02-08 01:18:42,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:43,030 INFO L124 PetriNetUnfolderBase]: 927/1383 cut-off events. [2025-02-08 01:18:43,031 INFO L125 PetriNetUnfolderBase]: For 9823/9823 co-relation queries the response was YES. [2025-02-08 01:18:43,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7168 conditions, 1383 events. 927/1383 cut-off events. For 9823/9823 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5524 event pairs, 351 based on Foata normal form. 2/1271 useless extension candidates. Maximal degree in co-relation 7098. Up to 1039 conditions per place. [2025-02-08 01:18:43,040 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 97 selfloop transitions, 34 changer transitions 10/142 dead transitions. [2025-02-08 01:18:43,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 142 transitions, 1580 flow [2025-02-08 01:18:43,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:18:43,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:18:43,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-02-08 01:18:43,041 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-02-08 01:18:43,041 INFO L175 Difference]: Start difference. First operand has 85 places, 107 transitions, 1101 flow. Second operand 6 states and 88 transitions. [2025-02-08 01:18:43,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 142 transitions, 1580 flow [2025-02-08 01:18:43,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 142 transitions, 1378 flow, removed 53 selfloop flow, removed 6 redundant places. [2025-02-08 01:18:43,059 INFO L231 Difference]: Finished difference. Result has 83 places, 108 transitions, 1000 flow [2025-02-08 01:18:43,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1000, PETRI_PLACES=83, PETRI_TRANSITIONS=108} [2025-02-08 01:18:43,061 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 51 predicate places. [2025-02-08 01:18:43,061 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 108 transitions, 1000 flow [2025-02-08 01:18:43,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:18:43,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:43,061 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:43,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:18:43,061 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:43,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:43,061 INFO L85 PathProgramCache]: Analyzing trace with hash 637596144, now seen corresponding path program 7 times [2025-02-08 01:18:43,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:43,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839387580] [2025-02-08 01:18:43,062 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:18:43,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:43,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 01:18:43,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:18:43,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:18:43,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:43,213 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-08 01:18:43,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:43,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839387580] [2025-02-08 01:18:43,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839387580] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:18:43,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068581299] [2025-02-08 01:18:43,214 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:18:43,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:18:43,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:18:43,219 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-08 01:18:43,222 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-08 01:18:43,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 01:18:43,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:18:43,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:18:43,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:43,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 01:18:43,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:18:43,372 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-08 01:18:43,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:18:43,437 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-08 01:18:43,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068581299] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:18:43,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:18:43,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 14 [2025-02-08 01:18:43,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361125463] [2025-02-08 01:18:43,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:43,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:18:43,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:43,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:18:43,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-02-08 01:18:43,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-02-08 01:18:43,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 108 transitions, 1000 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-08 01:18:43,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:43,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-02-08 01:18:43,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:43,633 INFO L124 PetriNetUnfolderBase]: 887/1303 cut-off events. [2025-02-08 01:18:43,633 INFO L125 PetriNetUnfolderBase]: For 7596/7596 co-relation queries the response was YES. [2025-02-08 01:18:43,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6308 conditions, 1303 events. 887/1303 cut-off events. For 7596/7596 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4897 event pairs, 286 based on Foata normal form. 14/1203 useless extension candidates. Maximal degree in co-relation 6264. Up to 703 conditions per place. [2025-02-08 01:18:43,640 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 74 selfloop transitions, 56 changer transitions 0/131 dead transitions. [2025-02-08 01:18:43,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 131 transitions, 1350 flow [2025-02-08 01:18:43,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:18:43,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:18:43,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2025-02-08 01:18:43,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37662337662337664 [2025-02-08 01:18:43,641 INFO L175 Difference]: Start difference. First operand has 83 places, 108 transitions, 1000 flow. Second operand 7 states and 87 transitions. [2025-02-08 01:18:43,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 131 transitions, 1350 flow [2025-02-08 01:18:43,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 131 transitions, 1252 flow, removed 16 selfloop flow, removed 4 redundant places. [2025-02-08 01:18:43,654 INFO L231 Difference]: Finished difference. Result has 83 places, 106 transitions, 1009 flow [2025-02-08 01:18:43,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1009, PETRI_PLACES=83, PETRI_TRANSITIONS=106} [2025-02-08 01:18:43,654 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 51 predicate places. [2025-02-08 01:18:43,655 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 106 transitions, 1009 flow [2025-02-08 01:18:43,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-08 01:18:43,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:43,655 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:43,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 01:18:43,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:18:43,859 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:43,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:43,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1638424930, now seen corresponding path program 1 times [2025-02-08 01:18:43,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:43,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310334954] [2025-02-08 01:18:43,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:18:43,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:43,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 01:18:43,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 01:18:43,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:18:43,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:45,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:18:45,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:45,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310334954] [2025-02-08 01:18:45,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310334954] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:18:45,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114058075] [2025-02-08 01:18:45,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:18:45,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:18:45,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:18:45,017 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:18:45,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 01:18:45,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 01:18:45,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 01:18:45,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:18:45,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:45,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-02-08 01:18:45,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:18:45,131 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-08 01:18:45,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 01:18:45,196 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 01:18:45,196 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 17 treesize of output 21 [2025-02-08 01:18:45,226 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-08 01:18:45,270 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-02-08 01:18:45,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-02-08 01:18:45,315 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 8 treesize of output 1 [2025-02-08 01:18:45,347 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-02-08 01:18:45,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2025-02-08 01:18:45,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 01:18:45,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 36 [2025-02-08 01:18:45,714 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-02-08 01:18:45,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 62 [2025-02-08 01:18:46,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:18:46,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:19:27,676 WARN L851 $PredicateComparison]: unable to prove that (forall ((~C2~0.offset Int) (v_thread3Thread1of1ForFork2_~i~2_24 Int) (v_ArrVal_285 (Array Int Int)) (~C1~0.offset Int) (|v_ULTIMATE.start_main_~k~0#1_61| Int)) (or (< c_~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_24 1)) (< |v_ULTIMATE.start_main_~k~0#1_61| 0) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (let ((.cse3 (* v_thread3Thread1of1ForFork2_~i~2_24 4))) (store v_ArrVal_285 (+ ~C2~0.offset .cse3) (let ((.cse4 (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| v_ArrVal_285))) (+ (select (select .cse4 c_~A~0.base) (+ c_~A~0.offset .cse3)) (select (select .cse4 c_~B~0.base) (+ .cse3 c_~B~0.offset))))))))) (let ((.cse0 (store (select .cse2 c_~C1~0.base) ~C1~0.offset (+ (select (select .cse2 c_~B~0.base) c_~B~0.offset) (select (select .cse2 c_~A~0.base) c_~A~0.offset)))) (.cse1 (* 4 |v_ULTIMATE.start_main_~k~0#1_61|))) (= (mod (select .cse0 (+ .cse1 ~C1~0.offset)) 4294967296) (mod (select (select (store .cse2 c_~C1~0.base .cse0) |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (+ .cse1 ~C2~0.offset)) 4294967296)))) (< v_thread3Thread1of1ForFork2_~i~2_24 0) (< c_~N~0 (+ |v_ULTIMATE.start_main_~k~0#1_61| 1)))) is different from false [2025-02-08 01:19:28,998 INFO L349 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2025-02-08 01:19:28,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1024 treesize of output 387 [2025-02-08 01:19:29,004 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:19:29,005 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:19:29,005 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:19:29,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:19:29,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1228 treesize of output 1018 [2025-02-08 01:19:29,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:19:29,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 460 treesize of output 404 [2025-02-08 01:19:29,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:19:29,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 554 treesize of output 502 [2025-02-08 01:19:34,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 2 times theorem prover too weak. 0 trivial. 1 not checked. [2025-02-08 01:19:34,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114058075] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:19:34,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:19:34,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 36 [2025-02-08 01:19:34,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851272136] [2025-02-08 01:19:34,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:19:34,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-08 01:19:34,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:34,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-08 01:19:34,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1104, Unknown=26, NotChecked=68, Total=1332 [2025-02-08 01:19:34,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-02-08 01:19:34,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 106 transitions, 1009 flow. Second operand has 37 states, 37 states have (on average 6.1891891891891895) internal successors, (229), 37 states have internal predecessors, (229), 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-08 01:19:34,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:34,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-02-08 01:19:34,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:53,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 01:19:57,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 01:20:12,317 INFO L124 PetriNetUnfolderBase]: 1953/2866 cut-off events. [2025-02-08 01:20:12,317 INFO L125 PetriNetUnfolderBase]: For 13293/13293 co-relation queries the response was YES. [2025-02-08 01:20:12,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13062 conditions, 2866 events. 1953/2866 cut-off events. For 13293/13293 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 12577 event pairs, 536 based on Foata normal form. 2/2583 useless extension candidates. Maximal degree in co-relation 12202. Up to 1297 conditions per place. [2025-02-08 01:20:12,342 INFO L140 encePairwiseOnDemand]: 17/33 looper letters, 193 selfloop transitions, 87 changer transitions 45/326 dead transitions. [2025-02-08 01:20:12,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 326 transitions, 3449 flow [2025-02-08 01:20:12,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 01:20:12,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-02-08 01:20:12,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 252 transitions. [2025-02-08 01:20:12,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3181818181818182 [2025-02-08 01:20:12,348 INFO L175 Difference]: Start difference. First operand has 83 places, 106 transitions, 1009 flow. Second operand 24 states and 252 transitions. [2025-02-08 01:20:12,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 326 transitions, 3449 flow [2025-02-08 01:20:12,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 326 transitions, 3288 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-02-08 01:20:12,383 INFO L231 Difference]: Finished difference. Result has 116 places, 185 transitions, 2117 flow [2025-02-08 01:20:12,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2117, PETRI_PLACES=116, PETRI_TRANSITIONS=185} [2025-02-08 01:20:12,385 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 84 predicate places. [2025-02-08 01:20:12,385 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 185 transitions, 2117 flow [2025-02-08 01:20:12,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 6.1891891891891895) internal successors, (229), 37 states have internal predecessors, (229), 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-08 01:20:12,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:12,386 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:20:12,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 01:20:12,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 01:20:12,590 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:20:12,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:12,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1759517970, now seen corresponding path program 2 times [2025-02-08 01:20:12,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:12,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278836877] [2025-02-08 01:20:12,591 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:20:12,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:12,599 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-08 01:20:12,671 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 01:20:12,671 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:20:12,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:13,683 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:20:13,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:13,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278836877] [2025-02-08 01:20:13,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278836877] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:20:13,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824459973] [2025-02-08 01:20:13,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:20:13,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:20:13,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:20:13,686 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:20:13,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 01:20:13,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-08 01:20:13,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 01:20:13,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:20:13,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:13,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-08 01:20:13,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:20:13,789 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-08 01:20:13,849 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 01:20:13,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-08 01:20:13,913 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2025-02-08 01:20:13,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2025-02-08 01:20:14,013 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2025-02-08 01:20:14,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2025-02-08 01:20:14,381 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 01:20:14,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2025-02-08 01:20:14,628 INFO L349 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2025-02-08 01:20:14,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 56 [2025-02-08 01:20:14,829 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:20:14,829 INFO L312 TraceCheckSpWp]: Computing backward predicates...