./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_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_linked_list_rbegin_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 5d0330b863a3199999a1d87752dfb6e311192d268b0239668c112b8f01744457 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:59:23,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:59:23,711 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 02:59:23,715 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:59:23,715 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:59:23,730 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:59:23,731 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:59:23,731 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:59:23,731 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:59:23,731 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:59:23,732 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:59:23,732 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:59:23,732 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:59:23,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:59:23,733 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:59:23,733 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:59:23,733 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:59:23,733 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:59:23,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:59:23,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:59:23,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:59:23,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:59:23,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:59:23,733 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:59:23,734 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:59:23,734 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:59:23,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:59:23,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:59:23,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:59:23,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:59:23,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:59:23,734 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:59:23,734 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:59:23,735 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:59:23,735 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:59:23,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:59:23,735 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:59:23,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:59:23,735 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:59:23,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:59:23,735 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 -> 5d0330b863a3199999a1d87752dfb6e311192d268b0239668c112b8f01744457 [2025-03-04 02:59:23,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:59:23,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:59:23,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:59:23,956 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:59:23,957 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:59:23,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i [2025-03-04 02:59:25,049 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79ac932e7/52cbf8759ebb4620aa3b9b7916ce2271/FLAG1198e342d [2025-03-04 02:59:25,426 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:59:25,427 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i [2025-03-04 02:59:25,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79ac932e7/52cbf8759ebb4620aa3b9b7916ce2271/FLAG1198e342d [2025-03-04 02:59:25,602 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79ac932e7/52cbf8759ebb4620aa3b9b7916ce2271 [2025-03-04 02:59:25,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:59:25,605 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:59:25,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:59:25,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:59:25,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:59:25,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:59:25" (1/1) ... [2025-03-04 02:59:25,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76fa7966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:25, skipping insertion in model container [2025-03-04 02:59:25,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:59:25" (1/1) ... [2025-03-04 02:59:25,663 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:59:25,818 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_linked_list_rbegin_harness_negated.i[4496,4509] [2025-03-04 02:59:25,823 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_linked_list_rbegin_harness_negated.i[4556,4569] [2025-03-04 02:59:26,193 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:26,194 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:26,194 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:26,194 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:26,195 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:26,205 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:26,205 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:26,206 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:26,206 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:26,207 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:26,208 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:26,208 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:26,208 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:26,488 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_linked_list_rbegin_harness_negated.i[150690,150703] [2025-03-04 02:59:26,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:59:26,508 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:59:26,520 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_linked_list_rbegin_harness_negated.i[4496,4509] [2025-03-04 02:59:26,520 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_linked_list_rbegin_harness_negated.i[4556,4569] [2025-03-04 02:59:26,557 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:26,557 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:26,557 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:26,558 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:26,558 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:26,566 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:26,567 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:26,568 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:26,568 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:26,569 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:26,570 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:26,571 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:26,572 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:26,655 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_linked_list_rbegin_harness_negated.i[150690,150703] [2025-03-04 02:59:26,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:59:26,806 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:59:26,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:26 WrapperNode [2025-03-04 02:59:26,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:59:26,808 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:59:26,808 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:59:26,808 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:59:26,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:26" (1/1) ... [2025-03-04 02:59:26,843 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:26" (1/1) ... [2025-03-04 02:59:26,866 INFO L138 Inliner]: procedures = 668, calls = 1039, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 137 [2025-03-04 02:59:26,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:59:26,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:59:26,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:59:26,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:59:26,874 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:26" (1/1) ... [2025-03-04 02:59:26,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:26" (1/1) ... [2025-03-04 02:59:26,877 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:26" (1/1) ... [2025-03-04 02:59:26,890 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 5, 17]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2025-03-04 02:59:26,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:26" (1/1) ... [2025-03-04 02:59:26,890 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:26" (1/1) ... [2025-03-04 02:59:26,896 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:26" (1/1) ... [2025-03-04 02:59:26,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:26" (1/1) ... [2025-03-04 02:59:26,899 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:26" (1/1) ... [2025-03-04 02:59:26,900 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:26" (1/1) ... [2025-03-04 02:59:26,902 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:59:26,903 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:59:26,903 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:59:26,903 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:59:26,904 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:26" (1/1) ... [2025-03-04 02:59:26,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:59:26,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:26,932 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:59:26,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:59:26,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:59:26,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 02:59:26,949 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 02:59:26,949 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-04 02:59:26,949 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-04 02:59:26,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:59:26,949 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-03-04 02:59:26,949 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-03-04 02:59:26,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:59:26,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 02:59:26,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 02:59:26,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 02:59:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:59:26,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:59:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 02:59:26,950 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 02:59:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:59:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 02:59:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 02:59:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 02:59:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 02:59:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 02:59:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 02:59:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-04 02:59:26,950 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-04 02:59:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:59:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:59:26,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:59:27,117 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:59:27,118 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:59:27,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4718: havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; [2025-03-04 02:59:27,154 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-04 02:59:27,271 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-03-04 02:59:27,290 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-03-04 02:59:27,290 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:59:27,297 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:59:27,297 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:59:27,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:59:27 BoogieIcfgContainer [2025-03-04 02:59:27,297 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:59:27,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:59:27,299 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:59:27,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:59:27,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:59:25" (1/3) ... [2025-03-04 02:59:27,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb7d794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:59:27, skipping insertion in model container [2025-03-04 02:59:27,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:26" (2/3) ... [2025-03-04 02:59:27,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb7d794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:59:27, skipping insertion in model container [2025-03-04 02:59:27,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:59:27" (3/3) ... [2025-03-04 02:59:27,303 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rbegin_harness_negated.i [2025-03-04 02:59:27,312 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:59:27,313 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_rbegin_harness_negated.i that has 6 procedures, 68 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-04 02:59:27,344 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:59:27,353 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;@2860fe7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:59:27,353 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 02:59:27,356 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 48 states have (on average 1.3125) internal successors, (63), 49 states have internal predecessors, (63), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 02:59:27,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:59:27,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:27,364 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:59:27,364 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:27,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:27,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1751692032, now seen corresponding path program 1 times [2025-03-04 02:59:27,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:27,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68146983] [2025-03-04 02:59:27,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:27,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:27,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:59:27,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:59:27,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:27,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:27,650 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-04 02:59:27,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:27,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68146983] [2025-03-04 02:59:27,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68146983] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:27,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936271894] [2025-03-04 02:59:27,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:27,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:27,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:27,657 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:59:27,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:59:27,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:59:27,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:59:27,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:27,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:27,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 02:59:27,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:59:27,831 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-04 02:59:27,832 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:59:27,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936271894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:59:27,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:59:27,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 02:59:27,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864132538] [2025-03-04 02:59:27,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:59:27,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:59:27,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:27,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:59:27,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:59:27,854 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.3125) internal successors, (63), 49 states have internal predecessors, (63), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:59:27,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:27,872 INFO L93 Difference]: Finished difference Result 128 states and 176 transitions. [2025-03-04 02:59:27,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:59:27,874 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2025-03-04 02:59:27,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:27,878 INFO L225 Difference]: With dead ends: 128 [2025-03-04 02:59:27,879 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 02:59:27,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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 02:59:27,885 INFO L435 NwaCegarLoop]: 87 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, 87 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 02:59:27,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:59:27,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 02:59:27,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-04 02:59:27,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 02:59:27,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2025-03-04 02:59:27,912 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 70 [2025-03-04 02:59:27,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:27,913 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2025-03-04 02:59:27,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:59:27,913 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2025-03-04 02:59:27,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 02:59:27,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:27,917 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:59:27,924 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 02:59:28,117 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 02:59:28,118 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:28,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:28,119 INFO L85 PathProgramCache]: Analyzing trace with hash -2037040671, now seen corresponding path program 1 times [2025-03-04 02:59:28,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:28,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998192457] [2025-03-04 02:59:28,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:28,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:28,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 02:59:28,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 02:59:28,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:28,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:28,732 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-04 02:59:28,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:28,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998192457] [2025-03-04 02:59:28,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998192457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:59:28,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:59:28,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:59:28,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007992338] [2025-03-04 02:59:28,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:59:28,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:59:28,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:28,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:59:28,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:59:28,734 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 02:59:28,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:28,777 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2025-03-04 02:59:28,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:59:28,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 70 [2025-03-04 02:59:28,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:28,779 INFO L225 Difference]: With dead ends: 73 [2025-03-04 02:59:28,780 INFO L226 Difference]: Without dead ends: 71 [2025-03-04 02:59:28,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:59:28,780 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 3 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:28,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 387 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:59:28,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-04 02:59:28,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2025-03-04 02:59:28,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-04 02:59:28,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2025-03-04 02:59:28,792 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 70 [2025-03-04 02:59:28,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:28,793 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2025-03-04 02:59:28,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 02:59:28,793 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2025-03-04 02:59:28,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 02:59:28,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:28,795 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-04 02:59:28,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:59:28,795 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:28,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:28,796 INFO L85 PathProgramCache]: Analyzing trace with hash -323042944, now seen corresponding path program 1 times [2025-03-04 02:59:28,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:28,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029614091] [2025-03-04 02:59:28,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:28,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:28,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 02:59:28,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 02:59:28,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:28,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:28,999 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 02:59:28,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:28,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029614091] [2025-03-04 02:59:28,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029614091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:59:29,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:59:29,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:59:29,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664478009] [2025-03-04 02:59:29,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:59:29,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:59:29,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:29,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:59:29,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:59:29,001 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:59:29,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:29,089 INFO L93 Difference]: Finished difference Result 133 states and 176 transitions. [2025-03-04 02:59:29,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:59:29,090 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2025-03-04 02:59:29,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:29,091 INFO L225 Difference]: With dead ends: 133 [2025-03-04 02:59:29,091 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 02:59:29,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:59:29,092 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 21 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:29,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 349 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:59:29,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 02:59:29,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2025-03-04 02:59:29,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-04 02:59:29,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2025-03-04 02:59:29,099 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 71 [2025-03-04 02:59:29,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:29,099 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2025-03-04 02:59:29,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:59:29,100 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2025-03-04 02:59:29,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 02:59:29,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:29,101 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-04 02:59:29,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:59:29,101 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:29,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:29,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1128611816, now seen corresponding path program 1 times [2025-03-04 02:59:29,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:29,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21603774] [2025-03-04 02:59:29,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:29,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:29,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 02:59:29,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 02:59:29,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:29,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:29,319 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 02:59:29,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:29,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21603774] [2025-03-04 02:59:29,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21603774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:59:29,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:59:29,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:59:29,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014959459] [2025-03-04 02:59:29,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:59:29,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:59:29,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:29,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:59:29,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:59:29,323 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:59:29,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:29,454 INFO L93 Difference]: Finished difference Result 139 states and 184 transitions. [2025-03-04 02:59:29,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:59:29,455 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2025-03-04 02:59:29,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:29,457 INFO L225 Difference]: With dead ends: 139 [2025-03-04 02:59:29,457 INFO L226 Difference]: Without dead ends: 77 [2025-03-04 02:59:29,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:59:29,459 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 30 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:29,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 393 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:59:29,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-04 02:59:29,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2025-03-04 02:59:29,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 51 states have internal predecessors, (61), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-04 02:59:29,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2025-03-04 02:59:29,472 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 73 [2025-03-04 02:59:29,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:29,472 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2025-03-04 02:59:29,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:59:29,473 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2025-03-04 02:59:29,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 02:59:29,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:29,474 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-04 02:59:29,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:59:29,476 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:29,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:29,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2019669804, now seen corresponding path program 1 times [2025-03-04 02:59:29,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:29,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040972399] [2025-03-04 02:59:29,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:29,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:29,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 02:59:29,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 02:59:29,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:29,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:29,728 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 02:59:29,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:29,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040972399] [2025-03-04 02:59:29,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040972399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:59:29,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:59:29,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:59:29,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957026788] [2025-03-04 02:59:29,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:59:29,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:59:29,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:29,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:59:29,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:59:29,732 INFO L87 Difference]: Start difference. First operand 71 states and 92 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:59:29,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:29,847 INFO L93 Difference]: Finished difference Result 140 states and 184 transitions. [2025-03-04 02:59:29,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:59:29,848 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 74 [2025-03-04 02:59:29,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:29,849 INFO L225 Difference]: With dead ends: 140 [2025-03-04 02:59:29,849 INFO L226 Difference]: Without dead ends: 77 [2025-03-04 02:59:29,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:59:29,850 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 27 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:29,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 400 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:59:29,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-04 02:59:29,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2025-03-04 02:59:29,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.24) internal successors, (62), 52 states have internal predecessors, (62), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-04 02:59:29,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2025-03-04 02:59:29,856 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 93 transitions. Word has length 74 [2025-03-04 02:59:29,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:29,856 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 93 transitions. [2025-03-04 02:59:29,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:59:29,856 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 93 transitions. [2025-03-04 02:59:29,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 02:59:29,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:29,857 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-04 02:59:29,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:59:29,858 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:29,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:29,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1723672053, now seen corresponding path program 1 times [2025-03-04 02:59:29,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:29,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131647393] [2025-03-04 02:59:29,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:29,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:29,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 02:59:29,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 02:59:29,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:29,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:30,158 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 02:59:30,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:30,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131647393] [2025-03-04 02:59:30,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131647393] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:30,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449281116] [2025-03-04 02:59:30,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:30,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:30,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:30,161 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:59:30,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:59:30,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 02:59:30,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 02:59:30,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:30,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:30,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-03-04 02:59:30,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:59:30,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-03-04 02:59:30,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-03-04 02:59:30,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:59:30,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 35 [2025-03-04 02:59:30,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2025-03-04 02:59:30,960 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 02:59:30,961 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:59:30,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449281116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:59:30,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:59:30,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2025-03-04 02:59:30,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658871267] [2025-03-04 02:59:30,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:59:30,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:59:30,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:30,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:59:30,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:59:30,962 INFO L87 Difference]: Start difference. First operand 72 states and 93 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 02:59:31,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:31,321 INFO L93 Difference]: Finished difference Result 199 states and 261 transitions. [2025-03-04 02:59:31,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:59:31,322 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 82 [2025-03-04 02:59:31,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:31,323 INFO L225 Difference]: With dead ends: 199 [2025-03-04 02:59:31,323 INFO L226 Difference]: Without dead ends: 139 [2025-03-04 02:59:31,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:59:31,324 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 71 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:31,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 319 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 02:59:31,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-04 02:59:31,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2025-03-04 02:59:31,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 96 states have (on average 1.2604166666666667) internal successors, (121), 101 states have internal predecessors, (121), 26 states have call successors, (26), 11 states have call predecessors, (26), 14 states have return successors, (34), 24 states have call predecessors, (34), 24 states have call successors, (34) [2025-03-04 02:59:31,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 181 transitions. [2025-03-04 02:59:31,337 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 181 transitions. Word has length 82 [2025-03-04 02:59:31,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:31,338 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 181 transitions. [2025-03-04 02:59:31,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 02:59:31,338 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 181 transitions. [2025-03-04 02:59:31,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 02:59:31,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:31,339 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-04 02:59:31,346 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 02:59:31,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 02:59:31,540 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:31,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:31,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1443322164, now seen corresponding path program 1 times [2025-03-04 02:59:31,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:31,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232732406] [2025-03-04 02:59:31,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:31,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:31,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 02:59:31,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 02:59:31,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:31,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:31,771 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 02:59:31,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:31,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232732406] [2025-03-04 02:59:31,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232732406] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:31,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047785194] [2025-03-04 02:59:31,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:31,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:31,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:31,773 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:59:31,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:59:31,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 02:59:31,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 02:59:31,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:31,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:31,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 02:59:31,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:59:31,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-04 02:59:31,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-04 02:59:36,061 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_1|) (+ 16 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_1|)) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_1|) (+ 16 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_1|)) 0)))) is different from true [2025-03-04 02:59:40,120 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2| Int)) (not (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|) (+ 16 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2|)) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2| Int)) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|) (+ 16 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2|)) 0)))) is different from true [2025-03-04 02:59:48,515 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 39 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 02:59:48,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:59:56,905 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 02:59:56,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047785194] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:59:56,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:59:56,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 9] total 22 [2025-03-04 02:59:56,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711145832] [2025-03-04 02:59:56,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:59:56,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 02:59:56,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:56,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 02:59:56,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=323, Unknown=6, NotChecked=74, Total=462 [2025-03-04 02:59:56,908 INFO L87 Difference]: Start difference. First operand 137 states and 181 transitions. Second operand has 22 states, 21 states have (on average 5.238095238095238) internal successors, (110), 20 states have internal predecessors, (110), 7 states have call successors, (19), 5 states have call predecessors, (19), 8 states have return successors, (19), 7 states have call predecessors, (19), 7 states have call successors, (19) [2025-03-04 03:00:00,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 03:00:05,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 03:00:09,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 03:00:13,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 03:00:17,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 03:00:21,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 03:00:25,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 03:00:29,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 03:00:33,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 03:00:37,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 03:00:41,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 03:00:45,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 03:00:49,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 03:00:53,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 03:01:05,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]