./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_swap_contents_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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_swap_contents_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 021ac35396c67703f42c73aa20a3d08d3b8ea81bc00c2712290e90099f1c0b85 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 05:18:09,940 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 05:18:10,002 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 05:18:10,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 05:18:10,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 05:18:10,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 05:18:10,036 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 05:18:10,036 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 05:18:10,037 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 05:18:10,037 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 05:18:10,037 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 05:18:10,037 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 05:18:10,037 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 05:18:10,037 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 05:18:10,037 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 05:18:10,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 05:18:10,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 05:18:10,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 05:18:10,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 05:18:10,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 05:18:10,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 05:18:10,038 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 05:18:10,038 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 05:18:10,038 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 05:18:10,038 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 05:18:10,038 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 05:18:10,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 05:18:10,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 05:18:10,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 05:18:10,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:18:10,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 05:18:10,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 05:18:10,038 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 05:18:10,038 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 05:18:10,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 05:18:10,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 05:18:10,038 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 05:18:10,038 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 05:18:10,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 05:18:10,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 05:18:10,038 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 -> 021ac35396c67703f42c73aa20a3d08d3b8ea81bc00c2712290e90099f1c0b85 [2025-02-06 05:18:10,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 05:18:10,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 05:18:10,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 05:18:10,301 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 05:18:10,301 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 05:18:10,302 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_swap_contents_harness.i [2025-02-06 05:18:11,453 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0407f652/8da8f4ddf092451c9259aecf7e30ecac/FLAG8be59fa5d [2025-02-06 05:18:11,993 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 05:18:11,994 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_swap_contents_harness.i [2025-02-06 05:18:12,024 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0407f652/8da8f4ddf092451c9259aecf7e30ecac/FLAG8be59fa5d [2025-02-06 05:18:12,040 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0407f652/8da8f4ddf092451c9259aecf7e30ecac [2025-02-06 05:18:12,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 05:18:12,043 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 05:18:12,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 05:18:12,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 05:18:12,047 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 05:18:12,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:18:12" (1/1) ... [2025-02-06 05:18:12,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56586d87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:18:12, skipping insertion in model container [2025-02-06 05:18:12,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:18:12" (1/1) ... [2025-02-06 05:18:12,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 05:18:12,306 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_swap_contents_harness.i[4503,4516] [2025-02-06 05:18:12,313 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_swap_contents_harness.i[4563,4576] [2025-02-06 05:18:12,755 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:18:12,759 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:18:12,759 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:18:12,760 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:18:12,760 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:18:12,771 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:18:12,772 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:18:12,773 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:18:12,773 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:18:12,774 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:18:12,775 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:18:12,775 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:18:12,775 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:18:13,062 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_swap_contents_harness.i[151109,151122] [2025-02-06 05:18:13,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:18:13,078 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 05:18:13,086 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_swap_contents_harness.i[4503,4516] [2025-02-06 05:18:13,086 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_swap_contents_harness.i[4563,4576] [2025-02-06 05:18:13,119 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:18:13,119 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:18:13,120 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:18:13,120 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:18:13,120 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:18:13,125 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:18:13,125 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:18:13,126 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:18:13,126 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:18:13,127 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:18:13,127 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:18:13,127 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:18:13,127 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:18:13,180 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_swap_contents_harness.i[151109,151122] [2025-02-06 05:18:13,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:18:13,304 INFO L204 MainTranslator]: Completed translation [2025-02-06 05:18:13,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:18:13 WrapperNode [2025-02-06 05:18:13,306 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 05:18:13,307 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 05:18:13,307 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 05:18:13,307 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 05:18:13,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:18:13" (1/1) ... [2025-02-06 05:18:13,340 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:18:13" (1/1) ... [2025-02-06 05:18:13,360 INFO L138 Inliner]: procedures = 668, calls = 1078, calls flagged for inlining = 52, calls inlined = 5, statements flattened = 210 [2025-02-06 05:18:13,360 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 05:18:13,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 05:18:13,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 05:18:13,361 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 05:18:13,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:18:13" (1/1) ... [2025-02-06 05:18:13,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:18:13" (1/1) ... [2025-02-06 05:18:13,369 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:18:13" (1/1) ... [2025-02-06 05:18:13,396 INFO L175 MemorySlicer]: Split 68 memory accesses to 5 slices as follows [2, 47, 5, 7, 7]. 69 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 0, 5, 4, 4]. The 18 writes are split as follows [0, 18, 0, 0, 0]. [2025-02-06 05:18:13,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:18:13" (1/1) ... [2025-02-06 05:18:13,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:18:13" (1/1) ... [2025-02-06 05:18:13,406 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:18:13" (1/1) ... [2025-02-06 05:18:13,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:18:13" (1/1) ... [2025-02-06 05:18:13,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:18:13" (1/1) ... [2025-02-06 05:18:13,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:18:13" (1/1) ... [2025-02-06 05:18:13,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 05:18:13,419 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 05:18:13,419 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 05:18:13,419 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 05:18:13,421 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:18:13" (1/1) ... [2025-02-06 05:18:13,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:18:13,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:18:13,453 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-06 05:18:13,459 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-06 05:18:13,476 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_init [2025-02-06 05:18:13,476 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_init [2025-02-06 05:18:13,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 05:18:13,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 05:18:13,476 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 05:18:13,476 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-02-06 05:18:13,476 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-02-06 05:18:13,476 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_linked_list_is_allocated [2025-02-06 05:18:13,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_linked_list_is_allocated [2025-02-06 05:18:13,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 05:18:13,476 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-02-06 05:18:13,476 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-02-06 05:18:13,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 05:18:13,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 05:18:13,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 05:18:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 05:18:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 05:18:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 05:18:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 05:18:13,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 05:18:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2025-02-06 05:18:13,477 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2025-02-06 05:18:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 05:18:13,477 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 05:18:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 05:18:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 05:18:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 05:18:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 05:18:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 05:18:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 05:18:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 05:18:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 05:18:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 05:18:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-06 05:18:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-06 05:18:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-02-06 05:18:13,477 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-02-06 05:18:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 05:18:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 05:18:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 05:18:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 05:18:13,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 05:18:13,667 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 05:18:13,669 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 05:18:13,711 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-02-06 05:18:13,726 INFO L1309 $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-06 05:18:13,956 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-02-06 05:18:13,961 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4685: havoc #t~mem302.base, #t~mem302.offset; [2025-02-06 05:18:13,994 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2025-02-06 05:18:13,994 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 05:18:14,004 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 05:18:14,004 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 05:18:14,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:18:14 BoogieIcfgContainer [2025-02-06 05:18:14,005 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 05:18:14,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 05:18:14,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 05:18:14,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 05:18:14,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 05:18:12" (1/3) ... [2025-02-06 05:18:14,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ddc43c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:18:14, skipping insertion in model container [2025-02-06 05:18:14,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:18:13" (2/3) ... [2025-02-06 05:18:14,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ddc43c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:18:14, skipping insertion in model container [2025-02-06 05:18:14,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:18:14" (3/3) ... [2025-02-06 05:18:14,014 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_swap_contents_harness.i [2025-02-06 05:18:14,027 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 05:18:14,029 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_swap_contents_harness.i that has 9 procedures, 113 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-06 05:18:14,070 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 05:18:14,077 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;@c6110b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 05:18:14,078 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 05:18:14,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 72 states have internal predecessors, (88), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 05:18:14,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 05:18:14,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:18:14,088 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 05:18:14,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:18:14,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:18:14,092 INFO L85 PathProgramCache]: Analyzing trace with hash 574240824, now seen corresponding path program 1 times [2025-02-06 05:18:14,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:18:14,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813897840] [2025-02-06 05:18:14,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:14,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:18:14,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 05:18:14,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 05:18:14,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:14,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-02-06 05:18:14,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:18:14,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813897840] [2025-02-06 05:18:14,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813897840] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:18:14,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171322382] [2025-02-06 05:18:14,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:14,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:14,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:18:14,456 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-06 05:18:14,461 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-06 05:18:14,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 05:18:14,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 05:18:14,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:14,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:14,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 05:18:14,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:18:14,775 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-02-06 05:18:14,778 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:18:14,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171322382] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:18:14,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:18:14,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 05:18:14,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696487857] [2025-02-06 05:18:14,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:18:14,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 05:18:14,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:18:14,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 05:18:14,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 05:18:14,802 INFO L87 Difference]: Start difference. First operand has 113 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 72 states have internal predecessors, (88), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 05:18:14,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:18:14,836 INFO L93 Difference]: Finished difference Result 223 states and 333 transitions. [2025-02-06 05:18:14,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 05:18:14,837 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 102 [2025-02-06 05:18:14,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:18:14,843 INFO L225 Difference]: With dead ends: 223 [2025-02-06 05:18:14,844 INFO L226 Difference]: Without dead ends: 106 [2025-02-06 05:18:14,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 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-06 05:18:14,849 INFO L435 NwaCegarLoop]: 154 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, 154 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-06 05:18:14,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:18:14,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-06 05:18:14,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-02-06 05:18:14,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 67 states have internal predecessors, (80), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-06 05:18:14,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 146 transitions. [2025-02-06 05:18:14,897 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 146 transitions. Word has length 102 [2025-02-06 05:18:14,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:18:14,897 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 146 transitions. [2025-02-06 05:18:14,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 05:18:14,898 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 146 transitions. [2025-02-06 05:18:14,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 05:18:14,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:18:14,904 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 05:18:14,914 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-02-06 05:18:15,104 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-06 05:18:15,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:18:15,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:18:15,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1274253083, now seen corresponding path program 1 times [2025-02-06 05:18:15,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:18:15,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569161191] [2025-02-06 05:18:15,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:15,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:18:15,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 05:18:15,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 05:18:15,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:15,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:17,325 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-02-06 05:18:17,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:18:17,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569161191] [2025-02-06 05:18:17,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569161191] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:18:17,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939897612] [2025-02-06 05:18:17,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:17,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:17,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:18:17,332 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-06 05:18:17,333 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-06 05:18:17,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 05:18:17,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 05:18:17,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:17,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:17,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-06 05:18:17,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:18:17,594 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 10 treesize of output 8 [2025-02-06 05:18:17,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-02-06 05:18:17,688 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-06 05:18:18,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:18:18,842 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 26 treesize of output 12 [2025-02-06 05:18:18,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:18,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:18:18,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2025-02-06 05:18:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 41 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-06 05:18:18,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:18:19,097 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_swap_contents_harness_~#b~0#1.base| v_ArrVal_568) |c_ULTIMATE.start_aws_linked_list_swap_contents_harness_~#a~0#1.base|) |c_ULTIMATE.start_aws_linked_list_swap_contents_harness_~#a~0#1.offset|) |c_ULTIMATE.start_aws_linked_list_swap_contents_harness_~#a~0#1.base|)) (forall ((v_ArrVal_569 (Array Int Int))) (= (+ |c_ULTIMATE.start_aws_linked_list_swap_contents_harness_~#a~0#1.offset| 16) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_aws_linked_list_swap_contents_harness_~#b~0#1.base| v_ArrVal_569) |c_ULTIMATE.start_aws_linked_list_swap_contents_harness_~#a~0#1.base|) |c_ULTIMATE.start_aws_linked_list_swap_contents_harness_~#a~0#1.offset|)))) is different from false [2025-02-06 05:18:19,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939897612] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:18:19,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 05:18:19,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 23 [2025-02-06 05:18:19,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132361920] [2025-02-06 05:18:19,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 05:18:19,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 05:18:19,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:18:19,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 05:18:19,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=528, Unknown=1, NotChecked=46, Total=650 [2025-02-06 05:18:19,100 INFO L87 Difference]: Start difference. First operand 106 states and 146 transitions. Second operand has 23 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 18 states have internal predecessors, (75), 13 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (23), 13 states have call predecessors, (23), 13 states have call successors, (23) [2025-02-06 05:18:21,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 05:18:23,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:18:23,227 INFO L93 Difference]: Finished difference Result 293 states and 411 transitions. [2025-02-06 05:18:23,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 05:18:23,228 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 18 states have internal predecessors, (75), 13 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (23), 13 states have call predecessors, (23), 13 states have call successors, (23) Word has length 102 [2025-02-06 05:18:23,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:18:23,231 INFO L225 Difference]: With dead ends: 293 [2025-02-06 05:18:23,231 INFO L226 Difference]: Without dead ends: 225 [2025-02-06 05:18:23,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 154 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=187, Invalid=1148, Unknown=1, NotChecked=70, Total=1406 [2025-02-06 05:18:23,232 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 201 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 2187 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 2322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 2187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-02-06 05:18:23,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 895 Invalid, 2322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 2187 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-02-06 05:18:23,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-02-06 05:18:23,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 209. [2025-02-06 05:18:23,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 124 states have (on average 1.282258064516129) internal successors, (159), 129 states have internal predecessors, (159), 69 states have call successors, (69), 16 states have call predecessors, (69), 15 states have return successors, (68), 63 states have call predecessors, (68), 65 states have call successors, (68) [2025-02-06 05:18:23,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 296 transitions. [2025-02-06 05:18:23,255 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 296 transitions. Word has length 102 [2025-02-06 05:18:23,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:18:23,255 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 296 transitions. [2025-02-06 05:18:23,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 18 states have internal predecessors, (75), 13 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (23), 13 states have call predecessors, (23), 13 states have call successors, (23) [2025-02-06 05:18:23,255 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 296 transitions. [2025-02-06 05:18:23,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 05:18:23,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:18:23,259 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-06 05:18:23,267 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-06 05:18:23,464 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-06 05:18:23,464 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:18:23,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:18:23,465 INFO L85 PathProgramCache]: Analyzing trace with hash -8021190, now seen corresponding path program 1 times [2025-02-06 05:18:23,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:18:23,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114688256] [2025-02-06 05:18:23,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:23,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:18:23,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 05:18:23,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 05:18:23,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:23,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:23,917 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-02-06 05:18:23,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:18:23,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114688256] [2025-02-06 05:18:23,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114688256] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:18:23,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666096791] [2025-02-06 05:18:23,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:18:23,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:23,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:18:23,921 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-06 05:18:23,922 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-06 05:18:24,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 05:18:24,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 05:18:24,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:18:24,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:24,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-06 05:18:24,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:18:24,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-02-06 05:18:24,251 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-06 05:18:25,637 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 05:18:25,637 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:18:25,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666096791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:18:25,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:18:25,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [6] total 20 [2025-02-06 05:18:25,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137592549] [2025-02-06 05:18:25,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:18:25,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 05:18:25,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:18:25,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 05:18:25,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-02-06 05:18:25,639 INFO L87 Difference]: Start difference. First operand 209 states and 296 transitions. Second operand has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 6 states have call successors, (14), 3 states have call predecessors, (14), 6 states have return successors, (13), 8 states have call predecessors, (13), 6 states have call successors, (13) [2025-02-06 05:18:26,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:18:26,647 INFO L93 Difference]: Finished difference Result 394 states and 546 transitions. [2025-02-06 05:18:26,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 05:18:26,648 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 6 states have call successors, (14), 3 states have call predecessors, (14), 6 states have return successors, (13), 8 states have call predecessors, (13), 6 states have call successors, (13) Word has length 103 [2025-02-06 05:18:26,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:18:26,651 INFO L225 Difference]: With dead ends: 394 [2025-02-06 05:18:26,651 INFO L226 Difference]: Without dead ends: 246 [2025-02-06 05:18:26,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 82 SyntacticMatches, 8 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 05:18:26,652 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 221 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 05:18:26,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 736 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 05:18:26,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-02-06 05:18:26,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2025-02-06 05:18:26,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 153 states have (on average 1.2875816993464053) internal successors, (197), 158 states have internal predecessors, (197), 72 states have call successors, (72), 21 states have call predecessors, (72), 19 states have return successors, (71), 65 states have call predecessors, (71), 68 states have call successors, (71) [2025-02-06 05:18:26,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 340 transitions. [2025-02-06 05:18:26,699 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 340 transitions. Word has length 103 [2025-02-06 05:18:26,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:18:26,700 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 340 transitions. [2025-02-06 05:18:26,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 6 states have call successors, (14), 3 states have call predecessors, (14), 6 states have return successors, (13), 8 states have call predecessors, (13), 6 states have call successors, (13) [2025-02-06 05:18:26,700 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 340 transitions. [2025-02-06 05:18:26,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 05:18:26,702 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:18:26,702 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 05:18:26,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 05:18:26,903 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-02-06 05:18:26,903 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:18:26,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:18:26,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1525235247, now seen corresponding path program 2 times [2025-02-06 05:18:26,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:18:26,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459109463] [2025-02-06 05:18:26,904 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 05:18:26,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:18:26,936 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-02-06 05:18:27,056 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 05:18:27,056 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 05:18:27,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:27,320 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-02-06 05:18:27,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:18:27,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459109463] [2025-02-06 05:18:27,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459109463] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:18:27,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086596093] [2025-02-06 05:18:27,321 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 05:18:27,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:18:27,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:18:27,323 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-02-06 05:18:27,324 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-02-06 05:18:27,470 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-02-06 05:18:27,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 05:18:27,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 05:18:27,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:18:27,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-02-06 05:18:27,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:18:27,707 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 10 treesize of output 8 [2025-02-06 05:18:27,734 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-06 05:18:27,743 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-06 05:18:27,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:27,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:27,780 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-06 05:18:27,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:27,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:27,786 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-06 05:18:27,798 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 05:18:27,798 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 27 treesize of output 24 [2025-02-06 05:18:27,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 05:18:27,822 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 05:18:27,822 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-06 05:18:27,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:27,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:27,828 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-06 05:18:27,940 INFO L349 Elim1Store]: treesize reduction 66, result has 39.4 percent of original size [2025-02-06 05:18:27,941 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 122 treesize of output 167 [2025-02-06 05:18:27,959 INFO L349 Elim1Store]: treesize reduction 41, result has 24.1 percent of original size [2025-02-06 05:18:27,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 76 [2025-02-06 05:18:27,982 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:18:27,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2025-02-06 05:18:28,020 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 27 [2025-02-06 05:18:28,022 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-02-06 05:18:28,077 INFO L349 Elim1Store]: treesize reduction 144, result has 30.4 percent of original size [2025-02-06 05:18:28,078 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 80 [2025-02-06 05:18:28,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 05:18:28,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 80 treesize of output 38 [2025-02-06 05:18:28,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:28,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:28,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2025-02-06 05:18:28,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:28,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:18:28,669 INFO L349 Elim1Store]: treesize reduction 148, result has 16.4 percent of original size [2025-02-06 05:18:28,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 127 [2025-02-06 05:18:28,690 INFO L349 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2025-02-06 05:18:28,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 105 [2025-02-06 05:18:28,760 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2025-02-06 05:18:28,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 11 [2025-02-06 05:18:28,891 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2025-02-06 05:18:28,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 11 [2025-02-06 05:18:36,909 INFO L349 Elim1Store]: treesize reduction 2364, result has 0.0 percent of original size [2025-02-06 05:18:36,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 21 select indices, 21 select index equivalence classes, 0 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 210 case distinctions, treesize of input 696 treesize of output 514 [2025-02-06 05:18:36,977 INFO L349 Elim1Store]: treesize reduction 1008, result has 0.1 percent of original size [2025-02-06 05:18:36,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 776 treesize of output 572 [2025-02-06 05:18:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 49 proven. 12 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-06 05:18:36,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:18:42,739 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_aws_linked_list_swap_contents_harness_~#a~0#1.offset| 16))) (and (forall ((v_ensure_linked_list_is_allocated_~curr~0.base_22 Int)) (or (< |c_#StackHeapBarrier| (+ v_ensure_linked_list_is_allocated_~curr~0.base_22 1)) (forall ((v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1266 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| v_ensure_linked_list_is_allocated_~curr~0.base_22 v_ArrVal_1266) |c_ULTIMATE.start_aws_linked_list_swap_contents_harness_~#b~0#1.base| v_ArrVal_1267) |c_ULTIMATE.start_aws_linked_list_swap_contents_harness_~#a~0#1.base|) .cse0) 0)))) (forall ((v_ensure_linked_list_is_allocated_~curr~0.base_22 Int)) (or (< |c_#StackHeapBarrier| (+ v_ensure_linked_list_is_allocated_~curr~0.base_22 1)) (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1268 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| v_ensure_linked_list_is_allocated_~curr~0.base_22 v_ArrVal_1269) |c_ULTIMATE.start_aws_linked_list_swap_contents_harness_~#b~0#1.base| v_ArrVal_1268) |c_ULTIMATE.start_aws_linked_list_swap_contents_harness_~#a~0#1.base|) .cse0) 0)))))) is different from false [2025-02-06 05:18:42,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086596093] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:18:42,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 05:18:42,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 19] total 23 [2025-02-06 05:18:42,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041117077] [2025-02-06 05:18:42,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 05:18:42,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 05:18:42,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:18:42,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 05:18:42,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=678, Unknown=2, NotChecked=52, Total=812 [2025-02-06 05:18:42,748 INFO L87 Difference]: Start difference. First operand 245 states and 340 transitions. Second operand has 23 states, 19 states have (on average 4.315789473684211) internal successors, (82), 18 states have internal predecessors, (82), 8 states have call successors, (25), 4 states have call predecessors, (25), 7 states have return successors, (24), 7 states have call predecessors, (24), 8 states have call successors, (24) [2025-02-06 05:18:59,016 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-06 05:19:03,191 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-06 05:19:07,312 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-06 05:19:12,569 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-06 05:19:13,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:19:13,414 INFO L93 Difference]: Finished difference Result 587 states and 828 transitions. [2025-02-06 05:19:13,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 05:19:13,417 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 4.315789473684211) internal successors, (82), 18 states have internal predecessors, (82), 8 states have call successors, (25), 4 states have call predecessors, (25), 7 states have return successors, (24), 7 states have call predecessors, (24), 8 states have call successors, (24) Word has length 104 [2025-02-06 05:19:13,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:19:13,420 INFO L225 Difference]: With dead ends: 587 [2025-02-06 05:19:13,420 INFO L226 Difference]: Without dead ends: 370 [2025-02-06 05:19:13,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=237, Invalid=2020, Unknown=3, NotChecked=92, Total=2352 [2025-02-06 05:19:13,424 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 178 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 1744 mSolverCounterSat, 90 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1744 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.2s IncrementalHoareTripleChecker+Time [2025-02-06 05:19:13,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 613 Invalid, 1841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1744 Invalid, 7 Unknown, 0 Unchecked, 26.2s Time] [2025-02-06 05:19:13,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-02-06 05:19:13,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 358. [2025-02-06 05:19:13,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 231 states have (on average 1.2943722943722944) internal successors, (299), 241 states have internal predecessors, (299), 93 states have call successors, (93), 33 states have call predecessors, (93), 33 states have return successors, (106), 83 states have call predecessors, (106), 89 states have call successors, (106) [2025-02-06 05:19:13,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 498 transitions. [2025-02-06 05:19:13,483 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 498 transitions. Word has length 104 [2025-02-06 05:19:13,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:19:13,483 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 498 transitions. [2025-02-06 05:19:13,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 4.315789473684211) internal successors, (82), 18 states have internal predecessors, (82), 8 states have call successors, (25), 4 states have call predecessors, (25), 7 states have return successors, (24), 7 states have call predecessors, (24), 8 states have call successors, (24) [2025-02-06 05:19:13,483 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 498 transitions. [2025-02-06 05:19:13,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 05:19:13,486 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:19:13,486 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:19:13,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 05:19:13,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:19:13,687 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:19:13,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:19:13,688 INFO L85 PathProgramCache]: Analyzing trace with hash -226463546, now seen corresponding path program 1 times [2025-02-06 05:19:13,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:19:13,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666091467] [2025-02-06 05:19:13,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:19:13,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:19:13,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 05:19:13,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 05:19:13,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:19:13,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:19:14,161 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-02-06 05:19:14,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:19:14,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666091467] [2025-02-06 05:19:14,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666091467] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:19:14,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439876449] [2025-02-06 05:19:14,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:19:14,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:19:14,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:19:14,165 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:19:14,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 05:19:14,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 05:19:14,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 05:19:14,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:19:14,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:19:14,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 05:19:14,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:19:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-06 05:19:14,935 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:19:14,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439876449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:19:14,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:19:14,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-02-06 05:19:14,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810792869] [2025-02-06 05:19:14,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:19:14,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 05:19:14,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:19:14,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 05:19:14,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-02-06 05:19:14,937 INFO L87 Difference]: Start difference. First operand 358 states and 498 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-06 05:19:16,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:19:16,492 INFO L93 Difference]: Finished difference Result 696 states and 974 transitions. [2025-02-06 05:19:16,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 05:19:16,493 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 106 [2025-02-06 05:19:16,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:19:16,495 INFO L225 Difference]: With dead ends: 696 [2025-02-06 05:19:16,495 INFO L226 Difference]: Without dead ends: 385 [2025-02-06 05:19:16,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-02-06 05:19:16,499 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 166 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 05:19:16,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 570 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 05:19:16,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-02-06 05:19:16,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 367. [2025-02-06 05:19:16,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 238 states have (on average 1.2857142857142858) internal successors, (306), 250 states have internal predecessors, (306), 93 states have call successors, (93), 33 states have call predecessors, (93), 35 states have return successors, (112), 83 states have call predecessors, (112), 89 states have call successors, (112) [2025-02-06 05:19:16,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 511 transitions. [2025-02-06 05:19:16,554 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 511 transitions. Word has length 106 [2025-02-06 05:19:16,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:19:16,554 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 511 transitions. [2025-02-06 05:19:16,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-06 05:19:16,554 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 511 transitions. [2025-02-06 05:19:16,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 05:19:16,556 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:19:16,556 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:19:16,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 05:19:16,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:19:16,757 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:19:16,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:19:16,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1665452622, now seen corresponding path program 1 times [2025-02-06 05:19:16,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:19:16,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746672528] [2025-02-06 05:19:16,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:19:16,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:19:16,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 05:19:16,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 05:19:16,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:19:16,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:19:17,358 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-02-06 05:19:17,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:19:17,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746672528] [2025-02-06 05:19:17,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746672528] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:19:17,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343925448] [2025-02-06 05:19:17,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:19:17,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:19:17,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:19:17,361 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:19:17,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 05:19:17,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 05:19:17,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 05:19:17,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:19:17,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:19:17,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 05:19:17,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:19:18,128 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-06 05:19:18,129 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:19:18,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343925448] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:19:18,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:19:18,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2025-02-06 05:19:18,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520359837] [2025-02-06 05:19:18,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:19:18,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 05:19:18,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:19:18,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 05:19:18,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-02-06 05:19:18,131 INFO L87 Difference]: Start difference. First operand 367 states and 511 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-06 05:19:19,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:19:19,859 INFO L93 Difference]: Finished difference Result 750 states and 1057 transitions. [2025-02-06 05:19:19,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 05:19:19,860 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 108 [2025-02-06 05:19:19,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:19:19,862 INFO L225 Difference]: With dead ends: 750 [2025-02-06 05:19:19,862 INFO L226 Difference]: Without dead ends: 430 [2025-02-06 05:19:19,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2025-02-06 05:19:19,864 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 181 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 05:19:19,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 654 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 05:19:19,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-02-06 05:19:19,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 377. [2025-02-06 05:19:19,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 248 states have (on average 1.2943548387096775) internal successors, (321), 260 states have internal predecessors, (321), 93 states have call successors, (93), 33 states have call predecessors, (93), 35 states have return successors, (112), 83 states have call predecessors, (112), 89 states have call successors, (112) [2025-02-06 05:19:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 526 transitions. [2025-02-06 05:19:19,928 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 526 transitions. Word has length 108 [2025-02-06 05:19:19,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:19:19,928 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 526 transitions. [2025-02-06 05:19:19,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-06 05:19:19,928 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 526 transitions. [2025-02-06 05:19:19,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 05:19:19,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:19:19,930 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:19:19,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 05:19:20,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-06 05:19:20,131 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:19:20,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:19:20,132 INFO L85 PathProgramCache]: Analyzing trace with hash 329002107, now seen corresponding path program 1 times [2025-02-06 05:19:20,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:19:20,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327681057] [2025-02-06 05:19:20,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:19:20,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:19:20,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 05:19:20,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 05:19:20,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:19:20,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:19:20,705 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-02-06 05:19:20,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:19:20,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327681057] [2025-02-06 05:19:20,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327681057] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:19:20,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214824428] [2025-02-06 05:19:20,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:19:20,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:19:20,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:19:20,707 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:19:20,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 05:19:20,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 05:19:20,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 05:19:20,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:19:20,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:19:20,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 05:19:20,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:19:21,081 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-06 05:19:21,081 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:19:21,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214824428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:19:21,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:19:21,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-02-06 05:19:21,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223698925] [2025-02-06 05:19:21,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:19:21,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 05:19:21,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:19:21,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 05:19:21,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 05:19:21,083 INFO L87 Difference]: Start difference. First operand 377 states and 526 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 05:19:21,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:19:21,186 INFO L93 Difference]: Finished difference Result 727 states and 1046 transitions. [2025-02-06 05:19:21,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 05:19:21,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2025-02-06 05:19:21,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:19:21,189 INFO L225 Difference]: With dead ends: 727 [2025-02-06 05:19:21,189 INFO L226 Difference]: Without dead ends: 397 [2025-02-06 05:19:21,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 05:19:21,191 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 2 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:19:21,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 280 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:19:21,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-02-06 05:19:21,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 382. [2025-02-06 05:19:21,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 253 states have (on average 1.2885375494071147) internal successors, (326), 265 states have internal predecessors, (326), 93 states have call successors, (93), 33 states have call predecessors, (93), 35 states have return successors, (112), 83 states have call predecessors, (112), 89 states have call successors, (112) [2025-02-06 05:19:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 531 transitions. [2025-02-06 05:19:21,243 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 531 transitions. Word has length 109 [2025-02-06 05:19:21,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:19:21,244 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 531 transitions. [2025-02-06 05:19:21,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 05:19:21,244 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 531 transitions. [2025-02-06 05:19:21,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-06 05:19:21,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:19:21,245 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:19:21,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 05:19:21,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:19:21,446 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:19:21,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:19:21,446 INFO L85 PathProgramCache]: Analyzing trace with hash 9525913, now seen corresponding path program 1 times [2025-02-06 05:19:21,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:19:21,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788783061] [2025-02-06 05:19:21,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:19:21,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:19:21,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 05:19:21,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 05:19:21,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:19:21,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:19:22,679 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-02-06 05:19:22,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:19:22,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788783061] [2025-02-06 05:19:22,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788783061] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:19:22,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372106559] [2025-02-06 05:19:22,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:19:22,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:19:22,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:19:22,681 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:19:22,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 05:19:22,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 05:19:22,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 05:19:22,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:19:22,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:19:22,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-02-06 05:19:23,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:19:23,012 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 10 treesize of output 8 [2025-02-06 05:19:23,407 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-02-06 05:19:23,484 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 05:19:23,484 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-06 05:19:23,515 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 5 treesize of output 3 [2025-02-06 05:19:23,816 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 05:19:23,816 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 1 case distinctions, treesize of input 20 treesize of output 19 [2025-02-06 05:19:23,998 INFO L349 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2025-02-06 05:19:23,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2025-02-06 05:19:24,033 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 5 treesize of output 3 [2025-02-06 05:19:24,536 INFO L349 Elim1Store]: treesize reduction 69, result has 23.3 percent of original size [2025-02-06 05:19:24,536 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 2 case distinctions, treesize of input 118 treesize of output 52 [2025-02-06 05:19:25,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:19:25,172 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 29 treesize of output 15 [2025-02-06 05:19:25,981 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_ensure_linked_list_is_allocated_~curr~0.offset_20 Int) (v_ensure_linked_list_is_allocated_~curr~0.base_27 Int) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int)) (v_ArrVal_2802 Int)) (and (= |c_#memory_$Pointer$#1.base| (store (store |c_old(#memory_$Pointer$#1.base)| v_ensure_linked_list_is_allocated_~curr~0.base_27 (store v_DerPreprocessor_22 v_ensure_linked_list_is_allocated_~curr~0.offset_20 v_ArrVal_2802)) |c_ensure_linked_list_is_allocated_#in~list.base| (select |c_#memory_$Pointer$#1.base| |c_ensure_linked_list_is_allocated_#in~list.base|))) (= v_DerPreprocessor_21 (select (store (store |c_old(#memory_$Pointer$#1.base)| |c_ensure_linked_list_is_allocated_#in~list.base| v_DerPreprocessor_21) v_ensure_linked_list_is_allocated_~curr~0.base_27 v_DerPreprocessor_22) |c_ensure_linked_list_is_allocated_#in~list.base|)) (<= (+ v_ensure_linked_list_is_allocated_~curr~0.base_27 1) |c_#StackHeapBarrier|))) is different from true [2025-02-06 05:19:26,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:19:26,130 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-02-06 05:19:26,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 52 [2025-02-06 05:19:26,142 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 12 treesize of output 1 [2025-02-06 05:19:30,625 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.offset_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_15| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_15|))) (let ((.cse0 (select .cse1 |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.offset_BEFORE_CALL_13|))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_15|) (<= (+ 2 (select .cse1 (+ |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.offset_BEFORE_CALL_13| 24))) |v_ULTIMATE.start_aws_linked_list_swap_contents_~a#1.base_BEFORE_CALL_15|) (not (= .cse0 0)))))) is different from true [2025-02-06 05:19:37,432 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 47 proven. 14 refuted. 0 times theorem prover too weak. 31 trivial. 2 not checked. [2025-02-06 05:19:37,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:19:41,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:19:41,063 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 05:19:41,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372106559] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:19:41,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 05:19:41,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 25] total 34 [2025-02-06 05:19:41,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925069174] [2025-02-06 05:19:41,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 05:19:41,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-06 05:19:41,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:19:41,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 05:19:41,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1669, Unknown=13, NotChecked=166, Total=1980 [2025-02-06 05:19:41,508 INFO L87 Difference]: Start difference. First operand 382 states and 531 transitions. Second operand has 34 states, 31 states have (on average 3.4516129032258065) internal successors, (107), 30 states have internal predecessors, (107), 9 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 7 states have call predecessors, (26), 9 states have call successors, (26)