./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E --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 Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cf0e38c8708298b6c669a06e84f1e143a32d8eb782624bd4425e7da323fbf6a8 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:36:42,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:36:42,623 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-64bit-Taipan_Default.epf [2024-11-14 04:36:42,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:36:42,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:36:42,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:36:42,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:36:42,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:36:42,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:36:42,669 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:36:42,670 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:36:42,670 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:36:42,671 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:36:42,671 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 04:36:42,671 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:36:42,671 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:36:42,671 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 04:36:42,671 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 04:36:42,671 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:36:42,672 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 04:36:42,672 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 04:36:42,672 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 04:36:42,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:36:42,673 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:36:42,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:36:42,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:36:42,673 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:36:42,673 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:36:42,674 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:36:42,674 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:36:42,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:36:42,674 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:36:42,674 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:36:42,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:36:42,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:36:42,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:36:42,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:36:42,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:36:42,676 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 04:36:42,676 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 04:36:42,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 04:36:42,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:36:42,676 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:36:42,676 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 04:36:42,676 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E 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 -> Taipan 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 -> cf0e38c8708298b6c669a06e84f1e143a32d8eb782624bd4425e7da323fbf6a8 [2024-11-14 04:36:43,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:36:43,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:36:43,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:36:43,038 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:36:43,038 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:36:43,039 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i Unable to find full path for "g++" [2024-11-14 04:36:44,943 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:36:45,576 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:36:45,579 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i [2024-11-14 04:36:45,635 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/data/c0b49cf9f/67d814c4a4554c46a21bf08f7c389a9c/FLAGef4075348 [2024-11-14 04:36:45,660 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/data/c0b49cf9f/67d814c4a4554c46a21bf08f7c389a9c [2024-11-14 04:36:45,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:36:45,664 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:36:45,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:36:45,668 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:36:45,673 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:36:45,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:36:45" (1/1) ... [2024-11-14 04:36:45,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74a9e9f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:36:45, skipping insertion in model container [2024-11-14 04:36:45,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:36:45" (1/1) ... [2024-11-14 04:36:45,796 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:36:46,192 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i[4495,4508] [2024-11-14 04:36:46,203 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i[4555,4568] [2024-11-14 04:36:47,334 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:36:47,335 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:36:47,336 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:36:47,336 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:36:47,338 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:36:47,360 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:36:47,361 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:36:47,364 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:36:47,365 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:36:47,369 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:36:47,370 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:36:47,371 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:36:47,372 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:36:48,316 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i[150686,150699] [2024-11-14 04:36:48,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:36:48,343 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:36:48,369 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i[4495,4508] [2024-11-14 04:36:48,370 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i[4555,4568] [2024-11-14 04:36:48,478 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:36:48,482 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:36:48,482 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:36:48,483 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:36:48,484 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:36:48,507 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:36:48,508 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:36:48,511 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:36:48,511 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:36:48,513 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:36:48,516 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:36:48,520 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:36:48,520 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 04:36:48,697 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i[150686,150699] [2024-11-14 04:36:48,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:36:48,932 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:36:48,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:36:48 WrapperNode [2024-11-14 04:36:48,933 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:36:48,935 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:36:48,935 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:36:48,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:36:48,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:36:48" (1/1) ... [2024-11-14 04:36:49,068 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:36:48" (1/1) ... [2024-11-14 04:36:49,118 INFO L138 Inliner]: procedures = 668, calls = 1039, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 141 [2024-11-14 04:36:49,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:36:49,123 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:36:49,123 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:36:49,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:36:49,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:36:48" (1/1) ... [2024-11-14 04:36:49,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:36:48" (1/1) ... [2024-11-14 04:36:49,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:36:48" (1/1) ... [2024-11-14 04:36:49,148 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:36:48" (1/1) ... [2024-11-14 04:36:49,178 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:36:48" (1/1) ... [2024-11-14 04:36:49,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:36:48" (1/1) ... [2024-11-14 04:36:49,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:36:48" (1/1) ... [2024-11-14 04:36:49,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:36:48" (1/1) ... [2024-11-14 04:36:49,209 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:36:49,213 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:36:49,218 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:36:49,218 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:36:49,219 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:36:48" (1/1) ... [2024-11-14 04:36:49,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:36:49,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:36:49,271 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:36:49,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:36:49,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 04:36:49,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-14 04:36:49,307 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-14 04:36:49,307 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-14 04:36:49,307 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-14 04:36:49,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 04:36:49,307 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-14 04:36:49,307 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-14 04:36:49,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:36:49,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 04:36:49,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:36:49,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:36:49,307 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 04:36:49,308 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 04:36:49,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 04:36:49,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 04:36:49,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 04:36:49,308 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-14 04:36:49,308 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-14 04:36:49,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 04:36:49,660 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:36:49,663 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:36:50,050 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-11-14 04:36:50,051 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:36:50,234 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:36:50,234 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-14 04:36:50,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:36:50 BoogieIcfgContainer [2024-11-14 04:36:50,235 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:36:50,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:36:50,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:36:50,242 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:36:50,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:36:45" (1/3) ... [2024-11-14 04:36:50,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6494d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:36:50, skipping insertion in model container [2024-11-14 04:36:50,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:36:48" (2/3) ... [2024-11-14 04:36:50,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6494d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:36:50, skipping insertion in model container [2024-11-14 04:36:50,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:36:50" (3/3) ... [2024-11-14 04:36:50,247 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_begin_harness_negated.i [2024-11-14 04:36:50,265 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:36:50,266 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_begin_harness_negated.i that has 6 procedures, 46 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-14 04:36:50,344 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:36:50,361 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=FINITE_AUTOMATA, 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;@6c48132d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:36:50,361 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 04:36:50,368 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-14 04:36:50,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 04:36:50,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:36:50,378 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:36:50,378 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:36:50,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:36:50,383 INFO L85 PathProgramCache]: Analyzing trace with hash 22166961, now seen corresponding path program 1 times [2024-11-14 04:36:50,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:36:50,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092437229] [2024-11-14 04:36:50,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:36:50,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:36:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:36:51,806 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 04:36:51,807 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:36:51,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092437229] [2024-11-14 04:36:51,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092437229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:36:51,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:36:51,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 04:36:51,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111852382] [2024-11-14 04:36:51,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:36:51,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:36:51,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:36:51,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:36:51,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:36:51,844 INFO L87 Difference]: Start difference. First operand has 46 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-14 04:36:52,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:36:52,052 INFO L93 Difference]: Finished difference Result 82 states and 112 transitions. [2024-11-14 04:36:52,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:36:52,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 37 [2024-11-14 04:36:52,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:36:52,064 INFO L225 Difference]: With dead ends: 82 [2024-11-14 04:36:52,064 INFO L226 Difference]: Without dead ends: 52 [2024-11-14 04:36:52,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:36:52,075 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:36:52,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 228 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:36:52,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-14 04:36:52,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2024-11-14 04:36:52,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-14 04:36:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2024-11-14 04:36:52,129 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 37 [2024-11-14 04:36:52,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:36:52,130 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2024-11-14 04:36:52,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-14 04:36:52,131 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2024-11-14 04:36:52,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 04:36:52,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:36:52,133 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:36:52,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 04:36:52,133 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:36:52,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:36:52,135 INFO L85 PathProgramCache]: Analyzing trace with hash -640436147, now seen corresponding path program 1 times [2024-11-14 04:36:52,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:36:52,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054842303] [2024-11-14 04:36:52,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:36:52,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:36:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:36:52,630 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 04:36:52,630 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:36:52,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054842303] [2024-11-14 04:36:52,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054842303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:36:52,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:36:52,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 04:36:52,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281104486] [2024-11-14 04:36:52,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:36:52,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 04:36:52,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:36:52,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 04:36:52,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:36:52,636 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-14 04:36:52,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:36:52,894 INFO L93 Difference]: Finished difference Result 98 states and 129 transitions. [2024-11-14 04:36:52,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:36:52,895 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 39 [2024-11-14 04:36:52,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:36:52,896 INFO L225 Difference]: With dead ends: 98 [2024-11-14 04:36:52,897 INFO L226 Difference]: Without dead ends: 53 [2024-11-14 04:36:52,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 04:36:52,898 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 15 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:36:52,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 197 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:36:52,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-14 04:36:52,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2024-11-14 04:36:52,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-14 04:36:52,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2024-11-14 04:36:52,917 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 39 [2024-11-14 04:36:52,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:36:52,918 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2024-11-14 04:36:52,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-14 04:36:52,918 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2024-11-14 04:36:52,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-14 04:36:52,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:36:52,920 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:36:52,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 04:36:52,920 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:36:52,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:36:52,921 INFO L85 PathProgramCache]: Analyzing trace with hash 127843378, now seen corresponding path program 1 times [2024-11-14 04:36:52,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:36:52,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291076917] [2024-11-14 04:36:52,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:36:52,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:36:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:36:53,437 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 04:36:53,437 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:36:53,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291076917] [2024-11-14 04:36:53,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291076917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:36:53,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:36:53,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 04:36:53,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745566139] [2024-11-14 04:36:53,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:36:53,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 04:36:53,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:36:53,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 04:36:53,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-14 04:36:53,443 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-14 04:36:53,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:36:53,774 INFO L93 Difference]: Finished difference Result 104 states and 137 transitions. [2024-11-14 04:36:53,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 04:36:53,775 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 41 [2024-11-14 04:36:53,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:36:53,777 INFO L225 Difference]: With dead ends: 104 [2024-11-14 04:36:53,777 INFO L226 Difference]: Without dead ends: 58 [2024-11-14 04:36:53,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-14 04:36:53,781 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 24 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:36:53,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 215 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:36:53,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-14 04:36:53,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2024-11-14 04:36:53,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-14 04:36:53,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2024-11-14 04:36:53,806 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 41 [2024-11-14 04:36:53,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:36:53,806 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2024-11-14 04:36:53,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-14 04:36:53,807 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2024-11-14 04:36:53,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-14 04:36:53,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:36:53,811 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:36:53,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 04:36:53,812 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:36:53,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:36:53,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1678861939, now seen corresponding path program 1 times [2024-11-14 04:36:53,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:36:53,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295377609] [2024-11-14 04:36:53,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:36:53,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:36:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:36:54,410 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 04:36:54,412 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:36:54,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295377609] [2024-11-14 04:36:54,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295377609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:36:54,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547286557] [2024-11-14 04:36:54,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:36:54,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:36:54,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:36:54,416 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:36:54,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 04:36:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:36:54,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-14 04:36:54,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:36:54,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-14 04:36:54,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-14 04:36:54,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2024-11-14 04:36:54,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2024-11-14 04:36:57,040 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 04:36:57,040 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:36:57,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547286557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:36:57,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:36:57,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2024-11-14 04:36:57,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014954247] [2024-11-14 04:36:57,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:36:57,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 04:36:57,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:36:57,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 04:36:57,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-14 04:36:57,045 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-14 04:36:57,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:36:57,891 INFO L93 Difference]: Finished difference Result 140 states and 180 transitions. [2024-11-14 04:36:57,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 04:36:57,892 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 43 [2024-11-14 04:36:57,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:36:57,894 INFO L225 Difference]: With dead ends: 140 [2024-11-14 04:36:57,894 INFO L226 Difference]: Without dead ends: 97 [2024-11-14 04:36:57,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-14 04:36:57,896 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 27 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 04:36:57,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 207 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 04:36:57,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-14 04:36:57,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2024-11-14 04:36:57,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 59 states have internal predecessors, (67), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (30), 24 states have call predecessors, (30), 24 states have call successors, (30) [2024-11-14 04:36:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2024-11-14 04:36:57,923 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 43 [2024-11-14 04:36:57,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:36:57,923 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2024-11-14 04:36:57,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-14 04:36:57,924 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2024-11-14 04:36:57,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-14 04:36:57,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:36:57,925 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:36:57,950 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 04:36:58,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:36:58,126 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:36:58,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:36:58,126 INFO L85 PathProgramCache]: Analyzing trace with hash 576131417, now seen corresponding path program 1 times [2024-11-14 04:36:58,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:36:58,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582863110] [2024-11-14 04:36:58,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:36:58,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:36:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:36:58,652 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 04:36:58,653 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:36:58,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582863110] [2024-11-14 04:36:58,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582863110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:36:58,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383578683] [2024-11-14 04:36:58,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:36:58,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:36:58,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:36:58,660 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:36:58,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 04:36:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:36:58,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-14 04:36:58,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:36:59,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-14 04:36:59,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-14 04:36:59,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2024-11-14 04:36:59,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:36:59,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-14 04:36:59,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2024-11-14 04:36:59,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:36:59,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-14 04:36:59,445 INFO L349 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2024-11-14 04:36:59,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 171 treesize of output 163 [2024-11-14 04:36:59,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 129 [2024-11-14 04:36:59,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:36:59,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 26 [2024-11-14 04:36:59,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:36:59,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 31 [2024-11-14 04:37:03,026 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-14 04:37:03,027 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:37:07,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:37:07,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 364 treesize of output 449 [2024-11-14 04:37:07,987 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 04:37:07,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2024-11-14 04:37:08,079 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 04:37:08,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 19 [2024-11-14 04:37:08,105 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 04:37:08,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 19 [2024-11-14 04:37:08,125 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 04:37:08,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 19 [2024-11-14 04:37:08,190 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 04:37:08,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 19 [2024-11-14 04:37:08,247 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-14 04:37:08,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 19 [2024-11-14 04:37:08,398 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 04:37:08,398 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 1 case distinctions, treesize of input 14 treesize of output 1 [2024-11-14 04:37:08,926 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset| 16)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse10 (+ |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset| 24)) (.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| 0))) (.cse3 (+ |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (or (forall ((v_prenex_5 (Array Int Int))) (= 0 (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_prenex_5))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse3))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 0) (forall ((v_prenex_4 (Array Int Int))) (= (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_prenex_4))) (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse5) 0)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (or (forall ((v_prenex_3 (Array Int Int))) (not (= (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_prenex_3))) (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset|) 0))) (forall ((v_DerPreprocessor_22 Int) (v_arrayElimArr_7 (Array Int Int)) (v_subst_2 Int) (v_subst_1 Int) (v_DerPreprocessor_21 Int)) (or (not (= v_DerPreprocessor_21 (select (store (store v_arrayElimArr_7 v_subst_1 v_DerPreprocessor_21) v_subst_2 v_DerPreprocessor_22) v_subst_1))) (not (= (select (select (let ((.cse7 (store .cse8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_7))) (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_subst_1))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset|) 0)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int) (v_ArrVal_279 (Array Int Int))) (or (forall ((v_DerPreprocessor_24 Int) (v_arrayElimArr_5 (Array Int Int)) (v_DerPreprocessor_25 Int) (v_DerPreprocessor_23 Int) (v_DerPreprocessor_26 Int) (v_subst_2 Int) (v_subst_1 Int)) (let ((.cse9 (store (store v_arrayElimArr_5 v_subst_1 v_DerPreprocessor_25) v_subst_2 v_DerPreprocessor_26))) (or (not (= v_DerPreprocessor_25 (select .cse9 v_subst_1))) (not (= (store v_arrayElimArr_5 v_subst_2 v_DerPreprocessor_26) .cse9)) (not (= (select (select (store .cse8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_5) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse10) 0)) (not (= v_DerPreprocessor_23 (select (store (store v_arrayElimArr_5 v_subst_2 v_DerPreprocessor_23) v_subst_1 v_DerPreprocessor_24) v_subst_2)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 1)) (not (= (select (select (let ((.cse11 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_ArrVal_279))) (store .cse11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse10) 0)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 0))) (or (not (= |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 0) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int) (v_subst_2 Int) (v_subst_1 Int)) (or (= (select (select (let ((.cse12 (store .cse8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_6))) (store .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_subst_2))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse3) 0) (not (= v_DerPreprocessor_13 (select (store (store v_arrayElimArr_6 v_subst_2 v_DerPreprocessor_13) v_subst_1 v_DerPreprocessor_14) v_subst_2))))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 1)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_16 Int) (v_subst_2 Int) (v_subst_1 Int)) (or (not (= v_DerPreprocessor_16 (select (store (store v_arrayElimArr_6 v_subst_1 v_DerPreprocessor_16) v_subst_2 v_DerPreprocessor_17) v_subst_1))) (= (select (select (let ((.cse13 (store .cse8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_6))) (store .cse13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_subst_1))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse3) 0))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int) (v_ArrVal_279 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 1)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_DerPreprocessor_29 Int) (v_subst_2 Int) (v_subst_1 Int) (v_DerPreprocessor_30 Int)) (or (not (= (select (select (store .cse8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_5) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse10) 0)) (not (= v_DerPreprocessor_29 (select (store (store v_arrayElimArr_5 v_subst_1 v_DerPreprocessor_29) v_subst_2 v_DerPreprocessor_30) v_subst_1))))) (not (= (select (select (let ((.cse14 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_ArrVal_279))) (store .cse14 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse14 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse10) 0)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_subst_2 Int)) (= (select (select (let ((.cse15 (store .cse8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_8))) (store .cse15 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse15 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_subst_2))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse5) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 0))) (forall ((v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int) (v_ArrVal_279 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 1)) (not (= (select (select (let ((.cse16 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_ArrVal_279))) (store .cse16 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse16 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20|))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse10) 0)) (not (= (select (select (store .cse8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_5) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse10) 0)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 1)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_18 Int) (v_DerPreprocessor_19 Int) (v_subst_3 Int) (v_subst_2 Int) (v_DerPreprocessor_20 Int) (v_subst_1 Int)) (let ((.cse17 (store (store (store v_arrayElimArr_6 v_subst_3 v_DerPreprocessor_18) v_subst_1 v_DerPreprocessor_19) v_subst_2 v_DerPreprocessor_20))) (or (= v_subst_3 v_subst_2) (not (= v_DerPreprocessor_19 (select .cse17 v_subst_1))) (= (select (select (let ((.cse18 (store .cse8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| v_arrayElimArr_6))) (store .cse18 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse18 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_subst_3))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse3) 0) (not (= .cse17 (store (store v_arrayElimArr_6 v_subst_3 (select .cse17 v_subst_3)) v_subst_2 v_DerPreprocessor_20))) (= v_subst_3 v_subst_1)))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_20| 0))))) is different from false [2024-11-14 04:37:09,264 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2024-11-14 04:37:09,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 144 [2024-11-14 04:37:09,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:37:09,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 178 [2024-11-14 04:37:09,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 120 [2024-11-14 04:37:09,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-14 04:37:09,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:37:09,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 74 [2024-11-14 04:37:09,795 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:37:09,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:37:09,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:37:09,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 46 [2024-11-14 04:37:09,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 88 treesize of output 70 [2024-11-14 04:37:09,828 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:37:09,833 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:37:09,871 INFO L349 Elim1Store]: treesize reduction 5, result has 73.7 percent of original size [2024-11-14 04:37:09,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 54 [2024-11-14 04:37:09,880 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:37:09,884 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 11 treesize of output 7 [2024-11-14 04:37:09,909 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:37:09,919 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:37:09,925 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:37:09,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:37:09,931 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:37:09,932 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:37:09,939 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:37:09,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-14 04:37:09,952 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:37:09,961 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:37:09,962 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:37:09,967 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 04:37:09,973 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:37:09,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:37:09,980 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:37:09,981 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:37:09,987 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:37:09,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-14 04:37:09,993 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:37:09,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:37:10,000 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:37:10,001 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:37:10,007 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:37:10,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-14 04:37:10,018 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:37:10,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:37:10,024 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:37:10,024 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:37:10,029 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-11-14 04:37:10,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-14 04:37:10,156 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 1 not checked. [2024-11-14 04:37:10,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383578683] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:37:10,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2090082981] [2024-11-14 04:37:10,182 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2024-11-14 04:37:10,182 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:37:10,186 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:37:10,190 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:37:10,191 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:37:12,391 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 98 for LOIs [2024-11-14 04:37:12,501 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 6 for LOIs [2024-11-14 04:37:12,503 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 94 for LOIs [2024-11-14 04:37:12,524 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:37:20,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [2090082981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:37:20,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:37:20,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5, 10, 9] total 30 [2024-11-14 04:37:20,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407924665] [2024-11-14 04:37:20,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:37:20,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 04:37:20,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:37:20,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 04:37:20,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=714, Unknown=11, NotChecked=54, Total=870 [2024-11-14 04:37:20,773 INFO L87 Difference]: Start difference. First operand 95 states and 123 transitions. Second operand has 12 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-14 04:37:23,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:37:26,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:37:28,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:37:30,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:37:32,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:37:34,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:37:39,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:37:41,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:37:43,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:37:45,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:37:47,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:37:49,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:37:51,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:37:54,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:37:56,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:37:58,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:00,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:02,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:04,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:06,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:08,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:10,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:13,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:15,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:17,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:19,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:21,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:24,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:26,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:28,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:30,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:32,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:34,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:36,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:39,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:41,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:43,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:45,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:47,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:49,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:51,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:54,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:56,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:58,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:00,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:02,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:04,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:06,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:09,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:11,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:13,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:15,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:17,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:19,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:22,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:24,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:26,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:26,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:39:26,292 INFO L93 Difference]: Finished difference Result 168 states and 212 transitions. [2024-11-14 04:39:26,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 04:39:26,605 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 44 [2024-11-14 04:39:26,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:39:26,606 INFO L225 Difference]: With dead ends: 168 [2024-11-14 04:39:26,607 INFO L226 Difference]: Without dead ends: 123 [2024-11-14 04:39:26,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 97 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=118, Invalid=930, Unknown=12, NotChecked=62, Total=1122 [2024-11-14 04:39:26,609 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 20 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 5 mSolverCounterUnsat, 58 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 115.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 58 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 122.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:39:26,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 249 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 278 Invalid, 58 Unknown, 0 Unchecked, 122.1s Time] [2024-11-14 04:39:26,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-14 04:39:26,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-14 04:39:26,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 82 states have internal predecessors, (96), 28 states have call successors, (28), 14 states have call predecessors, (28), 17 states have return successors, (31), 26 states have call predecessors, (31), 26 states have call successors, (31) [2024-11-14 04:39:26,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 155 transitions. [2024-11-14 04:39:26,667 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 155 transitions. Word has length 44 [2024-11-14 04:39:26,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:39:26,668 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 155 transitions. [2024-11-14 04:39:26,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-14 04:39:26,668 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 155 transitions. [2024-11-14 04:39:26,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-14 04:39:26,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:39:26,670 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:39:26,694 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-14 04:39:26,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:39:26,871 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:39:26,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:39:26,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1951115618, now seen corresponding path program 1 times [2024-11-14 04:39:26,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:39:26,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601304223] [2024-11-14 04:39:26,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:39:26,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:39:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:39:27,187 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 04:39:27,188 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:39:27,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601304223] [2024-11-14 04:39:27,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601304223] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:39:27,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309726902] [2024-11-14 04:39:27,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:39:27,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:39:27,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:39:27,191 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:39:27,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 04:39:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:39:27,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 04:39:27,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:39:27,453 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 04:39:27,456 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:39:27,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309726902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:39:27,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:39:27,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-14 04:39:27,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126739185] [2024-11-14 04:39:27,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:39:27,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:39:27,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:39:27,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:39:27,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-14 04:39:27,459 INFO L87 Difference]: Start difference. First operand 123 states and 155 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-14 04:39:27,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:39:27,568 INFO L93 Difference]: Finished difference Result 249 states and 329 transitions. [2024-11-14 04:39:27,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:39:27,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 48 [2024-11-14 04:39:27,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:39:27,571 INFO L225 Difference]: With dead ends: 249 [2024-11-14 04:39:27,574 INFO L226 Difference]: Without dead ends: 139 [2024-11-14 04:39:27,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-14 04:39:27,576 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:39:27,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 86 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:39:27,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-14 04:39:27,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 127. [2024-11-14 04:39:27,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 86 states have internal predecessors, (100), 28 states have call successors, (28), 14 states have call predecessors, (28), 17 states have return successors, (31), 26 states have call predecessors, (31), 26 states have call successors, (31) [2024-11-14 04:39:27,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 159 transitions. [2024-11-14 04:39:27,642 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 159 transitions. Word has length 48 [2024-11-14 04:39:27,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:39:27,642 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 159 transitions. [2024-11-14 04:39:27,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-14 04:39:27,643 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 159 transitions. [2024-11-14 04:39:27,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-14 04:39:27,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:39:27,648 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:39:27,672 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 04:39:27,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-14 04:39:27,849 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:39:27,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:39:27,849 INFO L85 PathProgramCache]: Analyzing trace with hash -143327921, now seen corresponding path program 1 times [2024-11-14 04:39:27,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:39:27,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100544629] [2024-11-14 04:39:27,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:39:27,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:39:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:39:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 04:39:28,453 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:39:28,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100544629] [2024-11-14 04:39:28,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100544629] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:39:28,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216932739] [2024-11-14 04:39:28,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:39:28,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:39:28,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:39:28,456 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:39:28,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 04:39:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:39:28,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 04:39:28,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:39:28,804 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 04:39:28,804 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:39:28,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216932739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:39:28,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:39:28,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2024-11-14 04:39:28,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16869494] [2024-11-14 04:39:28,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:39:28,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:39:28,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:39:28,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:39:28,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 04:39:28,806 INFO L87 Difference]: Start difference. First operand 127 states and 159 transitions. Second operand has 6 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-14 04:39:28,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:39:28,961 INFO L93 Difference]: Finished difference Result 253 states and 317 transitions. [2024-11-14 04:39:28,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:39:28,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 51 [2024-11-14 04:39:28,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:39:28,964 INFO L225 Difference]: With dead ends: 253 [2024-11-14 04:39:28,964 INFO L226 Difference]: Without dead ends: 139 [2024-11-14 04:39:28,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 04:39:28,966 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:39:28,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 212 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:39:28,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-14 04:39:29,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 131. [2024-11-14 04:39:29,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 84 states have (on average 1.2261904761904763) internal successors, (103), 90 states have internal predecessors, (103), 28 states have call successors, (28), 14 states have call predecessors, (28), 18 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2024-11-14 04:39:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 163 transitions. [2024-11-14 04:39:29,031 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 163 transitions. Word has length 51 [2024-11-14 04:39:29,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:39:29,031 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 163 transitions. [2024-11-14 04:39:29,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-14 04:39:29,032 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 163 transitions. [2024-11-14 04:39:29,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-14 04:39:29,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:39:29,034 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:39:29,057 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 04:39:29,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-14 04:39:29,237 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:39:29,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:39:29,237 INFO L85 PathProgramCache]: Analyzing trace with hash 727502708, now seen corresponding path program 1 times [2024-11-14 04:39:29,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:39:29,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403175945] [2024-11-14 04:39:29,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:39:29,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:39:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:39:30,144 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 04:39:30,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:39:30,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403175945] [2024-11-14 04:39:30,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403175945] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:39:30,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772240576] [2024-11-14 04:39:30,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:39:30,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:39:30,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:39:30,148 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:39:30,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 04:39:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:39:30,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-14 04:39:30,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:39:30,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-14 04:39:30,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-14 04:39:30,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:39:30,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 43 [2024-11-14 04:39:30,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2024-11-14 04:39:49,455 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-14 04:39:49,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:39:54,793 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-14 04:39:54,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772240576] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:39:54,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1892580277] [2024-11-14 04:39:54,796 INFO L159 IcfgInterpreter]: Started Sifa with 39 locations of interest [2024-11-14 04:39:54,797 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:39:54,797 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:39:54,797 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:39:54,797 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:39:55,627 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 177 for LOIs [2024-11-14 04:39:55,879 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 18 for LOIs [2024-11-14 04:39:55,882 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 94 for LOIs [2024-11-14 04:39:55,904 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 25 for LOIs [2024-11-14 04:39:55,922 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:40:02,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1892580277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:40:02,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:40:02,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [8, 16, 8] total 47 [2024-11-14 04:40:02,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759476812] [2024-11-14 04:40:02,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:40:02,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 04:40:02,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:40:02,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 04:40:02,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1940, Unknown=0, NotChecked=0, Total=2162 [2024-11-14 04:40:02,253 INFO L87 Difference]: Start difference. First operand 131 states and 163 transitions. Second operand has 21 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 5 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-14 04:40:05,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:40:07,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:40:09,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:40:20,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:40:20,969 INFO L93 Difference]: Finished difference Result 197 states and 242 transitions. [2024-11-14 04:40:20,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 04:40:20,971 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 5 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 53 [2024-11-14 04:40:20,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:40:20,973 INFO L225 Difference]: With dead ends: 197 [2024-11-14 04:40:20,973 INFO L226 Difference]: Without dead ends: 137 [2024-11-14 04:40:20,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 113 SyntacticMatches, 8 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=367, Invalid=2825, Unknown=0, NotChecked=0, Total=3192 [2024-11-14 04:40:20,983 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 101 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 23 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2024-11-14 04:40:20,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 292 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 774 Invalid, 3 Unknown, 0 Unchecked, 11.9s Time] [2024-11-14 04:40:20,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-14 04:40:21,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 132. [2024-11-14 04:40:21,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 85 states have (on average 1.223529411764706) internal successors, (104), 91 states have internal predecessors, (104), 28 states have call successors, (28), 14 states have call predecessors, (28), 18 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2024-11-14 04:40:21,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 164 transitions. [2024-11-14 04:40:21,048 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 164 transitions. Word has length 53 [2024-11-14 04:40:21,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:40:21,049 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 164 transitions. [2024-11-14 04:40:21,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 5 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-14 04:40:21,049 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2024-11-14 04:40:21,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-14 04:40:21,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:40:21,051 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:40:21,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 04:40:21,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:40:21,253 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:40:21,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:40:21,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1171941790, now seen corresponding path program 1 times [2024-11-14 04:40:21,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:40:21,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551487473] [2024-11-14 04:40:21,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:40:21,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:40:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:40:21,580 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 04:40:21,581 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:40:21,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551487473] [2024-11-14 04:40:21,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551487473] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:40:21,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740218202] [2024-11-14 04:40:21,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:40:21,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:40:21,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:40:21,584 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:40:21,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 04:40:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:40:21,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-14 04:40:21,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:40:21,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-14 04:40:21,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2024-11-14 04:40:22,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2024-11-14 04:40:22,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2024-11-14 04:40:47,427 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-14 04:40:47,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:40:53,046 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-14 04:40:53,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740218202] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:40:53,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [185470681] [2024-11-14 04:40:53,049 INFO L159 IcfgInterpreter]: Started Sifa with 39 locations of interest [2024-11-14 04:40:53,049 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:40:53,049 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:40:53,049 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:40:53,049 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:40:54,173 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 72 for LOIs [2024-11-14 04:40:54,342 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 17 for LOIs [2024-11-14 04:40:54,593 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 12 for LOIs [2024-11-14 04:40:54,596 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 94 for LOIs [2024-11-14 04:40:54,616 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 25 for LOIs [2024-11-14 04:40:54,656 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:41:03,238 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4708#(and (<= 1 |#StackHeapBarrier|) (= |~#s_can_fail_allocator_static~0.base| 4) (= |~#s_can_fail_allocator_static~0.offset| 0) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_21| Int) (|v_ULTIMATE.start_aws_linked_list_begin_~rval~0#1.offset_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_aws_linked_list_begin_~rval~0#1.base_BEFORE_CALL_6| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_21|) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_21|) 0) |v_ULTIMATE.start_aws_linked_list_begin_~rval~0#1.base_BEFORE_CALL_6|) (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_21|) 0) |v_ULTIMATE.start_aws_linked_list_begin_~rval~0#1.offset_BEFORE_CALL_6|))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~rval~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_aws_linked_list_begin_~rval~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_aws_linked_list_begin_#t~ret328#1_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_27| Int)) (and (<= 0 |v_ULTIMATE.start_aws_linked_list_begin_#t~ret328#1_BEFORE_CALL_3|) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_27|) (= |__VERIFIER_assert_#in~cond| 0) (= |v_ULTIMATE.start_aws_linked_list_begin_~rval~0#1.offset_BEFORE_CALL_7| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_27|) 0)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_27|) 0) |v_ULTIMATE.start_aws_linked_list_begin_~rval~0#1.base_BEFORE_CALL_7|) (not (= |v_ULTIMATE.start_aws_linked_list_begin_#t~ret328#1_BEFORE_CALL_3| 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_#t~ret326#1_22| Int)) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_#t~ret326#1_22| 1) (<= 0 |v_ULTIMATE.start_aws_linked_list_begin_#t~ret326#1_22|))) (<= |v_ULTIMATE.start_aws_linked_list_begin_#t~ret328#1_BEFORE_CALL_3| 1)))) (= ~tl_last_error~0 0))' at error location [2024-11-14 04:41:03,238 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:41:03,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:41:03,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 16, 8] total 25 [2024-11-14 04:41:03,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303779828] [2024-11-14 04:41:03,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:41:03,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-14 04:41:03,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:41:03,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-14 04:41:03,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2638, Unknown=1, NotChecked=0, Total=2862 [2024-11-14 04:41:03,241 INFO L87 Difference]: Start difference. First operand 132 states and 164 transitions. Second operand has 25 states, 22 states have (on average 3.272727272727273) internal successors, (72), 21 states have internal predecessors, (72), 11 states have call successors, (24), 5 states have call predecessors, (24), 10 states have return successors, (24), 10 states have call predecessors, (24), 11 states have call successors, (24) [2024-11-14 04:41:09,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:41:09,401 INFO L93 Difference]: Finished difference Result 245 states and 305 transitions. [2024-11-14 04:41:09,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 04:41:09,402 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 3.272727272727273) internal successors, (72), 21 states have internal predecessors, (72), 11 states have call successors, (24), 5 states have call predecessors, (24), 10 states have return successors, (24), 10 states have call predecessors, (24), 11 states have call successors, (24) Word has length 54 [2024-11-14 04:41:09,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:41:09,404 INFO L225 Difference]: With dead ends: 245 [2024-11-14 04:41:09,404 INFO L226 Difference]: Without dead ends: 130 [2024-11-14 04:41:09,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 109 SyntacticMatches, 9 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 26.3s TimeCoverageRelationStatistics Valid=305, Invalid=3726, Unknown=1, NotChecked=0, Total=4032 [2024-11-14 04:41:09,406 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 81 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:41:09,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 286 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-14 04:41:09,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-14 04:41:09,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 118. [2024-11-14 04:41:09,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 81 states have internal predecessors, (93), 26 states have call successors, (26), 12 states have call predecessors, (26), 14 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2024-11-14 04:41:09,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 145 transitions. [2024-11-14 04:41:09,512 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 145 transitions. Word has length 54 [2024-11-14 04:41:09,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:41:09,512 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 145 transitions. [2024-11-14 04:41:09,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 3.272727272727273) internal successors, (72), 21 states have internal predecessors, (72), 11 states have call successors, (24), 5 states have call predecessors, (24), 10 states have return successors, (24), 10 states have call predecessors, (24), 11 states have call successors, (24) [2024-11-14 04:41:09,512 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 145 transitions. [2024-11-14 04:41:09,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-14 04:41:09,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:41:09,513 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:41:09,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-14 04:41:09,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:41:09,714 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:41:09,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:41:09,714 INFO L85 PathProgramCache]: Analyzing trace with hash -278673312, now seen corresponding path program 1 times [2024-11-14 04:41:09,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:41:09,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45697836] [2024-11-14 04:41:09,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:41:09,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:41:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:41:10,310 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-14 04:41:10,311 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:41:10,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45697836] [2024-11-14 04:41:10,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45697836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:41:10,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:41:10,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 04:41:10,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499722267] [2024-11-14 04:41:10,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:41:10,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 04:41:10,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:41:10,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 04:41:10,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:41:10,313 INFO L87 Difference]: Start difference. First operand 118 states and 145 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-14 04:41:10,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:41:10,613 INFO L93 Difference]: Finished difference Result 141 states and 171 transitions. [2024-11-14 04:41:10,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:41:10,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 64 [2024-11-14 04:41:10,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:41:10,617 INFO L225 Difference]: With dead ends: 141 [2024-11-14 04:41:10,617 INFO L226 Difference]: Without dead ends: 139 [2024-11-14 04:41:10,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 04:41:10,620 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 3 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:41:10,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 250 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:41:10,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-14 04:41:10,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 134. [2024-11-14 04:41:10,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 87 states have (on average 1.1839080459770115) internal successors, (103), 93 states have internal predecessors, (103), 28 states have call successors, (28), 14 states have call predecessors, (28), 18 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2024-11-14 04:41:10,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 163 transitions. [2024-11-14 04:41:10,752 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 163 transitions. Word has length 64 [2024-11-14 04:41:10,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:41:10,754 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 163 transitions. [2024-11-14 04:41:10,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-14 04:41:10,755 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 163 transitions. [2024-11-14 04:41:10,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-14 04:41:10,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:41:10,757 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:41:10,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 04:41:10,758 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:41:10,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:41:10,758 INFO L85 PathProgramCache]: Analyzing trace with hash -110423163, now seen corresponding path program 1 times [2024-11-14 04:41:10,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:41:10,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826438925] [2024-11-14 04:41:10,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:41:10,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:41:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:41:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-14 04:41:11,581 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:41:11,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826438925] [2024-11-14 04:41:11,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826438925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:41:11,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286863159] [2024-11-14 04:41:11,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:41:11,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:41:11,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:41:11,584 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:41:11,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 04:41:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:41:11,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 107 conjuncts are in the unsatisfiable core [2024-11-14 04:41:11,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:41:12,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-14 04:41:12,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-14 04:41:15,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:41:15,132 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:41:15,149 INFO L349 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2024-11-14 04:41:15,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 85 treesize of output 1 [2024-11-14 04:41:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-14 04:41:15,151 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:41:20,490 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_aws_linked_list_node_next_is_valid_#in~node.base|) |c_aws_linked_list_node_next_is_valid_#in~node.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_node_next_is_valid_#in~node.base|) |c_aws_linked_list_node_next_is_valid_#in~node.offset|)) (.cse1 (+ 8 .cse2))) (or (not (= |c_aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) (< 0 (mod |c_aws_linked_list_node_next_is_valid_#res| 256)) (and (= 0 |c_aws_linked_list_node_next_is_valid_#in~node.base|) (= |c_aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (and (= .cse2 0) (= .cse0 0)) (and (forall ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21| Int)) (or (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21| 0) (forall ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21| Int)) (let ((.cse4 (+ (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21|) 8)) (.cse3 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21|))) (or (not (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21|)) (not (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse4) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21|)) (= .cse3 0)))))) (forall ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21| Int)) (or (= |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21| 0) (forall ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21| Int)) (let ((.cse6 (+ (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21|) 8)) (.cse5 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21|))) (or (not (= (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21|)) (not (= (select (select |c_#memory_$Pointer$.base| .cse5) .cse6) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21|)) (= .cse5 0)))))) (forall ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21| Int)) (or (forall ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21|))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21|)) (.cse8 (+ .cse9 8))) (or (not (= (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21|)) (not (= (select (select |c_#memory_$Pointer$.base| .cse7) .cse8) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21|)) (= .cse9 0))))) (= |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21| 0))) (forall ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21| Int)) (or (forall ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21|))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21|)) (.cse11 (+ .cse12 8))) (or (not (= (select (select |c_#memory_$Pointer$.offset| .cse10) .cse11) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21|)) (not (= (select (select |c_#memory_$Pointer$.base| .cse10) .cse11) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21|)) (= .cse12 0))))) (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21| 0)))) (not (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) |c_aws_linked_list_node_next_is_valid_#in~node.base|))))) is different from false [2024-11-14 04:41:24,817 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 13 trivial. 1 not checked. [2024-11-14 04:41:24,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286863159] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:41:24,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [796487214] [2024-11-14 04:41:24,820 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2024-11-14 04:41:24,820 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:41:24,821 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:41:24,821 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:41:24,821 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:41:27,260 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 56 for LOIs [2024-11-14 04:41:27,300 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 17 for LOIs [2024-11-14 04:41:27,577 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 12 for LOIs [2024-11-14 04:41:27,579 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 94 for LOIs [2024-11-14 04:41:27,590 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 25 for LOIs [2024-11-14 04:41:27,612 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:41:52,897 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6163#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#res#1_39| Int) (|v_ULTIMATE.start_aws_linked_list_begin_#t~ret328#1_BEFORE_CALL_4| Int)) (and (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_54| Int)) (and (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1_54| 1) (= |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#res#1_39| 1))) (= |__VERIFIER_assert_#in~cond| 0) (= |v_ULTIMATE.start_aws_linked_list_begin_#t~ret328#1_BEFORE_CALL_4| 1))) (= |~#s_can_fail_allocator_static~0.base| 4) (= |~#s_can_fail_allocator_static~0.offset| 0) (= ~tl_last_error~0 0))' at error location [2024-11-14 04:41:52,898 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:41:52,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:41:52,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 16] total 39 [2024-11-14 04:41:52,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814499882] [2024-11-14 04:41:52,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:41:52,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-14 04:41:52,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:41:52,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-14 04:41:52,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=3753, Unknown=3, NotChecked=124, Total=4160 [2024-11-14 04:41:52,901 INFO L87 Difference]: Start difference. First operand 134 states and 163 transitions. Second operand has 39 states, 34 states have (on average 3.0) internal successors, (102), 34 states have internal predecessors, (102), 15 states have call successors, (29), 3 states have call predecessors, (29), 12 states have return successors, (28), 13 states have call predecessors, (28), 15 states have call successors, (28) [2024-11-14 04:42:02,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:42:02,925 INFO L93 Difference]: Finished difference Result 317 states and 402 transitions. [2024-11-14 04:42:02,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-14 04:42:02,925 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 34 states have (on average 3.0) internal successors, (102), 34 states have internal predecessors, (102), 15 states have call successors, (29), 3 states have call predecessors, (29), 12 states have return successors, (28), 13 states have call predecessors, (28), 15 states have call successors, (28) Word has length 66 [2024-11-14 04:42:02,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:42:02,928 INFO L225 Difference]: With dead ends: 317 [2024-11-14 04:42:02,928 INFO L226 Difference]: Without dead ends: 180 [2024-11-14 04:42:02,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 141 SyntacticMatches, 10 SemanticMatches, 97 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 2950 ImplicationChecksByTransitivity, 35.8s TimeCoverageRelationStatistics Valid=722, Invalid=8785, Unknown=3, NotChecked=192, Total=9702 [2024-11-14 04:42:02,932 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 177 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 1870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:42:02,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 754 Invalid, 1870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1613 Invalid, 0 Unknown, 142 Unchecked, 4.3s Time] [2024-11-14 04:42:02,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-14 04:42:03,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 146. [2024-11-14 04:42:03,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 95 states have (on average 1.168421052631579) internal successors, (111), 101 states have internal predecessors, (111), 32 states have call successors, (32), 14 states have call predecessors, (32), 18 states have return successors, (36), 30 states have call predecessors, (36), 30 states have call successors, (36) [2024-11-14 04:42:03,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 179 transitions. [2024-11-14 04:42:03,039 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 179 transitions. Word has length 66 [2024-11-14 04:42:03,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:42:03,040 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 179 transitions. [2024-11-14 04:42:03,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 34 states have (on average 3.0) internal successors, (102), 34 states have internal predecessors, (102), 15 states have call successors, (29), 3 states have call predecessors, (29), 12 states have return successors, (28), 13 states have call predecessors, (28), 15 states have call successors, (28) [2024-11-14 04:42:03,040 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2024-11-14 04:42:03,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-14 04:42:03,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:42:03,042 INFO L215 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:42:03,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 04:42:03,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:42:03,243 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:42:03,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:42:03,243 INFO L85 PathProgramCache]: Analyzing trace with hash 657932446, now seen corresponding path program 1 times [2024-11-14 04:42:03,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:42:03,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11456389] [2024-11-14 04:42:03,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:42:03,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:42:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:42:03,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 04:42:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:42:03,518 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 04:42:03,518 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 04:42:03,520 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 04:42:03,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 04:42:03,526 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:42:03,608 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 04:42:03,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:42:03 BoogieIcfgContainer [2024-11-14 04:42:03,616 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 04:42:03,617 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 04:42:03,618 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 04:42:03,618 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 04:42:03,619 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:36:50" (3/4) ... [2024-11-14 04:42:03,620 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-14 04:42:03,686 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/witness.graphml [2024-11-14 04:42:03,687 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 04:42:03,687 INFO L158 Benchmark]: Toolchain (without parser) took 318023.20ms. Allocated memory was 142.6MB in the beginning and 914.4MB in the end (delta: 771.8MB). Free memory was 111.1MB in the beginning and 563.5MB in the end (delta: -452.4MB). Peak memory consumption was 312.7MB. Max. memory is 16.1GB. [2024-11-14 04:42:03,688 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 117.4MB. Free memory is still 73.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:42:03,688 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3266.70ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 54.3MB in the end (delta: 56.5MB). Peak memory consumption was 86.1MB. Max. memory is 16.1GB. [2024-11-14 04:42:03,688 INFO L158 Benchmark]: Boogie Procedure Inliner took 187.12ms. Allocated memory is still 142.6MB. Free memory was 54.3MB in the beginning and 98.1MB in the end (delta: -43.8MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2024-11-14 04:42:03,689 INFO L158 Benchmark]: Boogie Preprocessor took 89.57ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 95.7MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:42:03,689 INFO L158 Benchmark]: RCFGBuilder took 1021.30ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 62.9MB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-14 04:42:03,689 INFO L158 Benchmark]: TraceAbstraction took 313379.97ms. Allocated memory was 142.6MB in the beginning and 914.4MB in the end (delta: 771.8MB). Free memory was 62.1MB in the beginning and 571.9MB in the end (delta: -509.8MB). Peak memory consumption was 267.5MB. Max. memory is 16.1GB. [2024-11-14 04:42:03,690 INFO L158 Benchmark]: Witness Printer took 69.30ms. Allocated memory is still 914.4MB. Free memory was 571.9MB in the beginning and 563.5MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:42:03,691 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.48ms. Allocated memory is still 117.4MB. Free memory is still 73.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3266.70ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 54.3MB in the end (delta: 56.5MB). Peak memory consumption was 86.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 187.12ms. Allocated memory is still 142.6MB. Free memory was 54.3MB in the beginning and 98.1MB in the end (delta: -43.8MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.57ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 95.7MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1021.30ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 62.9MB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 313379.97ms. Allocated memory was 142.6MB in the beginning and 914.4MB in the end (delta: 771.8MB). Free memory was 62.1MB in the beginning and 571.9MB in the end (delta: -509.8MB). Peak memory consumption was 267.5MB. Max. memory is 16.1GB. * Witness Printer took 69.30ms. Allocated memory is still 914.4MB. Free memory was 571.9MB in the beginning and 563.5MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. * 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 - CounterExampleResult [Line: 223]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7326] static __thread int tl_last_error = 0; [L7360] CALL aws_linked_list_begin_harness() [L7344] struct aws_linked_list list; [L7346] CALL ensure_linked_list_is_allocated(&list, 20) [L6743] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L266] return __VERIFIER_nondet_ulong(); [L6743] RET, EXPR nondet_uint64_t() VAL [list={7:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6743] size_t length = nondet_uint64_t(); [L6744] CALL assume_abort_if_not(length <= max_length) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) [L6744] RET assume_abort_if_not(length <= max_length) VAL [length=((unsigned __int128) 1 << 64), list={7:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6746-L6747] list->head.prev = ((void *)0) [L6749-L6750] list->tail.next = ((void *)0) [L6753] struct aws_linked_list_node *curr = &list->head; [L6755] size_t i = 0; VAL [curr={7:0}, i=0, length=((unsigned __int128) 1 << 64), list={7:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6755] COND FALSE !(i < length) [L6764] curr->next = &list->tail [L6765] list->tail.prev = curr [L7346] RET ensure_linked_list_is_allocated(&list, 20) [L7349] CALL, EXPR aws_linked_list_is_valid(&list) VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next [L4694] EXPR list->head.next [L4694] EXPR list && list->head.next [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694] EXPR list->head.prev [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4696] EXPR list->tail.prev [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4696] EXPR list->tail.next [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] COND TRUE list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4700] CALL, EXPR aws_linked_list_is_valid_deep(list) [L4734] COND FALSE !(!list) [L4740] const struct aws_linked_list_node *temp = &list->head; [L4743-L4746] _Bool head_reaches_tail = 0 ; VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4751] COND FALSE !(temp == &list->tail) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [\old(node)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next [L4718] EXPR node->next [L4718] EXPR node && node->next [L4718] EXPR node && node->next && node->next->prev == node [L4718] EXPR node->next [L4718] EXPR node->next->prev [L4718] EXPR node && node->next && node->next->prev == node [L4718] return node && node->next && node->next->prev == node; [L4756] RET, EXPR aws_linked_list_node_next_is_valid(temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] COND FALSE !(!aws_linked_list_node_next_is_valid(temp)) [L4762] EXPR temp->next [L4762] temp = temp->next [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:16}, tl_last_error=0] [L4751] COND TRUE temp == &list->tail [L4752-L4753] head_reaches_tail = 1 VAL [head_reaches_tail=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4764] return head_reaches_tail; VAL [\result=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4700] RET, EXPR aws_linked_list_is_valid_deep(list) [L4700] return aws_linked_list_is_valid_deep(list); [L7349] RET, EXPR aws_linked_list_is_valid(&list) VAL [list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7349] CALL assume_abort_if_not(aws_linked_list_is_valid(&list)) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) [L7349] RET assume_abort_if_not(aws_linked_list_is_valid(&list)) VAL [list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7354] CALL aws_linked_list_begin(&list) [L4788] CALL, EXPR aws_linked_list_is_valid(list) VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next [L4694] EXPR list->head.next [L4694] EXPR list && list->head.next [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694] EXPR list->head.prev [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4696] EXPR list->tail.prev [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4696] EXPR list->tail.next [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] COND TRUE list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4700] CALL, EXPR aws_linked_list_is_valid_deep(list) [L4734] COND FALSE !(!list) [L4740] const struct aws_linked_list_node *temp = &list->head; [L4743-L4746] _Bool head_reaches_tail = 0 ; VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4751] COND FALSE !(temp == &list->tail) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [\old(node)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next [L4718] EXPR node->next [L4718] EXPR node && node->next [L4718] EXPR node && node->next && node->next->prev == node [L4718] EXPR node->next [L4718] EXPR node->next->prev [L4718] EXPR node && node->next && node->next->prev == node [L4718] return node && node->next && node->next->prev == node; [L4756] RET, EXPR aws_linked_list_node_next_is_valid(temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] COND FALSE !(!aws_linked_list_node_next_is_valid(temp)) [L4762] EXPR temp->next [L4762] temp = temp->next [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:16}, tl_last_error=0] [L4751] COND TRUE temp == &list->tail [L4752-L4753] head_reaches_tail = 1 VAL [head_reaches_tail=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4764] return head_reaches_tail; VAL [\result=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4700] RET, EXPR aws_linked_list_is_valid_deep(list) [L4700] return aws_linked_list_is_valid_deep(list); [L4788] RET, EXPR aws_linked_list_is_valid(list) VAL [list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4788] CALL assume_abort_if_not((aws_linked_list_is_valid(list))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) [L4788] RET assume_abort_if_not((aws_linked_list_is_valid(list))) VAL [list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4789] EXPR list->head.next [L4789] struct aws_linked_list_node *rval = list->head.next; [L4790] CALL, EXPR aws_linked_list_is_valid(list) VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next [L4694] EXPR list->head.next [L4694] EXPR list && list->head.next [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694] EXPR list->head.prev [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4696] EXPR list->tail.prev [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4696] EXPR list->tail.next [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] COND TRUE list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4700] CALL, EXPR aws_linked_list_is_valid_deep(list) [L4734] COND FALSE !(!list) [L4740] const struct aws_linked_list_node *temp = &list->head; [L4743-L4746] _Bool head_reaches_tail = 0 ; VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4751] COND FALSE !(temp == &list->tail) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [\old(node)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next [L4718] EXPR node->next [L4718] EXPR node && node->next [L4718] EXPR node && node->next && node->next->prev == node [L4718] EXPR node->next [L4718] EXPR node->next->prev [L4718] EXPR node && node->next && node->next->prev == node [L4718] return node && node->next && node->next->prev == node; [L4756] RET, EXPR aws_linked_list_node_next_is_valid(temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] COND FALSE !(!aws_linked_list_node_next_is_valid(temp)) [L4762] EXPR temp->next [L4762] temp = temp->next [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:16}, tl_last_error=0] [L4751] COND TRUE temp == &list->tail [L4752-L4753] head_reaches_tail = 1 VAL [head_reaches_tail=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4764] return head_reaches_tail; VAL [\result=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4700] RET, EXPR aws_linked_list_is_valid_deep(list) [L4700] return aws_linked_list_is_valid_deep(list); [L4790] RET, EXPR aws_linked_list_is_valid(list) VAL [list={7:0}, rval={7:16}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4790] CALL __VERIFIER_assert(!((aws_linked_list_is_valid(list)))) VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L223] COND TRUE !cond VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L223] reach_error() VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 313.2s, OverallIterations: 12, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 163.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 61 mSolverCounterUnknown, 508 SdHoareTripleChecker+Valid, 142.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 453 mSDsluCounter, 2976 SdHoareTripleChecker+Invalid, 135.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 142 IncrementalHoareTripleChecker+Unchecked, 2529 mSDsCounter, 244 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3999 IncrementalHoareTripleChecker+Invalid, 4446 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 244 mSolverCounterUnsat, 447 mSDtfsCounter, 3999 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 934 GetRequests, 604 SyntacticMatches, 37 SemanticMatches, 293 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 5820 ImplicationChecksByTransitivity, 96.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=11, InterpolantAutomatonStates: 142, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 87 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 88.0s InterpolantComputationTime, 969 NumberOfCodeBlocks, 969 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1094 ConstructedInterpolants, 117 QuantifiedInterpolants, 51768 SizeOfPredicates, 54 NumberOfNonLiveVariables, 2162 ConjunctsInSsa, 400 ConjunctsInUnsatCore, 22 InterpolantComputations, 7 PerfectInterpolantSequences, 439/573 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: OVERALL_TIME: 3.5s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 9, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 54, DAG_INTERPRETER_EARLY_EXITS: 4, TOOLS_POST_APPLICATIONS: 60, TOOLS_POST_TIME: 1.6s, TOOLS_POST_CALL_APPLICATIONS: 35, TOOLS_POST_CALL_TIME: 0.7s, TOOLS_POST_RETURN_APPLICATIONS: 26, TOOLS_POST_RETURN_TIME: 0.3s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 121, TOOLS_QUANTIFIERELIM_TIME: 2.6s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.5s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 174, FLUID_YES_ANSWERS: 10, DOMAIN_JOIN_APPLICATIONS: 31, DOMAIN_JOIN_TIME: 0.3s, DOMAIN_ALPHA_APPLICATIONS: 10, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 3, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 6, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 54, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 3, LOOP_SUMMARIZER_CACHE_MISSES: 3, LOOP_SUMMARIZER_OVERALL_TIME: 1.1s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 1.1s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 6, CALL_SUMMARIZER_APPLICATIONS: 26, CALL_SUMMARIZER_CACHE_MISSES: 7, CALL_SUMMARIZER_OVERALL_TIME: 0.2s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.2s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 1097, DAG_COMPRESSION_RETAINED_NODES: 193, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-14 04:42:03,890 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6325d4a5-a95e-4dc3-89c1-6431d55acca4/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE