./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 18:10:57,737 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 18:10:57,809 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 18:10:57,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 18:10:57,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 18:10:57,833 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 18:10:57,834 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 18:10:57,834 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 18:10:57,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 18:10:57,835 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 18:10:57,835 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 18:10:57,835 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 18:10:57,835 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 18:10:57,836 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 18:10:57,836 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 18:10:57,837 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 18:10:57,837 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 18:10:57,837 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 18:10:57,837 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 18:10:57,837 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 18:10:57,837 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 18:10:57,837 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 18:10:57,837 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 18:10:57,838 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 18:10:57,838 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 18:10:57,838 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 18:10:57,838 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 18:10:57,838 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 18:10:57,838 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 18:10:57,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:10:57,839 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 18:10:57,839 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 18:10:57,839 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 18:10:57,839 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 18:10:57,839 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 18:10:57,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 18:10:57,839 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 18:10:57,839 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 18:10:57,839 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 18:10:57,839 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 18:10:57,839 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-08 18:10:58,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 18:10:58,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 18:10:58,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 18:10:58,067 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 18:10:58,067 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 18:10:58,068 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-08 18:10:59,168 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32a10ff57/dac93da45bdc4e40a4283234c740303f/FLAG03127421e [2025-03-08 18:10:59,604 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 18:10:59,604 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i [2025-03-08 18:10:59,635 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32a10ff57/dac93da45bdc4e40a4283234c740303f/FLAG03127421e [2025-03-08 18:10:59,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32a10ff57/dac93da45bdc4e40a4283234c740303f [2025-03-08 18:10:59,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 18:10:59,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 18:10:59,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 18:10:59,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 18:10:59,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 18:10:59,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:10:59" (1/1) ... [2025-03-08 18:10:59,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@144b4654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:59, skipping insertion in model container [2025-03-08 18:10:59,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:10:59" (1/1) ... [2025-03-08 18:10:59,719 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 18:10:59,909 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-08 18:10:59,915 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-08 18:11:00,401 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:00,402 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:00,402 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:00,403 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:00,403 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:00,412 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:00,412 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:00,413 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:00,414 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:00,415 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:00,416 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:00,416 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:00,416 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:00,754 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-08 18:11:00,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:11:00,769 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 18:11:00,780 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-08 18:11:00,784 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-08 18:11:00,816 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:00,817 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:00,817 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:00,817 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:00,817 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:00,823 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:00,823 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:00,824 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:00,824 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:00,824 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:00,825 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:00,825 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:00,825 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:00,898 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-08 18:11:00,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:11:01,017 INFO L204 MainTranslator]: Completed translation [2025-03-08 18:11:01,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:01 WrapperNode [2025-03-08 18:11:01,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 18:11:01,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 18:11:01,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 18:11:01,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 18:11:01,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:01" (1/1) ... [2025-03-08 18:11:01,059 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:01" (1/1) ... [2025-03-08 18:11:01,090 INFO L138 Inliner]: procedures = 668, calls = 1039, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 137 [2025-03-08 18:11:01,090 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 18:11:01,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 18:11:01,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 18:11:01,091 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 18:11:01,097 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:01" (1/1) ... [2025-03-08 18:11:01,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:01" (1/1) ... [2025-03-08 18:11:01,099 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:01" (1/1) ... [2025-03-08 18:11:01,116 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 17, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 6 writes are split as follows [0, 6, 0]. [2025-03-08 18:11:01,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:01" (1/1) ... [2025-03-08 18:11:01,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:01" (1/1) ... [2025-03-08 18:11:01,128 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:01" (1/1) ... [2025-03-08 18:11:01,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:01" (1/1) ... [2025-03-08 18:11:01,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:01" (1/1) ... [2025-03-08 18:11:01,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:01" (1/1) ... [2025-03-08 18:11:01,143 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 18:11:01,143 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 18:11:01,143 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 18:11:01,143 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 18:11:01,144 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:01" (1/1) ... [2025-03-08 18:11:01,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:11:01,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:01,172 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-08 18:11:01,174 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-08 18:11:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 18:11:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 18:11:01,195 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 18:11:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-08 18:11:01,195 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-08 18:11:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 18:11:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-03-08 18:11:01,195 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-03-08 18:11:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 18:11:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 18:11:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 18:11:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 18:11:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 18:11:01,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 18:11:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 18:11:01,195 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 18:11:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 18:11:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 18:11:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 18:11:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 18:11:01,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 18:11:01,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 18:11:01,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 18:11:01,196 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-08 18:11:01,196 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-08 18:11:01,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 18:11:01,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 18:11:01,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 18:11:01,376 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 18:11:01,377 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 18:11:01,406 INFO L1307 $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-08 18:11:01,413 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-08 18:11:01,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-03-08 18:11:01,564 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-03-08 18:11:01,565 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 18:11:01,571 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 18:11:01,571 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 18:11:01,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:11:01 BoogieIcfgContainer [2025-03-08 18:11:01,571 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 18:11:01,573 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 18:11:01,573 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 18:11:01,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 18:11:01,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:10:59" (1/3) ... [2025-03-08 18:11:01,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d09680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:11:01, skipping insertion in model container [2025-03-08 18:11:01,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:01" (2/3) ... [2025-03-08 18:11:01,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d09680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:11:01, skipping insertion in model container [2025-03-08 18:11:01,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:11:01" (3/3) ... [2025-03-08 18:11:01,578 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rbegin_harness_negated.i [2025-03-08 18:11:01,590 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 18:11:01,592 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-08 18:11:01,631 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 18:11:01,640 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;@6f21c174, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 18:11:01,640 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 18:11:01,642 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-08 18:11:01,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 18:11:01,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:01,648 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-08 18:11:01,649 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:01,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:01,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1751692032, now seen corresponding path program 1 times [2025-03-08 18:11:01,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:01,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066626043] [2025-03-08 18:11:01,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:01,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:01,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 18:11:01,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 18:11:01,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:01,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:01,909 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-08 18:11:01,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:01,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066626043] [2025-03-08 18:11:01,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066626043] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:01,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199176795] [2025-03-08 18:11:01,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:01,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:01,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:01,913 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-08 18:11:01,914 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-08 18:11:02,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 18:11:02,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 18:11:02,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:02,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:02,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 18:11:02,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:02,074 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-08 18:11:02,074 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:11:02,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199176795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:02,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:11:02,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 18:11:02,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500266968] [2025-03-08 18:11:02,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:02,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 18:11:02,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:02,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 18:11:02,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 18:11:02,091 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-08 18:11:02,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:02,105 INFO L93 Difference]: Finished difference Result 128 states and 176 transitions. [2025-03-08 18:11:02,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 18:11:02,107 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-08 18:11:02,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:02,110 INFO L225 Difference]: With dead ends: 128 [2025-03-08 18:11:02,111 INFO L226 Difference]: Without dead ends: 63 [2025-03-08 18:11:02,113 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-08 18:11:02,114 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-08 18:11:02,115 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-08 18:11:02,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-08 18:11:02,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-08 18:11:02,140 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-08 18:11:02,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2025-03-08 18:11:02,147 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 70 [2025-03-08 18:11:02,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:02,147 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2025-03-08 18:11:02,147 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-08 18:11:02,148 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2025-03-08 18:11:02,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 18:11:02,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:02,151 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-08 18:11:02,157 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-08 18:11:02,351 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-08 18:11:02,352 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:02,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:02,352 INFO L85 PathProgramCache]: Analyzing trace with hash -2037040671, now seen corresponding path program 1 times [2025-03-08 18:11:02,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:02,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639137975] [2025-03-08 18:11:02,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:02,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:02,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 18:11:02,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 18:11:02,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:02,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:02,901 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-08 18:11:02,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:02,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639137975] [2025-03-08 18:11:02,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639137975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:02,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:11:02,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 18:11:02,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463699540] [2025-03-08 18:11:02,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:02,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 18:11:02,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:02,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 18:11:02,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 18:11:02,904 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-08 18:11:02,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:02,955 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2025-03-08 18:11:02,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 18:11:02,956 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-08 18:11:02,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:02,959 INFO L225 Difference]: With dead ends: 73 [2025-03-08 18:11:02,959 INFO L226 Difference]: Without dead ends: 71 [2025-03-08 18:11:02,960 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-08 18:11:02,960 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-08 18:11:02,961 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-08 18:11:02,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-08 18:11:02,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2025-03-08 18:11:02,971 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-08 18:11:02,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2025-03-08 18:11:02,972 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 70 [2025-03-08 18:11:02,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:02,974 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2025-03-08 18:11:02,974 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-08 18:11:02,974 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2025-03-08 18:11:02,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 18:11:02,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:02,976 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-08 18:11:02,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 18:11:02,976 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:02,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:02,977 INFO L85 PathProgramCache]: Analyzing trace with hash -323042944, now seen corresponding path program 1 times [2025-03-08 18:11:02,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:02,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134929935] [2025-03-08 18:11:02,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:02,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:03,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 18:11:03,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 18:11:03,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:03,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:03,187 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-08 18:11:03,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:03,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134929935] [2025-03-08 18:11:03,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134929935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:03,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:11:03,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 18:11:03,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256801717] [2025-03-08 18:11:03,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:03,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 18:11:03,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:03,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 18:11:03,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 18:11:03,190 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-08 18:11:03,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:03,304 INFO L93 Difference]: Finished difference Result 133 states and 176 transitions. [2025-03-08 18:11:03,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 18:11:03,305 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-08 18:11:03,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:03,306 INFO L225 Difference]: With dead ends: 133 [2025-03-08 18:11:03,308 INFO L226 Difference]: Without dead ends: 72 [2025-03-08 18:11:03,309 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-08 18:11:03,310 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-08 18:11:03,311 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-08 18:11:03,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-08 18:11:03,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2025-03-08 18:11:03,318 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-08 18:11:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2025-03-08 18:11:03,320 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 71 [2025-03-08 18:11:03,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:03,320 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2025-03-08 18:11:03,320 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-08 18:11:03,321 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2025-03-08 18:11:03,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 18:11:03,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:03,322 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-08 18:11:03,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 18:11:03,322 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:03,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:03,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1128611816, now seen corresponding path program 1 times [2025-03-08 18:11:03,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:03,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125325678] [2025-03-08 18:11:03,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:03,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:03,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 18:11:03,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 18:11:03,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:03,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:03,562 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-08 18:11:03,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:03,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125325678] [2025-03-08 18:11:03,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125325678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:03,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:11:03,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 18:11:03,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916958202] [2025-03-08 18:11:03,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:03,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 18:11:03,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:03,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 18:11:03,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 18:11:03,563 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-08 18:11:03,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:03,700 INFO L93 Difference]: Finished difference Result 139 states and 184 transitions. [2025-03-08 18:11:03,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 18:11:03,700 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-08 18:11:03,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:03,701 INFO L225 Difference]: With dead ends: 139 [2025-03-08 18:11:03,701 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 18:11:03,702 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-08 18:11:03,702 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-08 18:11:03,702 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-08 18:11:03,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 18:11:03,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2025-03-08 18:11:03,709 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-08 18:11:03,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2025-03-08 18:11:03,710 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 73 [2025-03-08 18:11:03,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:03,710 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2025-03-08 18:11:03,710 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-08 18:11:03,710 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2025-03-08 18:11:03,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 18:11:03,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:03,711 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-08 18:11:03,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 18:11:03,711 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:03,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:03,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2019669804, now seen corresponding path program 1 times [2025-03-08 18:11:03,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:03,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125201849] [2025-03-08 18:11:03,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:03,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:03,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 18:11:03,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 18:11:03,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:03,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:04,001 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-08 18:11:04,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:04,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125201849] [2025-03-08 18:11:04,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125201849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:04,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:11:04,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 18:11:04,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678847384] [2025-03-08 18:11:04,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:04,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 18:11:04,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:04,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 18:11:04,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 18:11:04,004 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-08 18:11:04,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:04,126 INFO L93 Difference]: Finished difference Result 140 states and 184 transitions. [2025-03-08 18:11:04,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 18:11:04,126 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-08 18:11:04,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:04,127 INFO L225 Difference]: With dead ends: 140 [2025-03-08 18:11:04,127 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 18:11:04,128 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-08 18:11:04,128 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-08 18:11:04,128 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-08 18:11:04,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 18:11:04,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2025-03-08 18:11:04,139 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-08 18:11:04,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2025-03-08 18:11:04,140 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 93 transitions. Word has length 74 [2025-03-08 18:11:04,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:04,140 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 93 transitions. [2025-03-08 18:11:04,140 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-08 18:11:04,140 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 93 transitions. [2025-03-08 18:11:04,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 18:11:04,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:04,141 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-08 18:11:04,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 18:11:04,141 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:04,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:04,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1723672053, now seen corresponding path program 1 times [2025-03-08 18:11:04,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:04,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979605897] [2025-03-08 18:11:04,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:04,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:04,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 18:11:04,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 18:11:04,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:04,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:04,497 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-08 18:11:04,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:04,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979605897] [2025-03-08 18:11:04,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979605897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:04,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:11:04,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 18:11:04,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474680206] [2025-03-08 18:11:04,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:04,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 18:11:04,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:04,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 18:11:04,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 18:11:04,499 INFO L87 Difference]: Start difference. First operand 72 states and 93 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 18:11:04,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:04,539 INFO L93 Difference]: Finished difference Result 83 states and 107 transitions. [2025-03-08 18:11:04,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 18:11:04,539 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2025-03-08 18:11:04,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:04,540 INFO L225 Difference]: With dead ends: 83 [2025-03-08 18:11:04,540 INFO L226 Difference]: Without dead ends: 81 [2025-03-08 18:11:04,540 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-08 18:11:04,541 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 3 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:04,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 452 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:11:04,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-08 18:11:04,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2025-03-08 18:11:04,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 53 states have internal predecessors, (63), 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-08 18:11:04,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2025-03-08 18:11:04,554 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 82 [2025-03-08 18:11:04,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:04,555 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2025-03-08 18:11:04,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 18:11:04,556 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2025-03-08 18:11:04,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 18:11:04,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:04,557 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 18:11:04,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 18:11:04,557 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:04,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:04,557 INFO L85 PathProgramCache]: Analyzing trace with hash 655805907, now seen corresponding path program 1 times [2025-03-08 18:11:04,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:04,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361299562] [2025-03-08 18:11:04,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:04,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:04,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:11:04,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:11:04,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:04,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:04,783 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 18:11:04,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:04,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361299562] [2025-03-08 18:11:04,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361299562] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:04,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393833211] [2025-03-08 18:11:04,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:04,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:04,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:04,785 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-08 18:11:04,787 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-08 18:11:04,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:11:04,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:11:04,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:04,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:04,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-08 18:11:04,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:04,997 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 19 [2025-03-08 18:11:05,009 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 19 [2025-03-08 18:11:05,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:05,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:05,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:05,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2025-03-08 18:11:05,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:05,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:05,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:05,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2025-03-08 18:11:06,191 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 18:11:06,192 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:11:06,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393833211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:06,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:11:06,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2025-03-08 18:11:06,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115236920] [2025-03-08 18:11:06,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:06,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 18:11:06,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:06,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 18:11:06,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-08 18:11:06,193 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 18:11:06,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:06,753 INFO L93 Difference]: Finished difference Result 204 states and 269 transitions. [2025-03-08 18:11:06,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 18:11:06,755 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 76 [2025-03-08 18:11:06,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:06,756 INFO L225 Difference]: With dead ends: 204 [2025-03-08 18:11:06,756 INFO L226 Difference]: Without dead ends: 140 [2025-03-08 18:11:06,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-08 18:11:06,757 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 46 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:06,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 413 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 18:11:06,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-08 18:11:06,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2025-03-08 18:11:06,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 96 states have (on average 1.25) internal successors, (120), 100 states have internal predecessors, (120), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2025-03-08 18:11:06,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 178 transitions. [2025-03-08 18:11:06,780 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 178 transitions. Word has length 76 [2025-03-08 18:11:06,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:06,780 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 178 transitions. [2025-03-08 18:11:06,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 18:11:06,780 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 178 transitions. [2025-03-08 18:11:06,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 18:11:06,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:06,781 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 18:11:06,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 18:11:06,986 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-08 18:11:06,986 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:06,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:06,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1263316404, now seen corresponding path program 1 times [2025-03-08 18:11:06,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:06,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842139148] [2025-03-08 18:11:06,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:06,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:07,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:11:07,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:11:07,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:07,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:07,172 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 18:11:07,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:07,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842139148] [2025-03-08 18:11:07,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842139148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:07,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101821891] [2025-03-08 18:11:07,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:07,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:07,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:07,174 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-08 18:11:07,176 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-08 18:11:07,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:11:07,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:11:07,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:07,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:07,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 18:11:07,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:07,414 INFO L349 Elim1Store]: treesize reduction 66, result has 39.4 percent of original size [2025-03-08 18:11:07,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 128 [2025-03-08 18:11:07,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2025-03-08 18:11:07,437 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:11:07,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2025-03-08 18:11:07,486 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:11:07,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 13 [2025-03-08 18:11:07,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 18:11:11,570 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| v_DerPreprocessor_2) .cse1))) (and (= .cse0 (select |c_#memory_$Pointer$#1.base| .cse1)) (= v_DerPreprocessor_2 (store .cse0 .cse2 .cse1))))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| .cse1)))))))) is different from true [2025-03-08 18:11:12,090 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 18:11:12,090 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:11:12,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101821891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:12,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:11:12,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2025-03-08 18:11:12,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069826120] [2025-03-08 18:11:12,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:12,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 18:11:12,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:12,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 18:11:12,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=154, Unknown=2, NotChecked=24, Total=210 [2025-03-08 18:11:12,092 INFO L87 Difference]: Start difference. First operand 136 states and 178 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 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-08 18:11:28,570 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-08 18:11:32,842 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-08 18:11:36,998 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-08 18:11:37,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:37,055 INFO L93 Difference]: Finished difference Result 221 states and 288 transitions. [2025-03-08 18:11:37,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 18:11:37,057 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 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 76 [2025-03-08 18:11:37,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:37,059 INFO L225 Difference]: With dead ends: 221 [2025-03-08 18:11:37,059 INFO L226 Difference]: Without dead ends: 156 [2025-03-08 18:11:37,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=4, NotChecked=42, Total=552 [2025-03-08 18:11:37,060 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 126 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 4 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:37,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 422 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 166 Invalid, 6 Unknown, 114 Unchecked, 12.5s Time] [2025-03-08 18:11:37,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-08 18:11:37,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 150. [2025-03-08 18:11:37,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 109 states have (on average 1.275229357798165) internal successors, (139), 113 states have internal predecessors, (139), 26 states have call successors, (26), 12 states have call predecessors, (26), 14 states have return successors, (33), 24 states have call predecessors, (33), 24 states have call successors, (33) [2025-03-08 18:11:37,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 198 transitions. [2025-03-08 18:11:37,081 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 198 transitions. Word has length 76 [2025-03-08 18:11:37,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:37,082 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 198 transitions. [2025-03-08 18:11:37,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 10 states have internal predecessors, (44), 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-08 18:11:37,082 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 198 transitions. [2025-03-08 18:11:37,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 18:11:37,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:37,083 INFO L218 NwaCegarLoop]: trace histogram [3, 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-08 18:11:37,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 18:11:37,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:37,284 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:37,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:37,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1956709109, now seen corresponding path program 1 times [2025-03-08 18:11:37,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:37,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906149999] [2025-03-08 18:11:37,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:37,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:37,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:11:37,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:11:37,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:37,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:37,454 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 18:11:37,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:37,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906149999] [2025-03-08 18:11:37,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906149999] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:37,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130519781] [2025-03-08 18:11:37,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:37,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:37,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:37,457 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:11:37,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 18:11:37,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:11:37,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:11:37,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:37,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:37,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 18:11:37,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:37,676 INFO L349 Elim1Store]: treesize reduction 66, result has 39.4 percent of original size [2025-03-08 18:11:37,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 128 [2025-03-08 18:11:37,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2025-03-08 18:11:37,731 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:11:37,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 13 [2025-03-08 18:11:37,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 18:11:41,810 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10| .cse0) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10| v_DerPreprocessor_4) .cse0))) (and (= (select |c_#memory_$Pointer$#1.base| .cse0) .cse1) (= (store .cse1 .cse2 .cse0) v_DerPreprocessor_4)))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10|)))) is different from true [2025-03-08 18:11:42,308 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10| .cse0) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10| v_DerPreprocessor_4) .cse0))) (and (= (select |c_#memory_$Pointer$#1.base| .cse0) .cse1) (= (store .cse1 .cse2 .cse0) v_DerPreprocessor_4)))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11|) .cse5))) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_4) .cse3))) (and (= (select |c_#memory_$Pointer$#1.base| .cse3) .cse4) (= (store .cse4 .cse5 .cse3) v_DerPreprocessor_4)))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11| .cse3))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11|))))) is different from true [2025-03-08 18:11:50,753 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10| .cse0) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10| v_DerPreprocessor_4) .cse0))) (and (= (select |c_#memory_$Pointer$#1.base| .cse0) .cse1) (= (store .cse1 .cse2 .cse0) v_DerPreprocessor_4)))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11|) .cse5))) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_4) .cse3))) (and (= (select |c_#memory_$Pointer$#1.base| .cse3) .cse4) (= (store .cse4 .cse5 .cse3) v_DerPreprocessor_4)))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11| .cse3))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|) .cse8))) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2| v_DerPreprocessor_4) .cse7))) (and (= .cse6 (select |c_#memory_$Pointer$#1.base| .cse7)) (= v_DerPreprocessor_4 (store .cse6 .cse8 .cse7))))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2| .cse7))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|))))) is different from true [2025-03-08 18:11:55,512 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10| .cse0) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10| v_DerPreprocessor_4) .cse0))) (and (= (select |c_#memory_$Pointer$#1.base| .cse0) .cse1) (= (store .cse1 .cse2 .cse0) v_DerPreprocessor_4)))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11|) .cse5))) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_4) .cse3))) (and (= (select |c_#memory_$Pointer$#1.base| .cse3) .cse4) (= (store .cse4 .cse5 .cse3) v_DerPreprocessor_4)))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11| .cse3))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_3| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_3| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_3| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_3| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3|) .cse8))) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3| v_DerPreprocessor_4) .cse7))) (and (= .cse6 (select |c_#memory_$Pointer$#1.base| .cse7)) (= v_DerPreprocessor_4 (store .cse6 .cse8 .cse7))))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3| .cse7)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2| 24))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|) .cse11))) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2| v_DerPreprocessor_4) .cse10))) (and (= .cse9 (select |c_#memory_$Pointer$#1.base| .cse10)) (= v_DerPreprocessor_4 (store .cse9 .cse11 .cse10))))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2| .cse10))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|))))) is different from true [2025-03-08 18:12:08,046 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10| .cse0) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10| v_DerPreprocessor_4) .cse0))) (and (= (select |c_#memory_$Pointer$#1.base| .cse0) .cse1) (= (store .cse1 .cse2 .cse0) v_DerPreprocessor_4)))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_10|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11|) .cse5))) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_4) .cse3))) (and (= (select |c_#memory_$Pointer$#1.base| .cse3) .cse4) (= (store .cse4 .cse5 .cse3) v_DerPreprocessor_4)))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11| .cse3))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_11|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|) .cse8))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| .cse6) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_$Pointer$#1.base| .cse6 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| v_DerPreprocessor_4) .cse6))) (and (= (select |c_#memory_$Pointer$#1.base| .cse6) .cse7) (= (store .cse7 .cse8 .cse6) v_DerPreprocessor_4)))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_3| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_3| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_3| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_3| 24))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3|) .cse11))) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3| v_DerPreprocessor_4) .cse10))) (and (= .cse9 (select |c_#memory_$Pointer$#1.base| .cse10)) (= v_DerPreprocessor_4 (store .cse9 .cse11 .cse10))))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_3| .cse10)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2| Int)) (let ((.cse14 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_2| 24))) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|) .cse14))) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_$Pointer$#1.base| .cse13 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2| v_DerPreprocessor_4) .cse13))) (and (= .cse12 (select |c_#memory_$Pointer$#1.base| .cse13)) (= v_DerPreprocessor_4 (store .cse12 .cse14 .cse13))))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2| .cse13))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_2|))))) is different from true [2025-03-08 18:12:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 40 not checked. [2025-03-08 18:12:09,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:12:10,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:12:10,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 154 [2025-03-08 18:12:10,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 146 [2025-03-08 18:12:10,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 120 [2025-03-08 18:12:10,772 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 18:12:10,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130519781] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 18:12:10,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 18:12:10,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6, 20] total 33 [2025-03-08 18:12:10,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451352524] [2025-03-08 18:12:10,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:12:10,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 18:12:10,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:12:10,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 18:12:10,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=648, Unknown=36, NotChecked=280, Total=1056 [2025-03-08 18:12:10,774 INFO L87 Difference]: Start difference. First operand 150 states and 198 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 18:12:11,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:12:11,382 INFO L93 Difference]: Finished difference Result 253 states and 347 transitions. [2025-03-08 18:12:11,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 18:12:11,382 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 76 [2025-03-08 18:12:11,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:12:11,383 INFO L225 Difference]: With dead ends: 253 [2025-03-08 18:12:11,383 INFO L226 Difference]: Without dead ends: 174 [2025-03-08 18:12:11,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 30.8s TimeCoverageRelationStatistics Valid=138, Invalid=1105, Unknown=37, NotChecked=360, Total=1640 [2025-03-08 18:12:11,384 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 131 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:12:11,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 471 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 18:12:11,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-08 18:12:11,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 152. [2025-03-08 18:12:11,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 110 states have (on average 1.2636363636363637) internal successors, (139), 115 states have internal predecessors, (139), 26 states have call successors, (26), 12 states have call predecessors, (26), 15 states have return successors, (36), 24 states have call predecessors, (36), 24 states have call successors, (36) [2025-03-08 18:12:11,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 201 transitions. [2025-03-08 18:12:11,399 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 201 transitions. Word has length 76 [2025-03-08 18:12:11,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:12:11,400 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 201 transitions. [2025-03-08 18:12:11,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 18:12:11,400 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 201 transitions. [2025-03-08 18:12:11,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 18:12:11,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:12:11,401 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 18:12:11,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 18:12:11,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:12:11,618 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:12:11,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:12:11,618 INFO L85 PathProgramCache]: Analyzing trace with hash 965351765, now seen corresponding path program 1 times [2025-03-08 18:12:11,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:12:11,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736613813] [2025-03-08 18:12:11,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:11,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:12:11,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:12:11,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:12:11,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:11,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 18:12:11,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:12:11,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736613813] [2025-03-08 18:12:11,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736613813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:12:11,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246302622] [2025-03-08 18:12:11,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:11,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:12:11,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:12:11,772 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:12:11,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 18:12:11,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:12:11,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:12:11,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:11,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:11,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 18:12:11,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:12:11,930 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 19 [2025-03-08 18:12:11,939 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 24 treesize of output 9 [2025-03-08 18:12:11,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:11,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:11,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:11,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2025-03-08 18:12:11,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:11,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:11,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:11,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2025-03-08 18:12:12,456 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 18:12:12,456 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:12:12,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246302622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:12:12,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:12:12,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2025-03-08 18:12:12,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139963169] [2025-03-08 18:12:12,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:12:12,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 18:12:12,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:12:12,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 18:12:12,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-08 18:12:12,458 INFO L87 Difference]: Start difference. First operand 152 states and 201 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 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-08 18:12:13,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:12:13,129 INFO L93 Difference]: Finished difference Result 251 states and 336 transitions. [2025-03-08 18:12:13,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 18:12:13,130 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 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 76 [2025-03-08 18:12:13,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:12:13,131 INFO L225 Difference]: With dead ends: 251 [2025-03-08 18:12:13,131 INFO L226 Difference]: Without dead ends: 179 [2025-03-08 18:12:13,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-03-08 18:12:13,132 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 83 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 18:12:13,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 429 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 18:12:13,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-08 18:12:13,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2025-03-08 18:12:13,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 130 states have (on average 1.2692307692307692) internal successors, (165), 137 states have internal predecessors, (165), 27 states have call successors, (27), 12 states have call predecessors, (27), 17 states have return successors, (41), 25 states have call predecessors, (41), 25 states have call successors, (41) [2025-03-08 18:12:13,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 233 transitions. [2025-03-08 18:12:13,148 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 233 transitions. Word has length 76 [2025-03-08 18:12:13,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:12:13,148 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 233 transitions. [2025-03-08 18:12:13,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 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-08 18:12:13,149 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 233 transitions. [2025-03-08 18:12:13,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 18:12:13,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:12:13,149 INFO L218 NwaCegarLoop]: trace histogram [3, 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-08 18:12:13,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 18:12:13,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 18:12:13,350 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:12:13,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:12:13,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1595810390, now seen corresponding path program 1 times [2025-03-08 18:12:13,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:12:13,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346570226] [2025-03-08 18:12:13,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:13,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:12:13,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:12:13,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:12:13,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:13,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:13,653 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 18:12:13,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:12:13,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346570226] [2025-03-08 18:12:13,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346570226] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:12:13,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107597509] [2025-03-08 18:12:13,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:13,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:12:13,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:12:13,656 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:12:13,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 18:12:13,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:12:13,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:12:13,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:13,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:13,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-08 18:12:13,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:12:13,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 18:12:13,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 18:12:14,171 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 18:12:14,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:12:14,514 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 18:12:14,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107597509] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 18:12:14,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 18:12:14,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 12] total 30 [2025-03-08 18:12:14,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548137018] [2025-03-08 18:12:14,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 18:12:14,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 18:12:14,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:12:14,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 18:12:14,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=765, Unknown=0, NotChecked=0, Total=870 [2025-03-08 18:12:14,515 INFO L87 Difference]: Start difference. First operand 175 states and 233 transitions. Second operand has 30 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 6 states have call predecessors, (21), 10 states have call successors, (21) [2025-03-08 18:12:15,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:12:15,353 INFO L93 Difference]: Finished difference Result 465 states and 654 transitions. [2025-03-08 18:12:15,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 18:12:15,354 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 6 states have call predecessors, (21), 10 states have call successors, (21) Word has length 76 [2025-03-08 18:12:15,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:12:15,355 INFO L225 Difference]: With dead ends: 465 [2025-03-08 18:12:15,356 INFO L226 Difference]: Without dead ends: 311 [2025-03-08 18:12:15,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=243, Invalid=1649, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 18:12:15,357 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 134 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 18:12:15,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1051 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 18:12:15,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-08 18:12:15,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 274. [2025-03-08 18:12:15,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 216 states have (on average 1.287037037037037) internal successors, (278), 225 states have internal predecessors, (278), 34 states have call successors, (34), 16 states have call predecessors, (34), 23 states have return successors, (60), 32 states have call predecessors, (60), 32 states have call successors, (60) [2025-03-08 18:12:15,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 372 transitions. [2025-03-08 18:12:15,378 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 372 transitions. Word has length 76 [2025-03-08 18:12:15,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:12:15,379 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 372 transitions. [2025-03-08 18:12:15,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 6 states have call predecessors, (21), 10 states have call successors, (21) [2025-03-08 18:12:15,379 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 372 transitions. [2025-03-08 18:12:15,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 18:12:15,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:12:15,380 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-08 18:12:15,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 18:12:15,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:12:15,581 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:12:15,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:12:15,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1876160279, now seen corresponding path program 1 times [2025-03-08 18:12:15,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:12:15,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610218] [2025-03-08 18:12:15,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:15,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:12:15,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:12:15,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:12:15,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:15,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:15,649 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 18:12:15,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:12:15,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610218] [2025-03-08 18:12:15,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610218] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:12:15,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587652586] [2025-03-08 18:12:15,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:15,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:12:15,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:12:15,652 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:12:15,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 18:12:15,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:12:15,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:12:15,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:15,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:15,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 18:12:15,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:12:15,826 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 18:12:15,827 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:12:15,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587652586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:12:15,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:12:15,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2025-03-08 18:12:15,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854682245] [2025-03-08 18:12:15,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:12:15,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 18:12:15,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:12:15,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 18:12:15,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 18:12:15,829 INFO L87 Difference]: Start difference. First operand 274 states and 372 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 18:12:15,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:12:15,968 INFO L93 Difference]: Finished difference Result 624 states and 854 transitions. [2025-03-08 18:12:15,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 18:12:15,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2025-03-08 18:12:15,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:12:15,970 INFO L225 Difference]: With dead ends: 624 [2025-03-08 18:12:15,970 INFO L226 Difference]: Without dead ends: 357 [2025-03-08 18:12:15,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-08 18:12:15,971 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 94 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:12:15,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 271 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:12:15,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-08 18:12:15,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 299. [2025-03-08 18:12:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 237 states have (on average 1.261603375527426) internal successors, (299), 248 states have internal predecessors, (299), 36 states have call successors, (36), 16 states have call predecessors, (36), 25 states have return successors, (64), 34 states have call predecessors, (64), 34 states have call successors, (64) [2025-03-08 18:12:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 399 transitions. [2025-03-08 18:12:15,999 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 399 transitions. Word has length 76 [2025-03-08 18:12:15,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:12:15,999 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 399 transitions. [2025-03-08 18:12:15,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 18:12:15,999 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 399 transitions. [2025-03-08 18:12:16,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 18:12:16,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:12:16,002 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-08 18:12:16,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 18:12:16,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:12:16,203 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:12:16,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:12:16,203 INFO L85 PathProgramCache]: Analyzing trace with hash 274559064, now seen corresponding path program 1 times [2025-03-08 18:12:16,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:12:16,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484597103] [2025-03-08 18:12:16,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:16,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:12:16,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 18:12:16,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 18:12:16,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:16,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:16,356 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 18:12:16,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:12:16,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484597103] [2025-03-08 18:12:16,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484597103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:12:16,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943015211] [2025-03-08 18:12:16,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:16,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:12:16,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:12:16,358 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:12:16,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 18:12:16,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 18:12:16,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 18:12:16,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:16,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:16,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-08 18:12:16,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:12:16,535 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 19 [2025-03-08 18:12:16,548 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 19 [2025-03-08 18:12:16,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:16,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:16,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2025-03-08 18:12:16,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:16,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:16,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2025-03-08 18:12:16,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:16,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-03-08 18:12:16,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:16,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-03-08 18:12:16,674 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2025-03-08 18:12:16,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 127 [2025-03-08 18:12:16,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:16,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:16,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:16,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 103 [2025-03-08 18:12:16,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:16,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:16,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2025-03-08 18:12:16,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:16,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:16,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:16,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2025-03-08 18:12:19,792 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 1 refuted. 12 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 18:12:19,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:12:20,082 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_741 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_741))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_743 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_743))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2025-03-08 18:12:20,099 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| 1)) (forall ((v_subst_1 Int) (v_ArrVal_741 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| 0)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_ArrVal_741))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_subst_1))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| Int)) (or (forall ((v_ArrVal_743 (Array Int Int))) (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_ArrVal_743))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| 1)))))) is different from false [2025-03-08 18:12:20,111 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:12:20,112 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:12:20,190 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-03-08 18:12:20,190 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 171 treesize of output 200 [2025-03-08 18:12:20,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:12:20,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 238 treesize of output 234 [2025-03-08 18:12:20,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 175 [2025-03-08 18:12:20,213 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:12:20,213 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:12:20,278 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-03-08 18:12:20,278 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 373 treesize of output 360 [2025-03-08 18:12:20,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:12:20,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 358 treesize of output 330 [2025-03-08 18:12:20,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 289 treesize of output 277 [2025-03-08 18:12:20,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-08 18:12:20,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-08 18:12:21,033 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:12:21,034 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:12:21,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:12:21,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 120 [2025-03-08 18:12:21,089 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:12:21,089 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:12:21,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:12:21,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 73 [2025-03-08 18:12:21,215 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 1 not checked. [2025-03-08 18:12:21,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943015211] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 18:12:21,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 18:12:21,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 10] total 27 [2025-03-08 18:12:21,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895972735] [2025-03-08 18:12:21,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 18:12:21,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 18:12:21,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:12:21,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 18:12:21,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=505, Unknown=27, NotChecked=94, Total=702 [2025-03-08 18:12:21,216 INFO L87 Difference]: Start difference. First operand 299 states and 399 transitions. Second operand has 27 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 10 states have call successors, (23), 5 states have call predecessors, (23), 8 states have return successors, (22), 8 states have call predecessors, (22), 10 states have call successors, (22) [2025-03-08 18:12:30,802 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-08 18:12:31,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]