./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d60183102582204ad3b2c5c2967c5e39411556c79eb47cc4f179f5b1b7f07a77 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:52:11,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:52:11,840 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 01:52:11,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:52:11,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:52:11,863 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:52:11,868 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:52:11,868 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:52:11,868 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:52:11,868 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:52:11,868 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:52:11,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:52:11,869 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:52:11,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:52:11,869 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:52:11,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:52:11,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:52:11,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:52:11,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:52:11,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:52:11,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:52:11,869 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:52:11,869 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:52:11,869 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:52:11,869 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:52:11,869 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:52:11,869 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:52:11,869 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:52:11,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:52:11,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:52:11,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:52:11,870 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:52:11,870 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:52:11,870 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:52:11,870 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:52:11,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:52:11,870 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:52:11,870 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:52:11,870 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:52:11,870 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:52:11,870 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d60183102582204ad3b2c5c2967c5e39411556c79eb47cc4f179f5b1b7f07a77 [2025-02-08 01:52:12,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:52:12,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:52:12,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:52:12,089 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:52:12,090 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:52:12,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i [2025-02-08 01:52:13,217 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be513d238/9ea3114c3a234eae90b56065450325c5/FLAGe5f8313da [2025-02-08 01:52:13,677 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:52:13,678 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i [2025-02-08 01:52:13,711 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be513d238/9ea3114c3a234eae90b56065450325c5/FLAGe5f8313da [2025-02-08 01:52:13,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be513d238/9ea3114c3a234eae90b56065450325c5 [2025-02-08 01:52:13,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:52:13,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:52:13,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:52:13,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:52:13,806 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:52:13,807 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:52:13" (1/1) ... [2025-02-08 01:52:13,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5614e273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:13, skipping insertion in model container [2025-02-08 01:52:13,808 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:52:13" (1/1) ... [2025-02-08 01:52:13,876 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:52:14,092 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i[4495,4508] [2025-02-08 01:52:14,098 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i[4555,4568] [2025-02-08 01:52:15,030 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:15,031 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:15,031 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:15,031 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:15,032 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:15,046 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:15,048 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:15,051 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:15,052 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:15,053 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:15,056 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:15,056 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:15,057 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:15,414 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i[150660,150673] [2025-02-08 01:52:15,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:52:15,431 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:52:15,445 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i[4495,4508] [2025-02-08 01:52:15,446 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i[4555,4568] [2025-02-08 01:52:15,491 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:15,494 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:15,495 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:15,495 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:15,496 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:15,508 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:15,509 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:15,509 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:15,514 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:15,515 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:15,515 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:15,515 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:15,516 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:15,586 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i[150660,150673] [2025-02-08 01:52:15,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:52:15,707 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:52:15,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:15 WrapperNode [2025-02-08 01:52:15,708 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:52:15,709 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:52:15,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:52:15,710 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:52:15,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:15" (1/1) ... [2025-02-08 01:52:15,781 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:15" (1/1) ... [2025-02-08 01:52:15,806 INFO L138 Inliner]: procedures = 668, calls = 1043, calls flagged for inlining = 51, calls inlined = 5, statements flattened = 129 [2025-02-08 01:52:15,807 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:52:15,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:52:15,808 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:52:15,808 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:52:15,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:15" (1/1) ... [2025-02-08 01:52:15,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:15" (1/1) ... [2025-02-08 01:52:15,818 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:15" (1/1) ... [2025-02-08 01:52:15,838 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 5, 20]. 74 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2025-02-08 01:52:15,840 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:15" (1/1) ... [2025-02-08 01:52:15,840 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:15" (1/1) ... [2025-02-08 01:52:15,851 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:15" (1/1) ... [2025-02-08 01:52:15,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:15" (1/1) ... [2025-02-08 01:52:15,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:15" (1/1) ... [2025-02-08 01:52:15,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:15" (1/1) ... [2025-02-08 01:52:15,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:52:15,865 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:52:15,865 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:52:15,865 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:52:15,868 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:15" (1/1) ... [2025-02-08 01:52:15,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:52:15,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:52:15,895 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:52:15,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:52:15,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 01:52:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 01:52:15,916 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 01:52:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-02-08 01:52:15,916 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-02-08 01:52:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:52:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-02-08 01:52:15,916 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-02-08 01:52:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:52:15,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 01:52:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 01:52:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 01:52:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_front [2025-02-08 01:52:15,918 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_front [2025-02-08 01:52:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:52:15,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:52:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2025-02-08 01:52:15,918 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2025-02-08 01:52:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 01:52:15,918 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 01:52:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 01:52:15,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 01:52:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 01:52:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 01:52:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 01:52:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 01:52:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 01:52:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-02-08 01:52:15,920 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-02-08 01:52:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-02-08 01:52:15,920 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-02-08 01:52:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:52:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:52:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 01:52:16,085 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:52:16,087 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:52:16,126 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4729: havoc #t~mem317.base, #t~mem317.offset;havoc #t~short318;havoc #t~mem319.base, #t~mem319.offset;havoc #t~mem320.base, #t~mem320.offset;havoc #t~short321; [2025-02-08 01:52:16,129 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-02-08 01:52:16,150 INFO L1324 $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-02-08 01:52:16,278 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700-1: #t~ret311#1 := aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret322#1, aws_linked_list_is_valid_deep_#t~mem323#1.base, aws_linked_list_is_valid_deep_#t~mem323#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;havoc aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := (if 0 == #t~ret311#1 % 256 then 0 else 1);havoc #t~ret311#1; [2025-02-08 01:52:16,278 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-02-08 01:52:16,290 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4685: havoc #t~mem302.base, #t~mem302.offset; [2025-02-08 01:52:16,312 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2025-02-08 01:52:16,312 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:52:16,322 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:52:16,323 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:52:16,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:52:16 BoogieIcfgContainer [2025-02-08 01:52:16,323 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:52:16,325 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:52:16,325 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:52:16,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:52:16,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:52:13" (1/3) ... [2025-02-08 01:52:16,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70d1c3ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:52:16, skipping insertion in model container [2025-02-08 01:52:16,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:15" (2/3) ... [2025-02-08 01:52:16,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70d1c3ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:52:16, skipping insertion in model container [2025-02-08 01:52:16,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:52:16" (3/3) ... [2025-02-08 01:52:16,329 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_front_harness.i [2025-02-08 01:52:16,342 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:52:16,344 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_front_harness.i that has 9 procedures, 93 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-08 01:52:16,377 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:52:16,385 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;@2caef356, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:52:16,385 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 01:52:16,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 58 states have (on average 1.293103448275862) internal successors, (75), 60 states have internal predecessors, (75), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-08 01:52:16,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-08 01:52:16,392 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:16,393 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:16,393 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:16,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:16,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1643575472, now seen corresponding path program 1 times [2025-02-08 01:52:16,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:16,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103469093] [2025-02-08 01:52:16,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:16,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:16,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 01:52:16,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 01:52:16,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:16,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:16,697 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-02-08 01:52:16,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:16,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103469093] [2025-02-08 01:52:16,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103469093] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:52:16,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576939217] [2025-02-08 01:52:16,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:16,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:52:16,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:52:16,701 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:52:16,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 01:52:16,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 01:52:16,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 01:52:16,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:16,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:16,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 01:52:16,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:52:16,891 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-02-08 01:52:16,892 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:52:16,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576939217] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:16,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:52:16,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-08 01:52:16,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214851790] [2025-02-08 01:52:16,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:16,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:52:16,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:16,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:52:16,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:52:16,912 INFO L87 Difference]: Start difference. First operand has 93 states, 58 states have (on average 1.293103448275862) internal successors, (75), 60 states have internal predecessors, (75), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-08 01:52:16,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:16,931 INFO L93 Difference]: Finished difference Result 179 states and 253 transitions. [2025-02-08 01:52:16,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:52:16,933 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 83 [2025-02-08 01:52:16,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:16,937 INFO L225 Difference]: With dead ends: 179 [2025-02-08 01:52:16,937 INFO L226 Difference]: Without dead ends: 83 [2025-02-08 01:52:16,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:52:16,943 INFO L435 NwaCegarLoop]: 121 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, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:16,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:52:16,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-08 01:52:16,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-02-08 01:52:16,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.196078431372549) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 8 states have call predecessors, (23), 8 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-08 01:52:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 106 transitions. [2025-02-08 01:52:16,979 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 106 transitions. Word has length 83 [2025-02-08 01:52:16,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:16,980 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 106 transitions. [2025-02-08 01:52:16,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-08 01:52:16,982 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2025-02-08 01:52:16,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-08 01:52:16,985 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:16,985 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:16,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 01:52:17,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-08 01:52:17,186 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:17,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:17,187 INFO L85 PathProgramCache]: Analyzing trace with hash -699240398, now seen corresponding path program 1 times [2025-02-08 01:52:17,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:17,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825533149] [2025-02-08 01:52:17,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:17,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:17,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 01:52:17,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 01:52:17,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:17,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:17,767 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 01:52:17,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:17,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825533149] [2025-02-08 01:52:17,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825533149] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:52:17,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037832185] [2025-02-08 01:52:17,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:17,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:52:17,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:52:17,771 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:52:17,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 01:52:17,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 01:52:17,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 01:52:17,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:17,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:17,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-02-08 01:52:17,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:52:18,093 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-02-08 01:52:18,098 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 16 treesize of output 17 [2025-02-08 01:52:19,521 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 44 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-08 01:52:19,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:52:32,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 156 [2025-02-08 01:52:32,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:32,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:32,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2025-02-08 01:52:32,420 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 01:52:32,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037832185] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:52:32,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:52:32,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [6, 16] total 33 [2025-02-08 01:52:32,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747200602] [2025-02-08 01:52:32,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:32,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 01:52:32,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:32,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 01:52:32,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=948, Unknown=3, NotChecked=0, Total=1056 [2025-02-08 01:52:32,422 INFO L87 Difference]: Start difference. First operand 83 states and 106 transitions. Second operand has 17 states, 15 states have (on average 2.6) internal successors, (39), 13 states have internal predecessors, (39), 7 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-02-08 01:52:32,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:32,854 INFO L93 Difference]: Finished difference Result 149 states and 195 transitions. [2025-02-08 01:52:32,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 01:52:32,854 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.6) internal successors, (39), 13 states have internal predecessors, (39), 7 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) Word has length 83 [2025-02-08 01:52:32,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:32,855 INFO L225 Difference]: With dead ends: 149 [2025-02-08 01:52:32,855 INFO L226 Difference]: Without dead ends: 84 [2025-02-08 01:52:32,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 131 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=115, Invalid=1072, Unknown=3, NotChecked=0, Total=1190 [2025-02-08 01:52:32,857 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 4 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:32,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1323 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 01:52:32,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-08 01:52:32,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-02-08 01:52:32,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 53 states have internal predecessors, (62), 23 states have call successors, (23), 8 states have call predecessors, (23), 8 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-08 01:52:32,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2025-02-08 01:52:32,872 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 83 [2025-02-08 01:52:32,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:32,873 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2025-02-08 01:52:32,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.6) internal successors, (39), 13 states have internal predecessors, (39), 7 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-02-08 01:52:32,874 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2025-02-08 01:52:32,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 01:52:32,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:32,875 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:32,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 01:52:33,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:52:33,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:33,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:33,082 INFO L85 PathProgramCache]: Analyzing trace with hash 207382717, now seen corresponding path program 1 times [2025-02-08 01:52:33,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:33,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532286993] [2025-02-08 01:52:33,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:33,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:33,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 01:52:33,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 01:52:33,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:33,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:33,444 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-08 01:52:33,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:33,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532286993] [2025-02-08 01:52:33,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532286993] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:52:33,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816902954] [2025-02-08 01:52:33,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:33,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:52:33,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:52:33,447 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:52:33,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 01:52:33,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 01:52:33,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 01:52:33,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:33,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:33,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-02-08 01:52:33,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:52:33,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 01:52:33,693 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-02-08 01:52:33,708 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-02-08 01:52:33,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:33,746 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-02-08 01:52:33,762 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 01:52:33,762 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 1 case distinctions, treesize of input 18 treesize of output 17 [2025-02-08 01:52:33,770 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 7 treesize of output 3 [2025-02-08 01:52:33,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:33,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:33,777 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-02-08 01:52:33,796 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 01:52:33,796 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 1 case distinctions, treesize of input 34 treesize of output 29 [2025-02-08 01:52:33,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:33,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:33,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2025-02-08 01:52:33,835 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 01:52:33,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2025-02-08 01:52:33,901 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2025-02-08 01:52:33,902 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 124 treesize of output 126 [2025-02-08 01:52:33,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:33,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:33,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:33,915 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 106 treesize of output 102 [2025-02-08 01:52:33,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:33,923 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 38 treesize of output 35 [2025-02-08 01:52:33,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 13 [2025-02-08 01:52:36,935 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 53 proven. 9 refuted. 4 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 01:52:36,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:52:37,344 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_front_harness_~#list~0#1.offset|))) (and (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_245 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_249))) (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_ArrVal_245))) |c_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_246 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_246))) (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_front_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2025-02-08 01:52:37,482 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:52:37,485 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:52:37,532 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-02-08 01:52:37,533 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 173 treesize of output 202 [2025-02-08 01:52:37,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:52:37,548 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 222 treesize of output 222 [2025-02-08 01:52:37,559 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 189 treesize of output 177 [2025-02-08 01:52:37,574 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:52:37,574 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:52:37,625 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-02-08 01:52:37,625 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 375 treesize of output 362 [2025-02-08 01:52:37,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:52:37,645 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 360 treesize of output 332 [2025-02-08 01:52:37,655 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 291 treesize of output 279 [2025-02-08 01:52:37,674 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-02-08 01:52:37,701 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-02-08 01:52:38,026 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:52:38,027 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:52:38,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:52:38,040 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 207 treesize of output 215 [2025-02-08 01:52:39,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:52:39,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 591 treesize of output 543 [2025-02-08 01:52:40,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816902954] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:52:40,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:52:40,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 16] total 21 [2025-02-08 01:52:40,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325751521] [2025-02-08 01:52:40,005 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 01:52:40,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 01:52:40,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:40,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 01:52:40,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=693, Unknown=37, NotChecked=54, Total=870 [2025-02-08 01:52:40,007 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand has 21 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 9 states have call successors, (24), 7 states have call predecessors, (24), 8 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2025-02-08 01:52:44,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 01:52:48,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 01:52:52,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 01:52:57,552 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-02-08 01:53:05,871 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-02-08 01:53:11,023 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-02-08 01:53:19,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 01:53:23,692 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-02-08 01:53:27,810 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-02-08 01:53:31,857 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-02-08 01:53:35,879 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-02-08 01:53:39,930 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-02-08 01:53:44,009 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-02-08 01:53:48,425 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-02-08 01:53:52,871 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]