./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_priority_queue_clean_up_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/aws-c-common/aws_priority_queue_clean_up_harness.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash d03ab2f374c74d452a3d10e43faf5dd107aad5d480e09c302467ee543678a603 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:54:43,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:54:43,365 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 01:54:43,369 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:54:43,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:54:43,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:54:43,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:54:43,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:54:43,384 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:54:43,384 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:54:43,384 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:54:43,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:54:43,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:54:43,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:54:43,385 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:54:43,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:54:43,385 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:54:43,385 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:54:43,385 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:54:43,385 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:54:43,385 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:54:43,385 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:54:43,386 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:54:43,386 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:54:43,386 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:54:43,386 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:54:43,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:54:43,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:54:43,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:54:43,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:54:43,386 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:54:43,386 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:54:43,387 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:54:43,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:54:43,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:54:43,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:54:43,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:54:43,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:54:43,387 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:54:43,387 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:54:43,387 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d03ab2f374c74d452a3d10e43faf5dd107aad5d480e09c302467ee543678a603 [2025-02-08 01:54:43,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:54:43,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:54:43,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:54:43,611 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:54:43,611 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:54:43,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_priority_queue_clean_up_harness.i [2025-02-08 01:54:44,778 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77ca10dd7/376a9e226a6f4afd9cad0a17332f496e/FLAG3c6bc1eef [2025-02-08 01:54:45,183 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:54:45,183 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_clean_up_harness.i [2025-02-08 01:54:45,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77ca10dd7/376a9e226a6f4afd9cad0a17332f496e/FLAG3c6bc1eef [2025-02-08 01:54:45,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77ca10dd7/376a9e226a6f4afd9cad0a17332f496e [2025-02-08 01:54:45,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:54:45,357 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:54:45,363 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:54:45,363 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:54:45,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:54:45,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:54:45" (1/1) ... [2025-02-08 01:54:45,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64a4e0ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:45, skipping insertion in model container [2025-02-08 01:54:45,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:54:45" (1/1) ... [2025-02-08 01:54:45,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:54:45,664 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/aws-c-common/aws_priority_queue_clean_up_harness.i[4501,4514] [2025-02-08 01:54:45,671 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/aws-c-common/aws_priority_queue_clean_up_harness.i[4561,4574] [2025-02-08 01:54:46,203 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,205 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,205 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,205 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,206 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,216 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,217 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,218 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,218 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,545 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,549 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:54:46,612 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:54:46,621 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/aws-c-common/aws_priority_queue_clean_up_harness.i[4501,4514] [2025-02-08 01:54:46,621 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/aws-c-common/aws_priority_queue_clean_up_harness.i[4561,4574] [2025-02-08 01:54:46,653 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,653 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,654 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,654 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,654 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,660 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,660 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,664 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,665 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,745 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,746 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:46,749 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7703-7714] [2025-02-08 01:54:46,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:54:46,900 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:54:46,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:46 WrapperNode [2025-02-08 01:54:46,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:54:46,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:54:46,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:54:46,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:54:46,905 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:54:46" (1/1) ... [2025-02-08 01:54:46,948 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:54:46" (1/1) ... [2025-02-08 01:54:46,981 INFO L138 Inliner]: procedures = 678, calls = 1509, calls flagged for inlining = 54, calls inlined = 9, statements flattened = 621 [2025-02-08 01:54:46,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:54:46,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:54:46,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:54:46,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:54:46,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:46" (1/1) ... [2025-02-08 01:54:46,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:46" (1/1) ... [2025-02-08 01:54:46,995 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:46" (1/1) ... [2025-02-08 01:54:47,034 INFO L175 MemorySlicer]: Split 296 memory accesses to 5 slices as follows [2, 238, 3, 47, 6]. 80 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 6, 1, 0, 5]. The 251 writes are split as follows [0, 232, 1, 18, 0]. [2025-02-08 01:54:47,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:46" (1/1) ... [2025-02-08 01:54:47,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:46" (1/1) ... [2025-02-08 01:54:47,052 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:46" (1/1) ... [2025-02-08 01:54:47,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:46" (1/1) ... [2025-02-08 01:54:47,062 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:46" (1/1) ... [2025-02-08 01:54:47,067 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:46" (1/1) ... [2025-02-08 01:54:47,075 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:54:47,078 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:54:47,078 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:54:47,078 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:54:47,079 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:46" (1/1) ... [2025-02-08 01:54:47,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:54:47,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:54:47,102 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:54:47,105 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:54:47,122 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2025-02-08 01:54:47,122 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2025-02-08 01:54:47,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 01:54:47,122 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2025-02-08 01:54:47,122 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2025-02-08 01:54:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2025-02-08 01:54:47,123 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2025-02-08 01:54:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-02-08 01:54:47,123 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-02-08 01:54:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-08 01:54:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-08 01:54:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-08 01:54:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-08 01:54:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-08 01:54:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:54:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:54:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 01:54:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 01:54:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 01:54:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-02-08 01:54:47,124 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-02-08 01:54:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 01:54:47,124 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 01:54:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:54:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:54:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 01:54:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 01:54:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 01:54:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 01:54:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 01:54:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:54:47,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:54:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_clean_up [2025-02-08 01:54:47,124 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_clean_up [2025-02-08 01:54:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-02-08 01:54:47,124 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-02-08 01:54:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2025-02-08 01:54:47,124 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2025-02-08 01:54:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-02-08 01:54:47,124 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-02-08 01:54:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-08 01:54:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-08 01:54:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-08 01:54:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-08 01:54:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-08 01:54:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure aws_priority_queue_is_valid [2025-02-08 01:54:47,124 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_priority_queue_is_valid [2025-02-08 01:54:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2025-02-08 01:54:47,124 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2025-02-08 01:54:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 01:54:47,124 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 01:54:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 01:54:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 01:54:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 01:54:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 01:54:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 01:54:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 01:54:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 01:54:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 01:54:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 01:54:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 01:54:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-08 01:54:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-02-08 01:54:47,125 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-02-08 01:54:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-02-08 01:54:47,125 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-02-08 01:54:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:54:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:54:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 01:54:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 01:54:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 01:54:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure memset_impl [2025-02-08 01:54:47,125 INFO L138 BoogieDeclarations]: Found implementation of procedure memset_impl [2025-02-08 01:54:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure my_memset [2025-02-08 01:54:47,125 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memset [2025-02-08 01:54:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2025-02-08 01:54:47,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2025-02-08 01:54:47,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:54:47,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:54:47,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 01:54:47,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 01:54:47,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 01:54:47,364 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:54:47,366 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:54:47,432 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc #t~malloc77.base, #t~malloc77.offset; [2025-02-08 01:54:47,434 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc #t~nondet6; [2025-02-08 01:54:47,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588: havoc #t~ret57#1; [2025-02-08 01:54:47,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7341: havoc #t~ret656.base, #t~ret656.offset; [2025-02-08 01:54:47,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7494: havoc aws_priority_queue_backpointers_valid_#t~ret686#1;havoc aws_priority_queue_backpointers_valid_#t~short687#1; [2025-02-08 01:54:47,615 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3268: call ULTIMATE.dealloc(~#required_size~0.base, ~#required_size~0.offset);havoc ~#required_size~0.base, ~#required_size~0.offset; [2025-02-08 01:54:47,619 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-02-08 01:54:52,915 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2025-02-08 01:54:52,915 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:54:52,922 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:54:52,922 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:54:52,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:54:52 BoogieIcfgContainer [2025-02-08 01:54:52,923 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:54:52,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:54:52,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:54:52,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:54:52,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:54:45" (1/3) ... [2025-02-08 01:54:52,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ca87f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:54:52, skipping insertion in model container [2025-02-08 01:54:52,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:46" (2/3) ... [2025-02-08 01:54:52,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ca87f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:54:52, skipping insertion in model container [2025-02-08 01:54:52,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:54:52" (3/3) ... [2025-02-08 01:54:52,929 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_priority_queue_clean_up_harness.i [2025-02-08 01:54:52,938 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:54:52,939 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_priority_queue_clean_up_harness.i that has 19 procedures, 172 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-08 01:54:52,972 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:54:52,980 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;@6c62a423, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:54:52,980 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 01:54:52,983 INFO L276 IsEmpty]: Start isEmpty. Operand has 172 states, 110 states have (on average 1.2636363636363637) internal successors, (139), 113 states have internal predecessors, (139), 41 states have call successors, (41), 18 states have call predecessors, (41), 18 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-08 01:54:52,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-08 01:54:52,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:54:52,991 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:54:52,991 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:54:52,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:54:52,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1908461333, now seen corresponding path program 1 times [2025-02-08 01:54:52,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:54:52,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529034829] [2025-02-08 01:54:53,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:54:53,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:54:57,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-08 01:54:57,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-08 01:54:57,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:54:57,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:54:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-08 01:54:57,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:54:57,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529034829] [2025-02-08 01:54:57,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529034829] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:54:57,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623454693] [2025-02-08 01:54:57,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:54:57,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:54:57,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:54:57,936 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:54:57,937 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:55:02,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-08 01:55:02,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-08 01:55:02,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:02,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:02,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 4389 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 01:55:02,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:55:02,818 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-08 01:55:02,818 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:55:02,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623454693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:55:02,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:55:02,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-08 01:55:02,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249930345] [2025-02-08 01:55:02,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:55:02,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:55:02,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:55:02,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:55:02,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:55:02,850 INFO L87 Difference]: Start difference. First operand has 172 states, 110 states have (on average 1.2636363636363637) internal successors, (139), 113 states have internal predecessors, (139), 41 states have call successors, (41), 18 states have call predecessors, (41), 18 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-08 01:55:02,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:55:02,886 INFO L93 Difference]: Finished difference Result 320 states and 429 transitions. [2025-02-08 01:55:02,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:55:02,888 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2025-02-08 01:55:02,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:55:02,893 INFO L225 Difference]: With dead ends: 320 [2025-02-08 01:55:02,893 INFO L226 Difference]: Without dead ends: 163 [2025-02-08 01:55:02,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:55:02,900 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:55:02,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:55:02,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-08 01:55:02,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-02-08 01:55:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 107 states have internal predecessors, (129), 40 states have call successors, (40), 17 states have call predecessors, (40), 17 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-08 01:55:02,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 208 transitions. [2025-02-08 01:55:02,939 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 208 transitions. Word has length 129 [2025-02-08 01:55:02,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:55:02,940 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 208 transitions. [2025-02-08 01:55:02,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-08 01:55:02,940 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 208 transitions. [2025-02-08 01:55:02,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-08 01:55:02,946 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:55:02,947 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:55:02,961 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:55:03,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-08 01:55:03,148 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:55:03,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:55:03,149 INFO L85 PathProgramCache]: Analyzing trace with hash 553380941, now seen corresponding path program 1 times [2025-02-08 01:55:03,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:55:03,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560643476] [2025-02-08 01:55:03,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:03,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:55:07,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-08 01:55:07,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-08 01:55:07,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:07,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:08,210 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-02-08 01:55:08,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:55:08,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560643476] [2025-02-08 01:55:08,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560643476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:55:08,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:55:08,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:55:08,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146465111] [2025-02-08 01:55:08,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:55:08,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:55:08,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:55:08,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:55:08,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:55:08,215 INFO L87 Difference]: Start difference. First operand 163 states and 208 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-08 01:55:08,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:55:08,616 INFO L93 Difference]: Finished difference Result 250 states and 316 transitions. [2025-02-08 01:55:08,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:55:08,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 147 [2025-02-08 01:55:08,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:55:08,621 INFO L225 Difference]: With dead ends: 250 [2025-02-08 01:55:08,623 INFO L226 Difference]: Without dead ends: 163 [2025-02-08 01:55:08,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:55:08,624 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 6 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 01:55:08,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 755 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 01:55:08,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-08 01:55:08,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-02-08 01:55:08,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 105 states have (on average 1.2190476190476192) internal successors, (128), 107 states have internal predecessors, (128), 40 states have call successors, (40), 17 states have call predecessors, (40), 17 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-08 01:55:08,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 207 transitions. [2025-02-08 01:55:08,636 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 207 transitions. Word has length 147 [2025-02-08 01:55:08,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:55:08,636 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 207 transitions. [2025-02-08 01:55:08,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-08 01:55:08,637 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 207 transitions. [2025-02-08 01:55:08,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-08 01:55:08,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:55:08,638 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:08,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:55:08,638 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:55:08,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:55:08,639 INFO L85 PathProgramCache]: Analyzing trace with hash -478904507, now seen corresponding path program 1 times [2025-02-08 01:55:08,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:55:08,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851909648] [2025-02-08 01:55:08,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:08,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:55:12,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-08 01:55:12,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-08 01:55:12,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:12,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-02-08 01:55:13,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:55:13,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851909648] [2025-02-08 01:55:13,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851909648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:55:13,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:55:13,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:55:13,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711613814] [2025-02-08 01:55:13,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:55:13,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:55:13,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:55:13,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:55:13,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:55:13,707 INFO L87 Difference]: Start difference. First operand 163 states and 207 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-08 01:55:14,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:55:14,888 INFO L93 Difference]: Finished difference Result 269 states and 345 transitions. [2025-02-08 01:55:14,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:55:14,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 155 [2025-02-08 01:55:14,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:55:14,896 INFO L225 Difference]: With dead ends: 269 [2025-02-08 01:55:14,896 INFO L226 Difference]: Without dead ends: 165 [2025-02-08 01:55:14,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:55:14,899 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 33 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:55:14,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1085 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 01:55:14,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-08 01:55:14,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-02-08 01:55:14,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 106 states have (on average 1.2169811320754718) internal successors, (129), 109 states have internal predecessors, (129), 40 states have call successors, (40), 17 states have call predecessors, (40), 18 states have return successors, (41), 39 states have call predecessors, (41), 39 states have call successors, (41) [2025-02-08 01:55:14,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 210 transitions. [2025-02-08 01:55:14,916 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 210 transitions. Word has length 155 [2025-02-08 01:55:14,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:55:14,916 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 210 transitions. [2025-02-08 01:55:14,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-08 01:55:14,917 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 210 transitions. [2025-02-08 01:55:14,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-08 01:55:14,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:55:14,918 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:55:14,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:55:14,922 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:55:14,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:55:14,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1382166187, now seen corresponding path program 1 times [2025-02-08 01:55:14,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:55:14,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83729236] [2025-02-08 01:55:14,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:14,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:55:18,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-08 01:55:18,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-08 01:55:18,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:18,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:20,112 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-02-08 01:55:20,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:55:20,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83729236] [2025-02-08 01:55:20,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83729236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:55:20,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:55:20,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:55:20,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604859777] [2025-02-08 01:55:20,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:55:20,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:55:20,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:55:20,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:55:20,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:55:20,114 INFO L87 Difference]: Start difference. First operand 165 states and 210 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2025-02-08 01:55:20,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:55:20,886 INFO L93 Difference]: Finished difference Result 255 states and 321 transitions. [2025-02-08 01:55:20,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:55:20,887 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) Word has length 169 [2025-02-08 01:55:20,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:55:20,890 INFO L225 Difference]: With dead ends: 255 [2025-02-08 01:55:20,891 INFO L226 Difference]: Without dead ends: 165 [2025-02-08 01:55:20,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:55:20,892 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 23 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 01:55:20,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 898 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 01:55:20,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-08 01:55:20,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-02-08 01:55:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 106 states have (on average 1.2075471698113207) internal successors, (128), 109 states have internal predecessors, (128), 40 states have call successors, (40), 17 states have call predecessors, (40), 18 states have return successors, (41), 39 states have call predecessors, (41), 39 states have call successors, (41) [2025-02-08 01:55:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 209 transitions. [2025-02-08 01:55:20,909 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 209 transitions. Word has length 169 [2025-02-08 01:55:20,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:55:20,909 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 209 transitions. [2025-02-08 01:55:20,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2025-02-08 01:55:20,909 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 209 transitions. [2025-02-08 01:55:20,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-08 01:55:20,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:55:20,914 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:20,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:55:20,915 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:55:20,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:55:20,915 INFO L85 PathProgramCache]: Analyzing trace with hash -510051579, now seen corresponding path program 1 times [2025-02-08 01:55:20,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:55:20,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454190841] [2025-02-08 01:55:20,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:20,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:55:24,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-08 01:55:24,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-08 01:55:24,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:24,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:26,099 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-02-08 01:55:26,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:55:26,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454190841] [2025-02-08 01:55:26,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454190841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:55:26,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:55:26,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:55:26,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930191370] [2025-02-08 01:55:26,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:55:26,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:55:26,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:55:26,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:55:26,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:55:26,100 INFO L87 Difference]: Start difference. First operand 165 states and 209 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 5 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (27), 5 states have call predecessors, (27), 5 states have call successors, (27) [2025-02-08 01:55:27,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:55:27,838 INFO L93 Difference]: Finished difference Result 268 states and 339 transitions. [2025-02-08 01:55:27,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:55:27,839 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 5 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (27), 5 states have call predecessors, (27), 5 states have call successors, (27) Word has length 185 [2025-02-08 01:55:27,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:55:27,846 INFO L225 Difference]: With dead ends: 268 [2025-02-08 01:55:27,846 INFO L226 Difference]: Without dead ends: 165 [2025-02-08 01:55:27,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:55:27,847 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 55 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-08 01:55:27,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1200 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-08 01:55:27,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-08 01:55:27,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-02-08 01:55:27,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 106 states have (on average 1.2075471698113207) internal successors, (128), 109 states have internal predecessors, (128), 40 states have call successors, (40), 17 states have call predecessors, (40), 18 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-02-08 01:55:27,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 208 transitions. [2025-02-08 01:55:27,870 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 208 transitions. Word has length 185 [2025-02-08 01:55:27,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:55:27,874 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 208 transitions. [2025-02-08 01:55:27,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 5 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (27), 5 states have call predecessors, (27), 5 states have call successors, (27) [2025-02-08 01:55:27,874 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 208 transitions. [2025-02-08 01:55:27,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-08 01:55:27,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:55:27,880 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:55:27,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:55:27,880 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:55:27,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:55:27,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2074458209, now seen corresponding path program 1 times [2025-02-08 01:55:27,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:55:27,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170635212] [2025-02-08 01:55:27,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:27,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:55:31,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-08 01:55:31,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-08 01:55:31,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:31,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:33,158 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-02-08 01:55:33,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:55:33,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170635212] [2025-02-08 01:55:33,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170635212] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:55:33,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:55:33,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:55:33,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792749649] [2025-02-08 01:55:33,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:55:33,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:55:33,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:55:33,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:55:33,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:55:33,160 INFO L87 Difference]: Start difference. First operand 165 states and 208 transitions. Second operand has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2025-02-08 01:55:33,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:55:33,552 INFO L93 Difference]: Finished difference Result 255 states and 319 transitions. [2025-02-08 01:55:33,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:55:33,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) Word has length 199 [2025-02-08 01:55:33,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:55:33,554 INFO L225 Difference]: With dead ends: 255 [2025-02-08 01:55:33,554 INFO L226 Difference]: Without dead ends: 165 [2025-02-08 01:55:33,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:55:33,556 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 6 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 01:55:33,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 988 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 01:55:33,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-08 01:55:33,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-02-08 01:55:33,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 106 states have (on average 1.1981132075471699) internal successors, (127), 109 states have internal predecessors, (127), 40 states have call successors, (40), 17 states have call predecessors, (40), 18 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-02-08 01:55:33,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 207 transitions. [2025-02-08 01:55:33,563 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 207 transitions. Word has length 199 [2025-02-08 01:55:33,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:55:33,564 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 207 transitions. [2025-02-08 01:55:33,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2025-02-08 01:55:33,564 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 207 transitions. [2025-02-08 01:55:33,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-02-08 01:55:33,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:55:33,565 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:55:33,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:55:33,565 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:55:33,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:55:33,566 INFO L85 PathProgramCache]: Analyzing trace with hash -271072561, now seen corresponding path program 1 times [2025-02-08 01:55:33,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:55:33,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376802859] [2025-02-08 01:55:33,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:33,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:55:37,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-08 01:55:37,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-08 01:55:37,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:37,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:39,311 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 01:55:39,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:55:39,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376802859] [2025-02-08 01:55:39,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376802859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:55:39,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:55:39,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:55:39,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708085773] [2025-02-08 01:55:39,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:55:39,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:55:39,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:55:39,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:55:39,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:55:39,320 INFO L87 Difference]: Start difference. First operand 165 states and 207 transitions. Second operand has 6 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-08 01:55:43,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:55:44,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:55:44,271 INFO L93 Difference]: Finished difference Result 175 states and 221 transitions. [2025-02-08 01:55:44,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:55:44,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) Word has length 200 [2025-02-08 01:55:44,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:55:44,274 INFO L225 Difference]: With dead ends: 175 [2025-02-08 01:55:44,274 INFO L226 Difference]: Without dead ends: 173 [2025-02-08 01:55:44,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:55:44,274 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 3 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-02-08 01:55:44,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1005 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2025-02-08 01:55:44,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-08 01:55:44,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2025-02-08 01:55:44,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 110 states have (on average 1.190909090909091) internal successors, (131), 114 states have internal predecessors, (131), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (46), 40 states have call predecessors, (46), 40 states have call successors, (46) [2025-02-08 01:55:44,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 218 transitions. [2025-02-08 01:55:44,285 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 218 transitions. Word has length 200 [2025-02-08 01:55:44,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:55:44,285 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 218 transitions. [2025-02-08 01:55:44,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-08 01:55:44,286 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 218 transitions. [2025-02-08 01:55:44,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-08 01:55:44,288 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:55:44,289 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:55:44,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:55:44,289 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:55:44,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:55:44,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1568920803, now seen corresponding path program 1 times [2025-02-08 01:55:44,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:55:44,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405026903] [2025-02-08 01:55:44,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:44,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:55:47,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-08 01:55:49,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-08 01:55:49,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:49,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:50,630 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-08 01:55:50,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:55:50,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405026903] [2025-02-08 01:55:50,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405026903] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:55:50,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68321058] [2025-02-08 01:55:50,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:50,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:55:50,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:55:50,636 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:55:50,637 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:55:55,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-08 01:55:55,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-08 01:55:55,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:55,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:55,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 4850 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 01:55:55,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:55:57,011 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-02-08 01:55:57,011 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:55:57,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68321058] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:55:57,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:55:57,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-02-08 01:55:57,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871780538] [2025-02-08 01:55:57,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:55:57,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:55:57,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:55:57,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:55:57,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:55:57,013 INFO L87 Difference]: Start difference. First operand 172 states and 218 transitions. Second operand has 7 states, 6 states have (on average 14.666666666666666) internal successors, (88), 7 states have internal predecessors, (88), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2025-02-08 01:55:57,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:55:57,543 INFO L93 Difference]: Finished difference Result 270 states and 340 transitions. [2025-02-08 01:55:57,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:55:57,546 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.666666666666666) internal successors, (88), 7 states have internal predecessors, (88), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) Word has length 201 [2025-02-08 01:55:57,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:55:57,548 INFO L225 Difference]: With dead ends: 270 [2025-02-08 01:55:57,548 INFO L226 Difference]: Without dead ends: 173 [2025-02-08 01:55:57,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:55:57,549 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 6 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 01:55:57,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 988 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 01:55:57,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-08 01:55:57,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-02-08 01:55:57,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 111 states have (on average 1.1891891891891893) internal successors, (132), 115 states have internal predecessors, (132), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (46), 40 states have call predecessors, (46), 40 states have call successors, (46) [2025-02-08 01:55:57,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 219 transitions. [2025-02-08 01:55:57,563 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 219 transitions. Word has length 201 [2025-02-08 01:55:57,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:55:57,564 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 219 transitions. [2025-02-08 01:55:57,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.666666666666666) internal successors, (88), 7 states have internal predecessors, (88), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2025-02-08 01:55:57,564 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 219 transitions. [2025-02-08 01:55:57,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-08 01:55:57,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:55:57,568 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:55:57,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 01:55:57,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:55:57,768 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:55:57,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:55:57,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1999070031, now seen corresponding path program 1 times [2025-02-08 01:55:57,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:55:57,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697514222] [2025-02-08 01:55:57,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:57,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:56:01,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-08 01:56:02,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-08 01:56:02,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:56:02,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat