./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_begin_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 157f0d22bcc200e95b6696425fc806db58856d3eb89fc5de304f6d82594c0bb3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 17:20:07,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 17:20:07,725 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 17:20:07,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 17:20:07,731 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 17:20:07,744 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 17:20:07,745 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 17:20:07,745 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 17:20:07,745 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 17:20:07,746 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 17:20:07,746 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 17:20:07,746 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 17:20:07,746 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 17:20:07,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 17:20:07,747 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 17:20:07,747 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 17:20:07,747 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 17:20:07,747 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 17:20:07,747 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 17:20:07,748 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 17:20:07,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 17:20:07,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 17:20:07,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 17:20:07,748 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 17:20:07,748 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 17:20:07,748 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 17:20:07,748 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:20:07,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:20:07,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:20:07,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:20:07,749 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 17:20:07,749 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:20:07,749 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:20:07,749 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:20:07,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:20:07,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 17:20:07,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 17:20:07,749 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 17:20:07,749 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 17:20:07,749 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 17:20:07,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 17:20:07,749 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 17:20:07,749 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 17:20:07,749 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 17:20:07,749 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 17:20:07,749 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 -> 157f0d22bcc200e95b6696425fc806db58856d3eb89fc5de304f6d82594c0bb3 [2025-01-09 17:20:07,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 17:20:07,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 17:20:07,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 17:20:07,993 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 17:20:07,993 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 17:20:07,995 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_begin_harness.i [2025-01-09 17:20:09,262 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4482836cc/d89e83ab89c24ec3aab47d4e82f75cb2/FLAG4d55e4443 [2025-01-09 17:20:09,639 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 17:20:09,639 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness.i [2025-01-09 17:20:09,665 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4482836cc/d89e83ab89c24ec3aab47d4e82f75cb2/FLAG4d55e4443 [2025-01-09 17:20:09,679 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4482836cc/d89e83ab89c24ec3aab47d4e82f75cb2 [2025-01-09 17:20:09,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 17:20:09,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 17:20:09,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 17:20:09,683 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 17:20:09,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 17:20:09,687 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:20:09" (1/1) ... [2025-01-09 17:20:09,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bc8c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:09, skipping insertion in model container [2025-01-09 17:20:09,688 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:20:09" (1/1) ... [2025-01-09 17:20:09,752 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 17:20:09,961 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_begin_harness.i[4495,4508] [2025-01-09 17:20:09,968 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_begin_harness.i[4555,4568] [2025-01-09 17:20:10,456 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,457 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,457 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,457 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,458 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,466 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,467 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,468 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,469 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,470 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,470 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,471 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,471 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,755 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_begin_harness.i[150472,150485] [2025-01-09 17:20:10,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:20:10,768 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 17:20:10,781 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_begin_harness.i[4495,4508] [2025-01-09 17:20:10,781 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_begin_harness.i[4555,4568] [2025-01-09 17:20:10,814 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,815 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,815 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,815 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,815 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,826 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,827 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,827 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,828 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,828 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,829 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,829 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,829 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,891 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_begin_harness.i[150472,150485] [2025-01-09 17:20:10,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:20:11,008 INFO L204 MainTranslator]: Completed translation [2025-01-09 17:20:11,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11 WrapperNode [2025-01-09 17:20:11,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 17:20:11,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 17:20:11,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 17:20:11,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 17:20:11,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (1/1) ... [2025-01-09 17:20:11,066 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (1/1) ... [2025-01-09 17:20:11,108 INFO L138 Inliner]: procedures = 668, calls = 1039, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 137 [2025-01-09 17:20:11,108 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 17:20:11,109 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 17:20:11,109 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 17:20:11,109 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 17:20:11,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (1/1) ... [2025-01-09 17:20:11,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (1/1) ... [2025-01-09 17:20:11,121 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (1/1) ... [2025-01-09 17:20:11,143 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 5, 17]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2025-01-09 17:20:11,143 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (1/1) ... [2025-01-09 17:20:11,143 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (1/1) ... [2025-01-09 17:20:11,154 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (1/1) ... [2025-01-09 17:20:11,155 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (1/1) ... [2025-01-09 17:20:11,157 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (1/1) ... [2025-01-09 17:20:11,159 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (1/1) ... [2025-01-09 17:20:11,160 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (1/1) ... [2025-01-09 17:20:11,162 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 17:20:11,166 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 17:20:11,166 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 17:20:11,166 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 17:20:11,166 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (1/1) ... [2025-01-09 17:20:11,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:20:11,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:11,195 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-01-09 17:20:11,197 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-01-09 17:20:11,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 17:20:11,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 17:20:11,216 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 17:20:11,216 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-01-09 17:20:11,216 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-01-09 17:20:11,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 17:20:11,216 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-01-09 17:20:11,216 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-01-09 17:20:11,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 17:20:11,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 17:20:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 17:20:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 17:20:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 17:20:11,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 17:20:11,217 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 17:20:11,218 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 17:20:11,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 17:20:11,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 17:20:11,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 17:20:11,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 17:20:11,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 17:20:11,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 17:20:11,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 17:20:11,218 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-01-09 17:20:11,218 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-01-09 17:20:11,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 17:20:11,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 17:20:11,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 17:20:11,388 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 17:20:11,390 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 17:20:11,598 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-01-09 17:20:11,598 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 17:20:11,607 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 17:20:11,607 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 17:20:11,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:20:11 BoogieIcfgContainer [2025-01-09 17:20:11,608 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 17:20:11,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 17:20:11,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 17:20:11,612 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 17:20:11,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:20:09" (1/3) ... [2025-01-09 17:20:11,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d89aa2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:20:11, skipping insertion in model container [2025-01-09 17:20:11,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (2/3) ... [2025-01-09 17:20:11,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d89aa2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:20:11, skipping insertion in model container [2025-01-09 17:20:11,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:20:11" (3/3) ... [2025-01-09 17:20:11,614 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_begin_harness.i [2025-01-09 17:20:11,625 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 17:20:11,626 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_begin_harness.i that has 6 procedures, 67 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 17:20:11,665 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 17:20:11,673 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;@6e432e02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 17:20:11,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 17:20:11,676 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 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-01-09 17:20:11,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 17:20:11,682 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:11,683 INFO L218 NwaCegarLoop]: trace histogram [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-01-09 17:20:11,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:11,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:11,688 INFO L85 PathProgramCache]: Analyzing trace with hash -810565289, now seen corresponding path program 1 times [2025-01-09 17:20:11,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:11,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512047007] [2025-01-09 17:20:11,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:11,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:11,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 17:20:11,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 17:20:11,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:11,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 17:20:12,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:12,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512047007] [2025-01-09 17:20:12,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512047007] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:12,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452649876] [2025-01-09 17:20:12,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:12,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:12,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:12,022 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-01-09 17:20:12,044 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-01-09 17:20:12,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 17:20:12,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 17:20:12,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:12,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:12,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 17:20:12,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:12,199 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 17:20:12,199 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:20:12,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452649876] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:12,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:20:12,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 17:20:12,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101592081] [2025-01-09 17:20:12,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:12,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 17:20:12,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:12,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 17:20:12,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 17:20:12,219 INFO L87 Difference]: Start difference. First operand has 67 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 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.0) internal successors, (28), 2 states have internal predecessors, (28), 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-01-09 17:20:12,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:12,234 INFO L93 Difference]: Finished difference Result 126 states and 174 transitions. [2025-01-09 17:20:12,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 17:20:12,236 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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 67 [2025-01-09 17:20:12,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:12,241 INFO L225 Difference]: With dead ends: 126 [2025-01-09 17:20:12,241 INFO L226 Difference]: Without dead ends: 62 [2025-01-09 17:20:12,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-01-09 17:20:12,247 INFO L435 NwaCegarLoop]: 86 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, 86 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-01-09 17:20:12,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:20:12,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-09 17:20:12,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-01-09 17:20:12,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.302325581395349) internal successors, (56), 44 states have internal predecessors, (56), 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-01-09 17:20:12,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 81 transitions. [2025-01-09 17:20:12,286 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 81 transitions. Word has length 67 [2025-01-09 17:20:12,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:12,286 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 81 transitions. [2025-01-09 17:20:12,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-01-09 17:20:12,287 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2025-01-09 17:20:12,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 17:20:12,290 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:12,291 INFO L218 NwaCegarLoop]: trace histogram [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-01-09 17:20:12,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 17:20:12,491 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-01-09 17:20:12,492 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:12,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:12,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2071123345, now seen corresponding path program 1 times [2025-01-09 17:20:12,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:12,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294119500] [2025-01-09 17:20:12,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:12,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:12,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 17:20:12,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 17:20:12,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:12,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:13,068 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 17:20:13,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:13,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294119500] [2025-01-09 17:20:13,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294119500] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:13,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099829156] [2025-01-09 17:20:13,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:13,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:13,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:13,071 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-01-09 17:20:13,073 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-01-09 17:20:13,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 17:20:13,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 17:20:13,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:13,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:13,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 17:20:13,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:13,300 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-01-09 17:20:13,319 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-01-09 17:20:13,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:13,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:13,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2025-01-09 17:20:13,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:13,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:13,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:13,407 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 57 treesize of output 25 [2025-01-09 17:20:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 17:20:13,940 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:20:13,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099829156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:13,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:20:13,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2025-01-09 17:20:13,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172989100] [2025-01-09 17:20:13,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:13,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 17:20:13,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:13,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 17:20:13,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 17:20:13,942 INFO L87 Difference]: Start difference. First operand 62 states and 81 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 17:20:14,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:14,370 INFO L93 Difference]: Finished difference Result 170 states and 230 transitions. [2025-01-09 17:20:14,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 17:20:14,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 67 [2025-01-09 17:20:14,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:14,373 INFO L225 Difference]: With dead ends: 170 [2025-01-09 17:20:14,374 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 17:20:14,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-01-09 17:20:14,376 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 69 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:14,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 308 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 17:20:14,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 17:20:14,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2025-01-09 17:20:14,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 84 states have internal predecessors, (108), 24 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2025-01-09 17:20:14,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 156 transitions. [2025-01-09 17:20:14,401 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 156 transitions. Word has length 67 [2025-01-09 17:20:14,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:14,401 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 156 transitions. [2025-01-09 17:20:14,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 17:20:14,401 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 156 transitions. [2025-01-09 17:20:14,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 17:20:14,403 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:14,403 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 17:20:14,410 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-01-09 17:20:14,603 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-01-09 17:20:14,604 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:14,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:14,604 INFO L85 PathProgramCache]: Analyzing trace with hash 21735503, now seen corresponding path program 1 times [2025-01-09 17:20:14,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:14,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311541580] [2025-01-09 17:20:14,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:14,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:14,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 17:20:14,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 17:20:14,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:14,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:14,894 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 17:20:14,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:14,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311541580] [2025-01-09 17:20:14,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311541580] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:14,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856474473] [2025-01-09 17:20:14,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:14,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:14,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:14,898 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-01-09 17:20:14,900 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-01-09 17:20:14,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 17:20:15,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 17:20:15,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:15,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:15,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-01-09 17:20:15,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:15,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-01-09 17:20:15,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-01-09 17:20:15,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:20:15,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 28 [2025-01-09 17:20:15,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2025-01-09 17:20:15,844 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 17:20:15,844 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:20:15,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856474473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:15,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:20:15,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2025-01-09 17:20:15,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544476404] [2025-01-09 17:20:15,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:15,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 17:20:15,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:15,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 17:20:15,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 17:20:15,846 INFO L87 Difference]: Start difference. First operand 116 states and 156 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 17:20:16,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:16,379 INFO L93 Difference]: Finished difference Result 170 states and 227 transitions. [2025-01-09 17:20:16,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 17:20:16,379 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 67 [2025-01-09 17:20:16,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:16,381 INFO L225 Difference]: With dead ends: 170 [2025-01-09 17:20:16,381 INFO L226 Difference]: Without dead ends: 118 [2025-01-09 17:20:16,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-01-09 17:20:16,383 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 60 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:16,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 385 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 17:20:16,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-01-09 17:20:16,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2025-01-09 17:20:16,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 80 states have (on average 1.325) internal successors, (106), 82 states have internal predecessors, (106), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 17:20:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 152 transitions. [2025-01-09 17:20:16,400 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 152 transitions. Word has length 67 [2025-01-09 17:20:16,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:16,400 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 152 transitions. [2025-01-09 17:20:16,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 17:20:16,401 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 152 transitions. [2025-01-09 17:20:16,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 17:20:16,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:16,403 INFO L218 NwaCegarLoop]: trace histogram [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-01-09 17:20:16,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 17:20:16,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:16,607 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:16,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:16,607 INFO L85 PathProgramCache]: Analyzing trace with hash -725571509, now seen corresponding path program 1 times [2025-01-09 17:20:16,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:16,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043670831] [2025-01-09 17:20:16,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:16,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:16,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 17:20:16,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 17:20:16,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:16,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:16,881 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 17:20:16,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:16,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043670831] [2025-01-09 17:20:16,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043670831] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:16,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049717670] [2025-01-09 17:20:16,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:16,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:16,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:16,885 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:20:16,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 17:20:16,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 17:20:17,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 17:20:17,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:17,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:17,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 17:20:17,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:17,115 INFO L349 Elim1Store]: treesize reduction 66, result has 39.4 percent of original size [2025-01-09 17:20:17,115 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-01-09 17:20:17,125 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-01-09 17:20:17,194 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 17:20:17,195 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-01-09 17:20:17,199 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-01-09 17:20:21,283 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10| v_DerPreprocessor_2) .cse0))) (and (= .cse1 (select |c_#memory_$Pointer$#2.base| .cse0)) (= v_DerPreprocessor_2 (store .cse1 .cse2 .cse0)))))))))))) is different from true [2025-01-09 17:20:51,565 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_aws_linked_list_begin_~list#1.offset| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base|) .cse8))) (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10| v_DerPreprocessor_2) .cse0))) (and (= .cse1 (select |c_#memory_$Pointer$#2.base| .cse0)) (= v_DerPreprocessor_2 (store .cse1 .cse2 .cse0)))))))))))) (<= |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base| .cse3) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|) .cse6))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| .cse4) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_2) .cse4))) (and (= v_DerPreprocessor_2 (store .cse5 .cse6 .cse4)) (= .cse5 (select |c_#memory_$Pointer$#2.base| .cse4))))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|)))) (<= 2 |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base|) (or (= .cse3 |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base|) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base| v_DerPreprocessor_2) .cse3))) (and (= (store .cse7 .cse8 .cse3) v_DerPreprocessor_2) (= (select |c_#memory_$Pointer$#2.base| .cse3) .cse7)))))))) is different from true [2025-01-09 17:20:55,631 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10| v_DerPreprocessor_2) .cse0))) (and (= .cse1 (select |c_#memory_$Pointer$#2.base| .cse0)) (= v_DerPreprocessor_2 (store .cse1 .cse2 .cse0)))))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|) .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_2) .cse3))) (and (= v_DerPreprocessor_2 (store .cse4 .cse5 .cse3)) (= .cse4 (select |c_#memory_$Pointer$#2.base| .cse3))))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_2| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_2| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2|) .cse8))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2| .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2| v_DerPreprocessor_2) .cse6))) (and (= (select |c_#memory_$Pointer$#2.base| .cse6) .cse7) (= (store .cse7 .cse8 .cse6) v_DerPreprocessor_2)))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_2| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_2| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2|))))) is different from true [2025-01-09 17:21:00,353 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10| v_DerPreprocessor_2) .cse0))) (and (= .cse1 (select |c_#memory_$Pointer$#2.base| .cse0)) (= v_DerPreprocessor_2 (store .cse1 .cse2 .cse0)))))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_3| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_3| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_3| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_3|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_3| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_3| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_3| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_3|) .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_3| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_3| v_DerPreprocessor_2) .cse3))) (and (= v_DerPreprocessor_2 (store .cse4 .cse5 .cse3)) (= .cse4 (select |c_#memory_$Pointer$#2.base| .cse3))))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_3|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|) .cse8))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_2) .cse6))) (and (= v_DerPreprocessor_2 (store .cse7 .cse8 .cse6)) (= .cse7 (select |c_#memory_$Pointer$#2.base| .cse6))))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2|) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_2| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_2| 24))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2|) .cse11))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2| .cse9) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_$Pointer$#2.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2| v_DerPreprocessor_2) .cse9))) (and (= (select |c_#memory_$Pointer$#2.base| .cse9) .cse10) (= (store .cse10 .cse11 .cse9) v_DerPreprocessor_2)))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_2| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_2| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_2|))))) is different from true [2025-01-09 17:21:35,249 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 37 not checked. [2025-01-09 17:21:35,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:21:35,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:35,637 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 232 [2025-01-09 17:21:35,642 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-01-09 17:21:35,680 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 129 treesize of output 117 [2025-01-09 17:21:46,576 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 17:21:46,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049717670] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 17:21:46,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 17:21:46,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6, 20] total 33 [2025-01-09 17:21:46,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831054540] [2025-01-09 17:21:46,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:21:46,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 17:21:46,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:21:46,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 17:21:46,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=658, Unknown=69, NotChecked=228, Total=1056 [2025-01-09 17:21:46,577 INFO L87 Difference]: Start difference. First operand 114 states and 152 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7)