./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_priority_queue_clean_up_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_priority_queue_clean_up_harness_negated.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c76aa584f17d1e33f139a1a167c9edf580611a597c58d41f9a3cf9cc11662c3e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 03:01:16,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 03:01:16,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 03:01:16,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 03:01:16,182 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 03:01:16,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 03:01:16,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 03:01:16,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 03:01:16,199 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 03:01:16,200 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 03:01:16,200 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 03:01:16,200 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 03:01:16,200 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 03:01:16,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 03:01:16,201 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 03:01:16,201 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 03:01:16,201 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 03:01:16,201 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 03:01:16,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 03:01:16,202 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 03:01:16,202 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 03:01:16,202 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 03:01:16,202 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 03:01:16,202 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 03:01:16,202 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 03:01:16,202 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 03:01:16,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 03:01:16,202 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 03:01:16,202 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 03:01:16,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:01:16,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 03:01:16,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 03:01:16,203 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 03:01:16,203 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 03:01:16,203 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 03:01:16,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 03:01:16,204 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 03:01:16,204 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 03:01:16,204 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 03:01:16,204 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 03:01:16,204 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c76aa584f17d1e33f139a1a167c9edf580611a597c58d41f9a3cf9cc11662c3e [2025-03-04 03:01:16,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 03:01:16,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 03:01:16,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 03:01:16,441 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 03:01:16,441 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 03:01:16,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_priority_queue_clean_up_harness_negated.i [2025-03-04 03:01:17,576 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a72418255/5a83d387c943436684a7019d7177d7ab/FLAG0756fe94a [2025-03-04 03:01:18,028 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 03:01:18,028 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_clean_up_harness_negated.i [2025-03-04 03:01:18,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a72418255/5a83d387c943436684a7019d7177d7ab/FLAG0756fe94a [2025-03-04 03:01:18,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a72418255/5a83d387c943436684a7019d7177d7ab [2025-03-04 03:01:18,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 03:01:18,080 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 03:01:18,081 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 03:01:18,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 03:01:18,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 03:01:18,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:01:18" (1/1) ... [2025-03-04 03:01:18,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ef39128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:18, skipping insertion in model container [2025-03-04 03:01:18,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:01:18" (1/1) ... [2025-03-04 03:01:18,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 03:01:18,313 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_clean_up_harness_negated.i[4501,4514] [2025-03-04 03:01:18,320 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_clean_up_harness_negated.i[4561,4574] [2025-03-04 03:01:18,794 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:18,795 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:18,795 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:18,796 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:18,796 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:18,812 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:18,813 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:18,814 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:18,814 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:19,136 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:19,138 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:19,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:01:19,205 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 03:01:19,220 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_clean_up_harness_negated.i[4501,4514] [2025-03-04 03:01:19,220 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_clean_up_harness_negated.i[4561,4574] [2025-03-04 03:01:19,266 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:19,266 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:19,266 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:19,267 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:19,267 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:19,271 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:19,271 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:19,272 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:19,272 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:19,353 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:19,354 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:01:19,357 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7671-7682] [2025-03-04 03:01:19,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:01:19,517 INFO L204 MainTranslator]: Completed translation [2025-03-04 03:01:19,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:19 WrapperNode [2025-03-04 03:01:19,518 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 03:01:19,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 03:01:19,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 03:01:19,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 03:01:19,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:19" (1/1) ... [2025-03-04 03:01:19,569 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:19" (1/1) ... [2025-03-04 03:01:19,615 INFO L138 Inliner]: procedures = 678, calls = 1509, calls flagged for inlining = 54, calls inlined = 9, statements flattened = 621 [2025-03-04 03:01:19,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 03:01:19,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 03:01:19,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 03:01:19,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 03:01:19,625 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:19" (1/1) ... [2025-03-04 03:01:19,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:19" (1/1) ... [2025-03-04 03:01:19,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:19" (1/1) ... [2025-03-04 03:01:19,690 INFO L175 MemorySlicer]: Split 296 memory accesses to 5 slices as follows [2, 3, 238, 6, 47]. 80 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 6, 5, 0]. The 251 writes are split as follows [0, 1, 232, 0, 18]. [2025-03-04 03:01:19,690 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:19" (1/1) ... [2025-03-04 03:01:19,690 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:19" (1/1) ... [2025-03-04 03:01:19,710 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:19" (1/1) ... [2025-03-04 03:01:19,715 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:19" (1/1) ... [2025-03-04 03:01:19,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:19" (1/1) ... [2025-03-04 03:01:19,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:19" (1/1) ... [2025-03-04 03:01:19,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 03:01:19,740 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 03:01:19,740 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 03:01:19,740 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 03:01:19,742 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:19" (1/1) ... [2025-03-04 03:01:19,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:01:19,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:01:19,767 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 03:01:19,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 03:01:19,790 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2025-03-04 03:01:19,790 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2025-03-04 03:01:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 03:01:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2025-03-04 03:01:19,791 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2025-03-04 03:01:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2025-03-04 03:01:19,791 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2025-03-04 03:01:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-03-04 03:01:19,791 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-03-04 03:01:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 03:01:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 03:01:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 03:01:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 03:01:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 03:01:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 03:01:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 03:01:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 03:01:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 03:01:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 03:01:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-03-04 03:01:19,791 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-03-04 03:01:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 03:01:19,792 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 03:01:19,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 03:01:19,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 03:01:19,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 03:01:19,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 03:01:19,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 03:01:19,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 03:01:19,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 03:01:19,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 03:01:19,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 03:01:19,792 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_clean_up [2025-03-04 03:01:19,792 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_clean_up [2025-03-04 03:01:19,792 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-03-04 03:01:19,792 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-03-04 03:01:19,792 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2025-03-04 03:01:19,792 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2025-03-04 03:01:19,792 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-03-04 03:01:19,792 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-03-04 03:01:19,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 03:01:19,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 03:01:19,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 03:01:19,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 03:01:19,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 03:01:19,792 INFO L130 BoogieDeclarations]: Found specification of procedure aws_priority_queue_is_valid [2025-03-04 03:01:19,792 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_priority_queue_is_valid [2025-03-04 03:01:19,792 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2025-03-04 03:01:19,792 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2025-03-04 03:01:19,794 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 03:01:19,795 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 03:01:19,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 03:01:19,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 03:01:19,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 03:01:19,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 03:01:19,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 03:01:19,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 03:01:19,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 03:01:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 03:01:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 03:01:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 03:01:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 03:01:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-03-04 03:01:19,796 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-03-04 03:01:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-03-04 03:01:19,796 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-03-04 03:01:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 03:01:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 03:01:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 03:01:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 03:01:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 03:01:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure memset_impl [2025-03-04 03:01:19,796 INFO L138 BoogieDeclarations]: Found implementation of procedure memset_impl [2025-03-04 03:01:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure my_memset [2025-03-04 03:01:19,796 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memset [2025-03-04 03:01:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2025-03-04 03:01:19,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2025-03-04 03:01:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 03:01:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 03:01:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 03:01:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 03:01:19,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 03:01:20,035 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 03:01:20,037 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 03:01:20,064 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc #t~malloc77.base, #t~malloc77.offset; [2025-03-04 03:01:20,066 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc #t~nondet6; [2025-03-04 03:01:20,097 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588: havoc #t~ret57#1; [2025-03-04 03:01:20,127 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7309: havoc #t~ret656.base, #t~ret656.offset; [2025-03-04 03:01:20,188 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7462: havoc aws_priority_queue_backpointers_valid_#t~ret686#1;havoc aws_priority_queue_backpointers_valid_#t~short687#1; [2025-03-04 03:01:20,245 INFO L1325 $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-03-04 03:01:20,248 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-03-04 03:01:25,549 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2025-03-04 03:01:25,550 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 03:01:25,561 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 03:01:25,561 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 03:01:25,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:01:25 BoogieIcfgContainer [2025-03-04 03:01:25,561 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 03:01:25,565 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 03:01:25,565 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 03:01:25,569 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 03:01:25,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:01:18" (1/3) ... [2025-03-04 03:01:25,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e691af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:01:25, skipping insertion in model container [2025-03-04 03:01:25,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:01:19" (2/3) ... [2025-03-04 03:01:25,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e691af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:01:25, skipping insertion in model container [2025-03-04 03:01:25,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:01:25" (3/3) ... [2025-03-04 03:01:25,571 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_priority_queue_clean_up_harness_negated.i [2025-03-04 03:01:25,584 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 03:01:25,586 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_priority_queue_clean_up_harness_negated.i that has 19 procedures, 177 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-04 03:01:25,638 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 03:01:25,648 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;@7b9619e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 03:01:25,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 03:01:25,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 177 states, 117 states have (on average 1.2393162393162394) internal successors, (145), 118 states have internal predecessors, (145), 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-03-04 03:01:25,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 03:01:25,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:01:25,667 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, 1, 1, 1] [2025-03-04 03:01:25,667 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:01:25,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:01:25,672 INFO L85 PathProgramCache]: Analyzing trace with hash 776996526, now seen corresponding path program 1 times [2025-03-04 03:01:25,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:01:25,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383785280] [2025-03-04 03:01:25,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:01:25,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:01:29,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 03:01:30,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 03:01:30,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:01:30,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:01:30,567 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-04 03:01:30,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:01:30,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383785280] [2025-03-04 03:01:30,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383785280] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:01:30,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583834340] [2025-03-04 03:01:30,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:01:30,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:01:30,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:01:30,575 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:01:30,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 03:01:34,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 03:01:35,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 03:01:35,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:01:35,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:01:35,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 4392 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 03:01:35,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:01:35,312 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-04 03:01:35,312 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:01:35,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583834340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:01:35,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:01:35,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 03:01:35,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811674391] [2025-03-04 03:01:35,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:01:35,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 03:01:35,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:01:35,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 03:01:35,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 03:01:35,335 INFO L87 Difference]: Start difference. First operand has 177 states, 117 states have (on average 1.2393162393162394) internal successors, (145), 118 states have internal predecessors, (145), 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 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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-03-04 03:01:35,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:01:35,358 INFO L93 Difference]: Finished difference Result 328 states and 439 transitions. [2025-03-04 03:01:35,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 03:01:35,360 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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 132 [2025-03-04 03:01:35,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:01:35,369 INFO L225 Difference]: With dead ends: 328 [2025-03-04 03:01:35,369 INFO L226 Difference]: Without dead ends: 172 [2025-03-04 03:01:35,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 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-03-04 03:01:35,379 INFO L435 NwaCegarLoop]: 223 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, 223 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-03-04 03:01:35,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:01:35,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-04 03:01:35,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2025-03-04 03:01:35,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 112 states have (on average 1.2232142857142858) internal successors, (137), 114 states have internal predecessors, (137), 41 states have call successors, (41), 18 states have call predecessors, (41), 18 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 03:01:35,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 218 transitions. [2025-03-04 03:01:35,422 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 218 transitions. Word has length 132 [2025-03-04 03:01:35,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:01:35,424 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 218 transitions. [2025-03-04 03:01:35,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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-03-04 03:01:35,424 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 218 transitions. [2025-03-04 03:01:35,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-04 03:01:35,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:01:35,431 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] [2025-03-04 03:01:35,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 03:01:35,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 03:01:35,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:01:35,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:01:35,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1974982518, now seen corresponding path program 1 times [2025-03-04 03:01:35,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:01:35,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630499331] [2025-03-04 03:01:35,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:01:35,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:01:39,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 03:01:39,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 03:01:39,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:01:39,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:01:40,646 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-03-04 03:01:40,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:01:40,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630499331] [2025-03-04 03:01:40,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630499331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:01:40,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:01:40,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 03:01:40,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936787977] [2025-03-04 03:01:40,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:01:40,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 03:01:40,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:01:40,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 03:01:40,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:01:40,649 INFO L87 Difference]: Start difference. First operand 172 states and 218 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-03-04 03:01:41,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:01:41,058 INFO L93 Difference]: Finished difference Result 265 states and 333 transitions. [2025-03-04 03:01:41,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 03:01:41,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 149 [2025-03-04 03:01:41,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:01:41,061 INFO L225 Difference]: With dead ends: 265 [2025-03-04 03:01:41,061 INFO L226 Difference]: Without dead ends: 172 [2025-03-04 03:01:41,061 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-03-04 03:01:41,062 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 6 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 793 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-03-04 03:01:41,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 793 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 03:01:41,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-04 03:01:41,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2025-03-04 03:01:41,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 112 states have (on average 1.2142857142857142) internal successors, (136), 114 states have internal predecessors, (136), 41 states have call successors, (41), 18 states have call predecessors, (41), 18 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 03:01:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 217 transitions. [2025-03-04 03:01:41,076 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 217 transitions. Word has length 149 [2025-03-04 03:01:41,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:01:41,077 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 217 transitions. [2025-03-04 03:01:41,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-03-04 03:01:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 217 transitions. [2025-03-04 03:01:41,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 03:01:41,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:01:41,083 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] [2025-03-04 03:01:41,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 03:01:41,083 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:01:41,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:01:41,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1944039414, now seen corresponding path program 1 times [2025-03-04 03:01:41,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:01:41,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413718367] [2025-03-04 03:01:41,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:01:41,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:01:44,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 03:01:44,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 03:01:44,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:01:44,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:01:46,162 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-03-04 03:01:46,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:01:46,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413718367] [2025-03-04 03:01:46,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413718367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:01:46,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:01:46,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 03:01:46,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838869959] [2025-03-04 03:01:46,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:01:46,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 03:01:46,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:01:46,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 03:01:46,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:01:46,164 INFO L87 Difference]: Start difference. First operand 172 states and 217 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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-03-04 03:01:47,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:01:47,448 INFO L93 Difference]: Finished difference Result 284 states and 362 transitions. [2025-03-04 03:01:47,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 03:01:47,449 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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 157 [2025-03-04 03:01:47,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:01:47,451 INFO L225 Difference]: With dead ends: 284 [2025-03-04 03:01:47,451 INFO L226 Difference]: Without dead ends: 174 [2025-03-04 03:01:47,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 03:01:47,452 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 33 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:01:47,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1219 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 03:01:47,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-04 03:01:47,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2025-03-04 03:01:47,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 113 states have (on average 1.2123893805309736) internal successors, (137), 116 states have internal predecessors, (137), 41 states have call successors, (41), 18 states have call predecessors, (41), 19 states have return successors, (42), 40 states have call predecessors, (42), 40 states have call successors, (42) [2025-03-04 03:01:47,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 220 transitions. [2025-03-04 03:01:47,462 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 220 transitions. Word has length 157 [2025-03-04 03:01:47,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:01:47,462 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 220 transitions. [2025-03-04 03:01:47,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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-03-04 03:01:47,462 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 220 transitions. [2025-03-04 03:01:47,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-04 03:01:47,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:01:47,464 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, 1, 1, 1] [2025-03-04 03:01:47,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 03:01:47,464 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:01:47,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:01:47,465 INFO L85 PathProgramCache]: Analyzing trace with hash -705790610, now seen corresponding path program 1 times [2025-03-04 03:01:47,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:01:47,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765724456] [2025-03-04 03:01:47,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:01:47,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:01:51,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 03:01:51,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 03:01:51,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:01:51,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:01:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-03-04 03:01:52,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:01:52,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765724456] [2025-03-04 03:01:52,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765724456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:01:52,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:01:52,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 03:01:52,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622918118] [2025-03-04 03:01:52,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:01:52,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:01:52,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:01:52,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:01:52,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:01:52,387 INFO L87 Difference]: Start difference. First operand 174 states and 220 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-03-04 03:01:53,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:01:53,266 INFO L93 Difference]: Finished difference Result 270 states and 338 transitions. [2025-03-04 03:01:53,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:01:53,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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 172 [2025-03-04 03:01:53,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:01:53,269 INFO L225 Difference]: With dead ends: 270 [2025-03-04 03:01:53,269 INFO L226 Difference]: Without dead ends: 174 [2025-03-04 03:01:53,269 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-03-04 03:01:53,270 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 23 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 946 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.9s IncrementalHoareTripleChecker+Time [2025-03-04 03:01:53,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 946 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 03:01:53,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-04 03:01:53,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2025-03-04 03:01:53,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 113 states have (on average 1.2035398230088497) internal successors, (136), 116 states have internal predecessors, (136), 41 states have call successors, (41), 18 states have call predecessors, (41), 19 states have return successors, (42), 40 states have call predecessors, (42), 40 states have call successors, (42) [2025-03-04 03:01:53,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 219 transitions. [2025-03-04 03:01:53,288 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 219 transitions. Word has length 172 [2025-03-04 03:01:53,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:01:53,288 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 219 transitions. [2025-03-04 03:01:53,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-03-04 03:01:53,288 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 219 transitions. [2025-03-04 03:01:53,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-04 03:01:53,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:01:53,292 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, 1, 1, 1] [2025-03-04 03:01:53,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 03:01:53,293 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:01:53,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:01:53,293 INFO L85 PathProgramCache]: Analyzing trace with hash -574943928, now seen corresponding path program 1 times [2025-03-04 03:01:53,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:01:53,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814248841] [2025-03-04 03:01:53,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:01:53,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:01:56,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-04 03:01:56,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 03:01:56,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:01:56,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:01:58,434 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-03-04 03:01:58,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:01:58,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814248841] [2025-03-04 03:01:58,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814248841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:01:58,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:01:58,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 03:01:58,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929081691] [2025-03-04 03:01:58,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:01:58,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 03:01:58,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:01:58,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 03:01:58,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 03:01:58,435 INFO L87 Difference]: Start difference. First operand 174 states and 219 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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-03-04 03:02:00,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:02:00,234 INFO L93 Difference]: Finished difference Result 283 states and 356 transitions. [2025-03-04 03:02:00,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 03:02:00,236 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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 188 [2025-03-04 03:02:00,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:02:00,237 INFO L225 Difference]: With dead ends: 283 [2025-03-04 03:02:00,237 INFO L226 Difference]: Without dead ends: 174 [2025-03-04 03:02:00,238 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-03-04 03:02:00,239 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 55 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1268 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.7s IncrementalHoareTripleChecker+Time [2025-03-04 03:02:00,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1268 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 03:02:00,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-04 03:02:00,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2025-03-04 03:02:00,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 113 states have (on average 1.2035398230088497) internal successors, (136), 116 states have internal predecessors, (136), 41 states have call successors, (41), 18 states have call predecessors, (41), 19 states have return successors, (41), 40 states have call predecessors, (41), 40 states have call successors, (41) [2025-03-04 03:02:00,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 218 transitions. [2025-03-04 03:02:00,248 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 218 transitions. Word has length 188 [2025-03-04 03:02:00,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:02:00,248 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 218 transitions. [2025-03-04 03:02:00,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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-03-04 03:02:00,248 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 218 transitions. [2025-03-04 03:02:00,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-04 03:02:00,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:02:00,250 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, 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] [2025-03-04 03:02:00,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 03:02:00,250 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:02:00,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:02:00,251 INFO L85 PathProgramCache]: Analyzing trace with hash 795638440, now seen corresponding path program 1 times [2025-03-04 03:02:00,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:02:00,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444620528] [2025-03-04 03:02:00,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:02:00,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:02:03,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-04 03:02:04,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-04 03:02:04,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:02:04,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:02:05,393 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-04 03:02:05,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:02:05,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444620528] [2025-03-04 03:02:05,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444620528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:02:05,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:02:05,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 03:02:05,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914164714] [2025-03-04 03:02:05,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:02:05,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:02:05,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:02:05,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:02:05,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:02:05,394 INFO L87 Difference]: Start difference. First operand 174 states and 218 transitions. Second operand has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 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-03-04 03:02:05,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:02:05,859 INFO L93 Difference]: Finished difference Result 270 states and 336 transitions. [2025-03-04 03:02:05,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:02:05,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 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 203 [2025-03-04 03:02:05,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:02:05,862 INFO L225 Difference]: With dead ends: 270 [2025-03-04 03:02:05,863 INFO L226 Difference]: Without dead ends: 174 [2025-03-04 03:02:05,863 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-03-04 03:02:05,864 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 6 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1038 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.4s IncrementalHoareTripleChecker+Time [2025-03-04 03:02:05,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1038 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 03:02:05,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-04 03:02:05,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2025-03-04 03:02:05,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 113 states have (on average 1.1946902654867257) internal successors, (135), 116 states have internal predecessors, (135), 41 states have call successors, (41), 18 states have call predecessors, (41), 19 states have return successors, (41), 40 states have call predecessors, (41), 40 states have call successors, (41) [2025-03-04 03:02:05,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 217 transitions. [2025-03-04 03:02:05,872 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 217 transitions. Word has length 203 [2025-03-04 03:02:05,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:02:05,873 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 217 transitions. [2025-03-04 03:02:05,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 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-03-04 03:02:05,873 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 217 transitions. [2025-03-04 03:02:05,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-04 03:02:05,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:02:05,874 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, 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-03-04 03:02:05,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 03:02:05,875 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:02:05,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:02:05,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1726919709, now seen corresponding path program 1 times [2025-03-04 03:02:05,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:02:05,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932246998] [2025-03-04 03:02:05,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:02:05,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:02:09,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-04 03:02:10,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-04 03:02:10,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:02:10,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:02:11,482 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 03:02:11,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:02:11,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932246998] [2025-03-04 03:02:11,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932246998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:02:11,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891380854] [2025-03-04 03:02:11,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:02:11,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:02:11,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:02:11,484 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:02:11,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 03:02:15,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-04 03:02:16,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-04 03:02:16,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:02:16,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:02:16,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 4849 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 03:02:16,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:02:18,020 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-03-04 03:02:18,020 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:02:18,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891380854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:02:18,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:02:18,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-03-04 03:02:18,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610130967] [2025-03-04 03:02:18,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:02:18,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 03:02:18,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:02:18,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 03:02:18,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 03:02:18,022 INFO L87 Difference]: Start difference. First operand 174 states and 217 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 4 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-04 03:02:23,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 03:02:23,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:02:23,602 INFO L93 Difference]: Finished difference Result 290 states and 362 transitions. [2025-03-04 03:02:23,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 03:02:23,603 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 4 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) Word has length 204 [2025-03-04 03:02:23,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:02:23,605 INFO L225 Difference]: With dead ends: 290 [2025-03-04 03:02:23,605 INFO L226 Difference]: Without dead ends: 187 [2025-03-04 03:02:23,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 03:02:23,606 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 38 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-03-04 03:02:23,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 794 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2025-03-04 03:02:23,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-04 03:02:23,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 178. [2025-03-04 03:02:23,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 120 states have internal predecessors, (140), 41 states have call successors, (41), 18 states have call predecessors, (41), 19 states have return successors, (41), 40 states have call predecessors, (41), 40 states have call successors, (41) [2025-03-04 03:02:23,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 222 transitions. [2025-03-04 03:02:23,614 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 222 transitions. Word has length 204 [2025-03-04 03:02:23,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:02:23,615 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 222 transitions. [2025-03-04 03:02:23,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 4 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-04 03:02:23,615 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 222 transitions. [2025-03-04 03:02:23,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-04 03:02:23,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:02:23,618 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, 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-03-04 03:02:23,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 03:02:23,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 03:02:23,819 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:02:23,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:02:23,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1480606622, now seen corresponding path program 1 times [2025-03-04 03:02:23,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:02:23,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353311209] [2025-03-04 03:02:23,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:02:23,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:02:27,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-04 03:02:27,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-04 03:02:27,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:02:27,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:02:28,757 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-04 03:02:28,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:02:28,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353311209] [2025-03-04 03:02:28,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353311209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:02:28,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:02:28,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 03:02:28,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656204765] [2025-03-04 03:02:28,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:02:28,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:02:28,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:02:28,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:02:28,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:02:28,759 INFO L87 Difference]: Start difference. First operand 178 states and 222 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-04 03:02:28,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:02:28,950 INFO L93 Difference]: Finished difference Result 282 states and 350 transitions. [2025-03-04 03:02:28,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:02:28,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 204 [2025-03-04 03:02:28,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:02:28,952 INFO L225 Difference]: With dead ends: 282 [2025-03-04 03:02:28,952 INFO L226 Difference]: Without dead ends: 181 [2025-03-04 03:02:28,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:02:28,953 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 1 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:02:28,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 628 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 03:02:28,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-04 03:02:28,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2025-03-04 03:02:28,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 119 states have (on average 1.1932773109243697) internal successors, (142), 122 states have internal predecessors, (142), 41 states have call successors, (41), 18 states have call predecessors, (41), 19 states have return successors, (41), 40 states have call predecessors, (41), 40 states have call successors, (41) [2025-03-04 03:02:28,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 224 transitions. [2025-03-04 03:02:28,969 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 224 transitions. Word has length 204 [2025-03-04 03:02:28,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:02:28,971 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 224 transitions. [2025-03-04 03:02:28,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-04 03:02:28,971 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 224 transitions. [2025-03-04 03:02:28,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-04 03:02:28,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:02:28,973 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, 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-03-04 03:02:28,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 03:02:28,973 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:02:28,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:02:28,973 INFO L85 PathProgramCache]: Analyzing trace with hash 872529759, now seen corresponding path program 1 times [2025-03-04 03:02:28,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:02:28,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140469216] [2025-03-04 03:02:28,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:02:28,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:02:32,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-04 03:02:33,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-04 03:02:33,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:02:33,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:02:35,018 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 03:02:35,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:02:35,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140469216] [2025-03-04 03:02:35,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140469216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:02:35,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229338310] [2025-03-04 03:02:35,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:02:35,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:02:35,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:02:35,021 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:02:35,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 03:02:40,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-04 03:02:40,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-04 03:02:40,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:02:40,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:02:40,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 4841 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 03:02:40,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:02:42,498 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-04 03:02:42,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:02:42,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229338310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:02:42,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:02:42,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-03-04 03:02:42,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891760088] [2025-03-04 03:02:42,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:02:42,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 03:02:42,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:02:42,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 03:02:42,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-04 03:02:42,500 INFO L87 Difference]: Start difference. First operand 180 states and 224 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 5 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28)