./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_push_back_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_push_back_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 4526081b0c55ba26ca543a72264ba075e2706c93c97faea07fd81ad62d180974 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:53:16,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:53:16,092 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 01:53:16,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:53:16,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:53:16,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:53:16,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:53:16,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:53:16,129 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:53:16,130 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:53:16,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:53:16,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:53:16,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:53:16,131 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:53:16,131 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:53:16,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:53:16,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:53:16,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:53:16,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:53:16,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:53:16,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:53:16,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:53:16,131 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:53:16,131 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:53:16,132 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:53:16,132 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:53:16,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:53:16,132 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:53:16,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:53:16,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:53:16,132 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:53:16,132 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:53:16,132 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:53:16,132 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:53:16,132 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:53:16,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:53:16,132 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:53:16,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:53:16,133 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:53:16,133 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:53:16,134 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 -> 4526081b0c55ba26ca543a72264ba075e2706c93c97faea07fd81ad62d180974 [2025-02-08 01:53:16,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:53:16,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:53:16,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:53:16,432 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:53:16,432 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:53:16,435 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_push_back_harness.i [2025-02-08 01:53:17,843 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/153eaa95b/e5e09286ccf841e3a5c4afec649ac59d/FLAG0911b4b65 [2025-02-08 01:53:18,333 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:53:18,334 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_push_back_harness.i [2025-02-08 01:53:18,368 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/153eaa95b/e5e09286ccf841e3a5c4afec649ac59d/FLAG0911b4b65 [2025-02-08 01:53:18,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/153eaa95b/e5e09286ccf841e3a5c4afec649ac59d [2025-02-08 01:53:18,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:53:18,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:53:18,394 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:53:18,394 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:53:18,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:53:18,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:53:18" (1/1) ... [2025-02-08 01:53:18,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e6b1f9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:18, skipping insertion in model container [2025-02-08 01:53:18,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:53:18" (1/1) ... [2025-02-08 01:53:18,487 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:53:18,723 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_push_back_harness.i[4499,4512] [2025-02-08 01:53:18,729 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_push_back_harness.i[4559,4572] [2025-02-08 01:53:19,329 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:19,330 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:19,330 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:19,331 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:19,332 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:19,343 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:19,345 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:19,347 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:19,347 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:19,350 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:19,351 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:19,353 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:19,353 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:19,761 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_push_back_harness.i[150688,150701] [2025-02-08 01:53:19,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:53:19,782 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:53:19,795 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_push_back_harness.i[4499,4512] [2025-02-08 01:53:19,799 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_push_back_harness.i[4559,4572] [2025-02-08 01:53:19,842 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:19,842 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:19,842 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:19,845 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:19,845 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:19,854 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:19,854 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:19,855 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:19,855 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:19,856 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:19,857 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:19,857 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:19,857 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:19,949 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_push_back_harness.i[150688,150701] [2025-02-08 01:53:19,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:53:20,111 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:53:20,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:20 WrapperNode [2025-02-08 01:53:20,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:53:20,114 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:53:20,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:53:20,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:53:20,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:20" (1/1) ... [2025-02-08 01:53:20,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:20" (1/1) ... [2025-02-08 01:53:20,221 INFO L138 Inliner]: procedures = 668, calls = 1046, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 145 [2025-02-08 01:53:20,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:53:20,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:53:20,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:53:20,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:53:20,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:20" (1/1) ... [2025-02-08 01:53:20,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:20" (1/1) ... [2025-02-08 01:53:20,237 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:20" (1/1) ... [2025-02-08 01:53:20,267 INFO L175 MemorySlicer]: Split 35 memory accesses to 3 slices as follows [2, 5, 28]. 80 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 10 writes are split as follows [0, 0, 10]. [2025-02-08 01:53:20,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:20" (1/1) ... [2025-02-08 01:53:20,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:20" (1/1) ... [2025-02-08 01:53:20,281 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:20" (1/1) ... [2025-02-08 01:53:20,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:20" (1/1) ... [2025-02-08 01:53:20,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:20" (1/1) ... [2025-02-08 01:53:20,286 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:20" (1/1) ... [2025-02-08 01:53:20,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:53:20,295 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:53:20,295 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:53:20,298 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:53:20,299 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:20" (1/1) ... [2025-02-08 01:53:20,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:53:20,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:53:20,346 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:53:20,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:53:20,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 01:53:20,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 01:53:20,368 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 01:53:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-02-08 01:53:20,369 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-02-08 01:53:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:53:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-02-08 01:53:20,369 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-02-08 01:53:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:53:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 01:53:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 01:53:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 01:53:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_insert_before [2025-02-08 01:53:20,369 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_insert_before [2025-02-08 01:53:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:53:20,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:53:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 01:53:20,369 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 01:53:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 01:53:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 01:53:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 01:53:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 01:53:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 01:53:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 01:53:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 01:53:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-02-08 01:53:20,370 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-02-08 01:53:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-02-08 01:53:20,370 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-02-08 01:53:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:53:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:53:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 01:53:20,580 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:53:20,582 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:53:20,647 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4718: havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; [2025-02-08 01:53:20,674 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4729: havoc #t~mem317.base, #t~mem317.offset;havoc #t~short318;havoc #t~mem319.base, #t~mem319.offset;havoc #t~mem320.base, #t~mem320.offset;havoc #t~short321; [2025-02-08 01:53:20,681 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-02-08 01:53:20,861 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700-1: #t~ret311#1 := aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret322#1, aws_linked_list_is_valid_deep_#t~mem323#1.base, aws_linked_list_is_valid_deep_#t~mem323#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;havoc aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := (if 0 == #t~ret311#1 % 256 then 0 else 1);havoc #t~ret311#1; [2025-02-08 01:53:20,862 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-02-08 01:53:20,899 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2025-02-08 01:53:20,899 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:53:20,909 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:53:20,909 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:53:20,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:53:20 BoogieIcfgContainer [2025-02-08 01:53:20,911 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:53:20,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:53:20,914 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:53:20,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:53:20,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:53:18" (1/3) ... [2025-02-08 01:53:20,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b929195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:53:20, skipping insertion in model container [2025-02-08 01:53:20,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:20" (2/3) ... [2025-02-08 01:53:20,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b929195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:53:20, skipping insertion in model container [2025-02-08 01:53:20,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:53:20" (3/3) ... [2025-02-08 01:53:20,921 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_push_back_harness.i [2025-02-08 01:53:20,934 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:53:20,936 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_push_back_harness.i that has 8 procedures, 96 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-08 01:53:20,982 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:53:20,992 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;@15c8a53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:53:20,992 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 01:53:20,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 58 states have (on average 1.293103448275862) internal successors, (75), 60 states have internal predecessors, (75), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-08 01:53:21,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-08 01:53:21,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:53:21,009 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2025-02-08 01:53:21,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:53:21,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:53:21,016 INFO L85 PathProgramCache]: Analyzing trace with hash 418312469, now seen corresponding path program 1 times [2025-02-08 01:53:21,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:53:21,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361638172] [2025-02-08 01:53:21,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:21,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:53:21,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 01:53:21,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 01:53:21,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:21,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:21,447 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-08 01:53:21,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:53:21,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361638172] [2025-02-08 01:53:21,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361638172] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:53:21,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988648117] [2025-02-08 01:53:21,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:21,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:53:21,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:53:21,452 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:53:21,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 01:53:21,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 01:53:21,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 01:53:21,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:21,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:21,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 01:53:21,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:53:21,713 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-08 01:53:21,714 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:53:21,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988648117] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:53:21,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:53:21,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-08 01:53:21,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471050087] [2025-02-08 01:53:21,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:53:21,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:53:21,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:53:21,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:53:21,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:53:21,743 INFO L87 Difference]: Start difference. First operand has 96 states, 58 states have (on average 1.293103448275862) internal successors, (75), 60 states have internal predecessors, (75), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-08 01:53:21,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:53:21,773 INFO L93 Difference]: Finished difference Result 185 states and 271 transitions. [2025-02-08 01:53:21,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:53:21,775 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 71 [2025-02-08 01:53:21,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:53:21,780 INFO L225 Difference]: With dead ends: 185 [2025-02-08 01:53:21,781 INFO L226 Difference]: Without dead ends: 86 [2025-02-08 01:53:21,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:53:21,788 INFO L435 NwaCegarLoop]: 129 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, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:53:21,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:53:21,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-08 01:53:21,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-02-08 01:53:21,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 51 states have (on average 1.196078431372549) internal successors, (61), 52 states have internal predecessors, (61), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-08 01:53:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 114 transitions. [2025-02-08 01:53:21,839 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 114 transitions. Word has length 71 [2025-02-08 01:53:21,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:53:21,839 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 114 transitions. [2025-02-08 01:53:21,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-08 01:53:21,840 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 114 transitions. [2025-02-08 01:53:21,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-08 01:53:21,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:53:21,842 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2025-02-08 01:53:21,851 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-08 01:53:22,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-08 01:53:22,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:53:22,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:53:22,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1837060118, now seen corresponding path program 1 times [2025-02-08 01:53:22,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:53:22,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525605481] [2025-02-08 01:53:22,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:22,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:53:22,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 01:53:22,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 01:53:22,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:22,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:22,379 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-02-08 01:53:22,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:53:22,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525605481] [2025-02-08 01:53:22,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525605481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:53:22,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:53:22,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:53:22,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862162588] [2025-02-08 01:53:22,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:53:22,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:53:22,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:53:22,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:53:22,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:53:22,381 INFO L87 Difference]: Start difference. First operand 86 states and 114 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-08 01:53:22,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:53:22,422 INFO L93 Difference]: Finished difference Result 165 states and 222 transitions. [2025-02-08 01:53:22,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:53:22,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 71 [2025-02-08 01:53:22,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:53:22,428 INFO L225 Difference]: With dead ends: 165 [2025-02-08 01:53:22,430 INFO L226 Difference]: Without dead ends: 89 [2025-02-08 01:53:22,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:53:22,431 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 1 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:53:22,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 327 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:53:22,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-08 01:53:22,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2025-02-08 01:53:22,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 54 states have internal predecessors, (63), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-08 01:53:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 116 transitions. [2025-02-08 01:53:22,447 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 116 transitions. Word has length 71 [2025-02-08 01:53:22,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:53:22,448 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 116 transitions. [2025-02-08 01:53:22,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-08 01:53:22,448 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 116 transitions. [2025-02-08 01:53:22,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-08 01:53:22,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:53:22,450 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2025-02-08 01:53:22,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:53:22,451 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:53:22,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:53:22,451 INFO L85 PathProgramCache]: Analyzing trace with hash -2019897675, now seen corresponding path program 1 times [2025-02-08 01:53:22,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:53:22,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153855825] [2025-02-08 01:53:22,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:22,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:53:22,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 01:53:22,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 01:53:22,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:22,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-02-08 01:53:22,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:53:22,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153855825] [2025-02-08 01:53:22,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153855825] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:53:22,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:53:22,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:53:22,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779344312] [2025-02-08 01:53:22,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:53:22,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:53:22,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:53:22,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:53:22,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:53:22,711 INFO L87 Difference]: Start difference. First operand 88 states and 116 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-08 01:53:22,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:53:22,752 INFO L93 Difference]: Finished difference Result 169 states and 226 transitions. [2025-02-08 01:53:22,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:53:22,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 71 [2025-02-08 01:53:22,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:53:22,755 INFO L225 Difference]: With dead ends: 169 [2025-02-08 01:53:22,755 INFO L226 Difference]: Without dead ends: 91 [2025-02-08 01:53:22,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:53:22,756 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 1 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:53:22,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 327 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:53:22,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-08 01:53:22,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2025-02-08 01:53:22,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 56 states have internal predecessors, (65), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-08 01:53:22,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 118 transitions. [2025-02-08 01:53:22,769 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 118 transitions. Word has length 71 [2025-02-08 01:53:22,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:53:22,769 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 118 transitions. [2025-02-08 01:53:22,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-08 01:53:22,770 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 118 transitions. [2025-02-08 01:53:22,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-08 01:53:22,774 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:53:22,775 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2025-02-08 01:53:22,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:53:22,775 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:53:22,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:53:22,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1250727660, now seen corresponding path program 1 times [2025-02-08 01:53:22,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:53:22,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055734040] [2025-02-08 01:53:22,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:22,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:53:22,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 01:53:22,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 01:53:22,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:22,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:22,978 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-02-08 01:53:22,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:53:22,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055734040] [2025-02-08 01:53:22,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055734040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:53:22,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:53:22,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:53:22,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395636953] [2025-02-08 01:53:22,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:53:22,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:53:22,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:53:22,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:53:22,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:53:22,981 INFO L87 Difference]: Start difference. First operand 90 states and 118 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-08 01:53:23,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:53:23,016 INFO L93 Difference]: Finished difference Result 173 states and 230 transitions. [2025-02-08 01:53:23,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:53:23,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 71 [2025-02-08 01:53:23,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:53:23,020 INFO L225 Difference]: With dead ends: 173 [2025-02-08 01:53:23,022 INFO L226 Difference]: Without dead ends: 93 [2025-02-08 01:53:23,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:53:23,024 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 1 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:53:23,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 329 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:53:23,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-08 01:53:23,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2025-02-08 01:53:23,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 58 states have internal predecessors, (67), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-08 01:53:23,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 120 transitions. [2025-02-08 01:53:23,041 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 120 transitions. Word has length 71 [2025-02-08 01:53:23,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:53:23,041 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 120 transitions. [2025-02-08 01:53:23,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-08 01:53:23,041 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2025-02-08 01:53:23,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-08 01:53:23,042 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:53:23,042 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2025-02-08 01:53:23,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:53:23,042 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:53:23,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:53:23,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1491267789, now seen corresponding path program 1 times [2025-02-08 01:53:23,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:53:23,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245068049] [2025-02-08 01:53:23,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:23,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:53:23,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 01:53:23,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 01:53:23,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:23,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:23,397 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-02-08 01:53:23,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:53:23,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245068049] [2025-02-08 01:53:23,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245068049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:53:23,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:53:23,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:53:23,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135685678] [2025-02-08 01:53:23,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:53:23,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:53:23,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:53:23,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:53:23,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:53:23,399 INFO L87 Difference]: Start difference. First operand 92 states and 120 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-08 01:53:23,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:53:23,476 INFO L93 Difference]: Finished difference Result 182 states and 237 transitions. [2025-02-08 01:53:23,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:53:23,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 71 [2025-02-08 01:53:23,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:53:23,477 INFO L225 Difference]: With dead ends: 182 [2025-02-08 01:53:23,478 INFO L226 Difference]: Without dead ends: 90 [2025-02-08 01:53:23,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:53:23,479 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 10 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:53:23,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 397 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:53:23,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-08 01:53:23,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-02-08 01:53:23,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 56 states have internal predecessors, (64), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-08 01:53:23,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 117 transitions. [2025-02-08 01:53:23,488 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 117 transitions. Word has length 71 [2025-02-08 01:53:23,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:53:23,488 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 117 transitions. [2025-02-08 01:53:23,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-08 01:53:23,489 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 117 transitions. [2025-02-08 01:53:23,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-08 01:53:23,489 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:53:23,489 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2025-02-08 01:53:23,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:53:23,490 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:53:23,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:53:23,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1816722743, now seen corresponding path program 1 times [2025-02-08 01:53:23,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:53:23,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585322575] [2025-02-08 01:53:23,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:23,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:53:23,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 01:53:23,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 01:53:23,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:23,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:24,043 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-08 01:53:24,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:53:24,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585322575] [2025-02-08 01:53:24,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585322575] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:53:24,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352916823] [2025-02-08 01:53:24,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:24,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:53:24,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:53:24,046 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:53:24,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 01:53:24,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 01:53:24,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 01:53:24,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:24,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:24,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 105 conjuncts are in the unsatisfiable core [2025-02-08 01:53:24,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:53:24,353 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-08 01:53:24,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 12 [2025-02-08 01:53:24,501 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 8 treesize of output 1 [2025-02-08 01:53:24,506 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 8 treesize of output 1 [2025-02-08 01:53:25,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:53:25,222 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 175 [2025-02-08 01:53:25,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:53:25,247 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 85 [2025-02-08 01:53:25,279 INFO L349 Elim1Store]: treesize reduction 114, result has 7.3 percent of original size [2025-02-08 01:53:25,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 133 treesize of output 128 [2025-02-08 01:53:25,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 1 [2025-02-08 01:53:25,292 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:53:25,295 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 0 case distinctions, treesize of input 55 treesize of output 46 [2025-02-08 01:53:25,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 57 [2025-02-08 01:53:25,326 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:53:25,326 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 26 treesize of output 1 [2025-02-08 01:53:25,332 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 19 treesize of output 17 [2025-02-08 01:53:26,046 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 01:53:26,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:53:30,597 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| c_aws_linked_list_insert_before_~to_add.base)) (.cse1 (+ 8 c_aws_linked_list_insert_before_~before.offset))) (and (forall ((aws_linked_list_insert_before_~to_add.offset Int) (v_ArrVal_542 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| c_aws_linked_list_insert_before_~to_add.base (let ((.cse3 (store .cse4 aws_linked_list_insert_before_~to_add.offset c_aws_linked_list_insert_before_~before.base))) (store .cse3 (+ aws_linked_list_insert_before_~to_add.offset 8) (select (select (store |c_#memory_$Pointer$#2.base| c_aws_linked_list_insert_before_~to_add.base .cse3) c_aws_linked_list_insert_before_~before.base) .cse1)))))) (store .cse2 (select (select .cse2 c_aws_linked_list_insert_before_~before.base) .cse1) v_ArrVal_542)))) (store .cse0 c_aws_linked_list_insert_before_~before.base (store (select .cse0 c_aws_linked_list_insert_before_~before.base) .cse1 c_aws_linked_list_insert_before_~to_add.base))) c_aws_linked_list_insert_before_~to_add.base) aws_linked_list_insert_before_~to_add.offset) c_aws_linked_list_insert_before_~before.base)) (forall ((aws_linked_list_insert_before_~to_add.offset Int) (v_ArrVal_538 (Array Int Int))) (= (select (select (let ((.cse5 (let ((.cse7 (+ aws_linked_list_insert_before_~to_add.offset 8))) (store (store |c_#memory_$Pointer$#2.offset| c_aws_linked_list_insert_before_~to_add.base (let ((.cse6 (store (select |c_#memory_$Pointer$#2.offset| c_aws_linked_list_insert_before_~to_add.base) aws_linked_list_insert_before_~to_add.offset c_aws_linked_list_insert_before_~before.offset))) (store .cse6 .cse7 (select (select (store |c_#memory_$Pointer$#2.offset| c_aws_linked_list_insert_before_~to_add.base .cse6) c_aws_linked_list_insert_before_~before.base) .cse1)))) (select (select (store |c_#memory_$Pointer$#2.base| c_aws_linked_list_insert_before_~to_add.base (let ((.cse8 (store .cse4 aws_linked_list_insert_before_~to_add.offset c_aws_linked_list_insert_before_~before.base))) (store .cse8 .cse7 (select (select (store |c_#memory_$Pointer$#2.base| c_aws_linked_list_insert_before_~to_add.base .cse8) c_aws_linked_list_insert_before_~before.base) .cse1)))) c_aws_linked_list_insert_before_~before.base) .cse1) v_ArrVal_538)))) (store .cse5 c_aws_linked_list_insert_before_~before.base (store (select .cse5 c_aws_linked_list_insert_before_~before.base) .cse1 aws_linked_list_insert_before_~to_add.offset))) c_aws_linked_list_insert_before_~to_add.base) aws_linked_list_insert_before_~to_add.offset) c_aws_linked_list_insert_before_~before.offset)))) is different from false [2025-02-08 01:53:30,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352916823] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:53:30,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:53:30,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 19] total 23 [2025-02-08 01:53:30,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243200555] [2025-02-08 01:53:30,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 01:53:30,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 01:53:30,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:53:30,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 01:53:30,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=793, Unknown=1, NotChecked=56, Total=930 [2025-02-08 01:53:30,633 INFO L87 Difference]: Start difference. First operand 90 states and 117 transitions. Second operand has 23 states, 20 states have (on average 3.75) internal successors, (75), 18 states have internal predecessors, (75), 8 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2025-02-08 01:53:34,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 01:53:38,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 01:53:42,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 01:53:46,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 01:53:47,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:53:47,102 INFO L93 Difference]: Finished difference Result 133 states and 165 transitions. [2025-02-08 01:53:47,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 01:53:47,107 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 3.75) internal successors, (75), 18 states have internal predecessors, (75), 8 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) Word has length 71 [2025-02-08 01:53:47,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:53:47,108 INFO L225 Difference]: With dead ends: 133 [2025-02-08 01:53:47,108 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 01:53:47,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 11 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=89, Invalid=906, Unknown=1, NotChecked=60, Total=1056 [2025-02-08 01:53:47,111 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2025-02-08 01:53:47,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 388 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 4 Unknown, 0 Unchecked, 16.4s Time] [2025-02-08 01:53:47,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 01:53:47,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 01:53:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:53:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 01:53:47,115 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2025-02-08 01:53:47,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:53:47,115 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 01:53:47,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 3.75) internal successors, (75), 18 states have internal predecessors, (75), 8 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2025-02-08 01:53:47,115 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 01:53:47,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 01:53:47,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 01:53:47,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 01:53:47,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:53:47,324 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 01:53:47,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 01:53:47,552 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 01:53:47,560 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~list!offset [2025-02-08 01:53:47,562 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#to_add~0!base [2025-02-08 01:53:47,562 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~list!base [2025-02-08 01:53:47,562 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!base [2025-02-08 01:53:47,563 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#to_add~0!base [2025-02-08 01:53:47,563 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!base [2025-02-08 01:53:47,563 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!offset [2025-02-08 01:53:47,563 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!base [2025-02-08 01:53:47,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:53:47 BoogieIcfgContainer [2025-02-08 01:53:47,564 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 01:53:47,565 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 01:53:47,565 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 01:53:47,565 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 01:53:47,566 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:53:20" (3/4) ... [2025-02-08 01:53:47,568 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 01:53:47,573 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2025-02-08 01:53:47,573 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2025-02-08 01:53:47,573 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_prev_is_valid [2025-02-08 01:53:47,573 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_insert_before [2025-02-08 01:53:47,574 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-08 01:53:47,574 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-08 01:53:47,574 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_is_valid [2025-02-08 01:53:47,579 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2025-02-08 01:53:47,579 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-02-08 01:53:47,580 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 01:53:47,580 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 01:53:47,672 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 01:53:47,673 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 01:53:47,673 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 01:53:47,674 INFO L158 Benchmark]: Toolchain (without parser) took 29282.33ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 99.6MB in the beginning and 211.9MB in the end (delta: -112.3MB). Peak memory consumption was 75.7MB. Max. memory is 16.1GB. [2025-02-08 01:53:47,675 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:53:47,675 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1719.00ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 42.6MB in the end (delta: 57.0MB). Peak memory consumption was 85.7MB. Max. memory is 16.1GB. [2025-02-08 01:53:47,675 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.81ms. Allocated memory is still 142.6MB. Free memory was 42.6MB in the beginning and 96.5MB in the end (delta: -53.9MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2025-02-08 01:53:47,676 INFO L158 Benchmark]: Boogie Preprocessor took 70.29ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 92.8MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:53:47,676 INFO L158 Benchmark]: IcfgBuilder took 617.68ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 62.9MB in the end (delta: 29.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 01:53:47,677 INFO L158 Benchmark]: TraceAbstraction took 26650.39ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 62.2MB in the beginning and 219.4MB in the end (delta: -157.2MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2025-02-08 01:53:47,677 INFO L158 Benchmark]: Witness Printer took 108.07ms. Allocated memory is still 335.5MB. Free memory was 219.4MB in the beginning and 211.9MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:53:47,679 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1719.00ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 42.6MB in the end (delta: 57.0MB). Peak memory consumption was 85.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.81ms. Allocated memory is still 142.6MB. Free memory was 42.6MB in the beginning and 96.5MB in the end (delta: -53.9MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.29ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 92.8MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 617.68ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 62.9MB in the end (delta: 29.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 26650.39ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 62.2MB in the beginning and 219.4MB in the end (delta: -157.2MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * Witness Printer took 108.07ms. Allocated memory is still 335.5MB. Free memory was 219.4MB in the beginning and 211.9MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~list!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#to_add~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~list!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#list~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#to_add~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#list~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#list~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#list~0!base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.4s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 16.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 1897 SdHoareTripleChecker+Invalid, 16.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1303 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 284 IncrementalHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 594 mSDtfsCounter, 284 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 130 SyntacticMatches, 11 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=0, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 568 NumberOfCodeBlocks, 568 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 560 ConstructedInterpolants, 43 QuantifiedInterpolants, 2345 SizeOfPredicates, 18 NumberOfNonLiveVariables, 849 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 346/376 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 01:53:47,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE