./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/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_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:16:21,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:16:21,385 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 03:16:21,395 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:16:21,395 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:16:21,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:16:21,450 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:16:21,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:16:21,452 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:16:21,453 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:16:21,454 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:16:21,454 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:16:21,455 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:16:21,455 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:16:21,455 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:16:21,455 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:16:21,456 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:16:21,456 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:16:21,456 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:16:21,457 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:16:21,457 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:16:21,457 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:16:21,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:16:21,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:16:21,458 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:16:21,458 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:16:21,458 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:16:21,458 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:16:21,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:16:21,458 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:16:21,458 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:16:21,459 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 03:16:21,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:16:21,459 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:16:21,459 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:16:21,459 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:16:21,459 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:16:21,459 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:16:21,459 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:16:21,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:16:21,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:16:21,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:16:21,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:16:21,460 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:16:21,460 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:16:21,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:16:21,460 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:16:21,460 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:16:21,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:16:21,461 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_a0c6f88e-7183-40f0-89ac-2da907d780a8/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc [2024-11-14 03:16:21,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:16:21,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:16:21,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:16:21,935 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:16:21,936 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:16:21,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/list-simple/dll2c_append_equal.i Unable to find full path for "g++" [2024-11-14 03:16:24,287 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:16:24,639 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:16:24,640 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/sv-benchmarks/c/list-simple/dll2c_append_equal.i [2024-11-14 03:16:24,655 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/data/32c5469e7/ca0fe05c18e1422b92c54ebbc0941145/FLAG5eb4f2fe0 [2024-11-14 03:16:24,868 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/data/32c5469e7/ca0fe05c18e1422b92c54ebbc0941145 [2024-11-14 03:16:24,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:16:24,873 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:16:24,875 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:16:24,875 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:16:24,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:16:24,882 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:16:24" (1/1) ... [2024-11-14 03:16:24,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73c18938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:16:24, skipping insertion in model container [2024-11-14 03:16:24,884 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:16:24" (1/1) ... [2024-11-14 03:16:24,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:16:25,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:16:25,301 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:16:25,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:16:25,428 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:16:25,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:16:25 WrapperNode [2024-11-14 03:16:25,429 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:16:25,432 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:16:25,432 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:16:25,433 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:16:25,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:16:25" (1/1) ... [2024-11-14 03:16:25,461 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:16:25" (1/1) ... [2024-11-14 03:16:25,498 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 142 [2024-11-14 03:16:25,498 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:16:25,503 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:16:25,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:16:25,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:16:25,513 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:16:25" (1/1) ... [2024-11-14 03:16:25,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:16:25" (1/1) ... [2024-11-14 03:16:25,519 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:16:25" (1/1) ... [2024-11-14 03:16:25,519 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:16:25" (1/1) ... [2024-11-14 03:16:25,533 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:16:25" (1/1) ... [2024-11-14 03:16:25,538 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:16:25" (1/1) ... [2024-11-14 03:16:25,540 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:16:25" (1/1) ... [2024-11-14 03:16:25,541 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:16:25" (1/1) ... [2024-11-14 03:16:25,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:16:25,547 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:16:25,547 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:16:25,547 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:16:25,548 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:16:25" (1/1) ... [2024-11-14 03:16:25,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:16:25,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:16:25,593 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:16:25,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:16:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 03:16:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 03:16:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-14 03:16:25,627 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-14 03:16:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 03:16:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:16:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 03:16:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 03:16:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 03:16:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 03:16:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 03:16:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:16:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:16:25,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:16:25,808 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:16:25,810 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:16:26,579 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2024-11-14 03:16:26,579 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:16:26,648 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:16:26,648 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-14 03:16:26,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:16:26 BoogieIcfgContainer [2024-11-14 03:16:26,649 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:16:26,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:16:26,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:16:26,682 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:16:26,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:16:24" (1/3) ... [2024-11-14 03:16:26,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@233e8b68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:16:26, skipping insertion in model container [2024-11-14 03:16:26,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:16:25" (2/3) ... [2024-11-14 03:16:26,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@233e8b68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:16:26, skipping insertion in model container [2024-11-14 03:16:26,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:16:26" (3/3) ... [2024-11-14 03:16:26,687 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_equal.i [2024-11-14 03:16:26,707 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:16:26,709 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_append_equal.i that has 2 procedures, 120 locations, 1 initial locations, 3 loop locations, and 60 error locations. [2024-11-14 03:16:26,760 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:16:26,777 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=None, 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;@ece125e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:16:26,777 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2024-11-14 03:16:26,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 55 states have (on average 2.290909090909091) internal successors, (126), 115 states have internal predecessors, (126), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:16:26,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 03:16:26,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:16:26,790 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-14 03:16:26,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-14 03:16:26,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:16:26,797 INFO L85 PathProgramCache]: Analyzing trace with hash 232399780, now seen corresponding path program 1 times [2024-11-14 03:16:26,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:16:26,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361425613] [2024-11-14 03:16:26,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:26,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:16:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:16:27,160 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:16:27,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361425613] [2024-11-14 03:16:27,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361425613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:16:27,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:16:27,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:16:27,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792511460] [2024-11-14 03:16:27,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:16:27,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:16:27,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:16:27,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:16:27,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:16:27,213 INFO L87 Difference]: Start difference. First operand has 120 states, 55 states have (on average 2.290909090909091) internal successors, (126), 115 states have internal predecessors, (126), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:27,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:16:27,457 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2024-11-14 03:16:27,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:16:27,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-14 03:16:27,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:16:27,469 INFO L225 Difference]: With dead ends: 116 [2024-11-14 03:16:27,469 INFO L226 Difference]: Without dead ends: 114 [2024-11-14 03:16:27,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:16:27,475 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 2 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:16:27,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 164 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:16:27,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-14 03:16:27,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-14 03:16:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 53 states have (on average 2.188679245283019) internal successors, (116), 109 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:16:27,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2024-11-14 03:16:27,542 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 5 [2024-11-14 03:16:27,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:16:27,543 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2024-11-14 03:16:27,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:27,543 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2024-11-14 03:16:27,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 03:16:27,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:16:27,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-14 03:16:27,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:16:27,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-14 03:16:27,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:16:27,547 INFO L85 PathProgramCache]: Analyzing trace with hash 232399781, now seen corresponding path program 1 times [2024-11-14 03:16:27,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:16:27,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35306309] [2024-11-14 03:16:27,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:27,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:16:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:16:27,744 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:16:27,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35306309] [2024-11-14 03:16:27,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35306309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:16:27,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:16:27,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:16:27,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101147972] [2024-11-14 03:16:27,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:16:27,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:16:27,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:16:27,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:16:27,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:16:27,747 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:27,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:16:27,921 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2024-11-14 03:16:27,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:16:27,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-14 03:16:27,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:16:27,925 INFO L225 Difference]: With dead ends: 111 [2024-11-14 03:16:27,925 INFO L226 Difference]: Without dead ends: 111 [2024-11-14 03:16:27,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:16:27,926 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 2 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:16:27,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 168 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:16:27,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-14 03:16:27,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-14 03:16:27,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 53 states have (on average 2.1320754716981134) internal successors, (113), 106 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:16:27,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2024-11-14 03:16:27,937 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 5 [2024-11-14 03:16:27,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:16:27,938 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2024-11-14 03:16:27,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:16:27,938 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2024-11-14 03:16:27,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 03:16:27,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:16:27,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:16:27,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 03:16:27,939 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-14 03:16:27,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:16:27,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1029890013, now seen corresponding path program 1 times [2024-11-14 03:16:27,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:16:27,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433490404] [2024-11-14 03:16:27,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:27,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:16:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:28,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:16:28,087 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:16:28,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433490404] [2024-11-14 03:16:28,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433490404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:16:28,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:16:28,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:16:28,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411439104] [2024-11-14 03:16:28,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:16:28,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:16:28,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:16:28,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:16:28,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:16:28,090 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:16:28,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:16:28,162 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2024-11-14 03:16:28,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:16:28,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-14 03:16:28,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:16:28,165 INFO L225 Difference]: With dead ends: 112 [2024-11-14 03:16:28,165 INFO L226 Difference]: Without dead ends: 112 [2024-11-14 03:16:28,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:16:28,169 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 10 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:16:28,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 196 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:16:28,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-14 03:16:28,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-14 03:16:28,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 54 states have (on average 2.111111111111111) internal successors, (114), 107 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:16:28,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2024-11-14 03:16:28,189 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 11 [2024-11-14 03:16:28,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:16:28,190 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2024-11-14 03:16:28,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:16:28,190 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2024-11-14 03:16:28,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 03:16:28,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:16:28,191 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:16:28,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 03:16:28,191 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-14 03:16:28,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:16:28,192 INFO L85 PathProgramCache]: Analyzing trace with hash 569888851, now seen corresponding path program 1 times [2024-11-14 03:16:28,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:16:28,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395991995] [2024-11-14 03:16:28,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:28,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:16:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:28,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:16:28,513 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:16:28,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395991995] [2024-11-14 03:16:28,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395991995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:16:28,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:16:28,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:16:28,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646891438] [2024-11-14 03:16:28,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:16:28,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:16:28,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:16:28,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:16:28,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:16:28,516 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:16:28,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:16:28,885 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2024-11-14 03:16:28,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:16:28,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-14 03:16:28,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:16:28,887 INFO L225 Difference]: With dead ends: 111 [2024-11-14 03:16:28,887 INFO L226 Difference]: Without dead ends: 111 [2024-11-14 03:16:28,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:16:28,889 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 7 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:16:28,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 305 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:16:28,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-14 03:16:28,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-14 03:16:28,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 106 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:16:28,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2024-11-14 03:16:28,907 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 19 [2024-11-14 03:16:28,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:16:28,907 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2024-11-14 03:16:28,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:16:28,908 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2024-11-14 03:16:28,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 03:16:28,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:16:28,909 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:16:28,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 03:16:28,909 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-14 03:16:28,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:16:28,910 INFO L85 PathProgramCache]: Analyzing trace with hash 569888852, now seen corresponding path program 1 times [2024-11-14 03:16:28,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:16:28,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9115981] [2024-11-14 03:16:28,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:28,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:16:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:29,339 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:16:29,340 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:16:29,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9115981] [2024-11-14 03:16:29,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9115981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:16:29,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:16:29,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:16:29,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693808873] [2024-11-14 03:16:29,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:16:29,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:16:29,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:16:29,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:16:29,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:16:29,344 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:16:29,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:16:29,615 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2024-11-14 03:16:29,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:16:29,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-14 03:16:29,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:16:29,617 INFO L225 Difference]: With dead ends: 110 [2024-11-14 03:16:29,617 INFO L226 Difference]: Without dead ends: 110 [2024-11-14 03:16:29,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:16:29,620 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 6 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:16:29,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 365 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:16:29,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-14 03:16:29,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-14 03:16:29,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 54 states have (on average 2.074074074074074) internal successors, (112), 105 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:16:29,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2024-11-14 03:16:29,637 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 19 [2024-11-14 03:16:29,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:16:29,637 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2024-11-14 03:16:29,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:16:29,638 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2024-11-14 03:16:29,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 03:16:29,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:16:29,638 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:16:29,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 03:16:29,642 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-14 03:16:29,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:16:29,642 INFO L85 PathProgramCache]: Analyzing trace with hash -2092628396, now seen corresponding path program 1 times [2024-11-14 03:16:29,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:16:29,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351452122] [2024-11-14 03:16:29,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:29,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:16:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:16:30,077 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:16:30,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351452122] [2024-11-14 03:16:30,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351452122] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:16:30,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515745846] [2024-11-14 03:16:30,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:30,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:16:30,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:16:30,083 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:16:30,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 03:16:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:30,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-14 03:16:30,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:16:30,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:16:30,359 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-14 03:16:30,414 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 03:16:30,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-14 03:16:30,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-14 03:16:30,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:16:30,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:16:30,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515745846] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:16:30,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [310271591] [2024-11-14 03:16:30,792 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-14 03:16:30,792 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:16:30,797 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:16:30,803 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:16:30,804 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:16:32,715 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-14 03:16:33,853 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:16:50,076 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1394#(and (not (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.base_101| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_101| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_101| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))))) (exists ((|v_#memory_int_81| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_81| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_int_81| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))))) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) 1)) (exists ((|v_#memory_$Pointer$.offset_101| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_101| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_101| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 0)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-14 03:16:50,077 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:16:50,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:16:50,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 11 [2024-11-14 03:16:50,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761927963] [2024-11-14 03:16:50,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:16:50,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 03:16:50,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:16:50,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 03:16:50,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=470, Unknown=3, NotChecked=44, Total=600 [2024-11-14 03:16:50,083 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 12 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 03:16:51,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:16:51,113 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2024-11-14 03:16:51,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:16:51,114 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 21 [2024-11-14 03:16:51,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:16:51,116 INFO L225 Difference]: With dead ends: 115 [2024-11-14 03:16:51,116 INFO L226 Difference]: Without dead ends: 115 [2024-11-14 03:16:51,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=89, Invalid=512, Unknown=3, NotChecked=46, Total=650 [2024-11-14 03:16:51,117 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 1 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:16:51,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 435 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 478 Invalid, 0 Unknown, 121 Unchecked, 0.9s Time] [2024-11-14 03:16:51,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-14 03:16:51,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-14 03:16:51,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 58 states have (on average 2.0344827586206895) internal successors, (118), 109 states have internal predecessors, (118), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:16:51,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2024-11-14 03:16:51,125 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 21 [2024-11-14 03:16:51,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:16:51,125 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2024-11-14 03:16:51,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 03:16:51,126 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2024-11-14 03:16:51,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 03:16:51,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:16:51,126 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:16:51,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 03:16:51,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-14 03:16:51,331 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-14 03:16:51,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:16:51,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2092628395, now seen corresponding path program 1 times [2024-11-14 03:16:51,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:16:51,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036132264] [2024-11-14 03:16:51,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:51,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:16:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:52,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:16:52,143 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:16:52,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036132264] [2024-11-14 03:16:52,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036132264] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:16:52,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109532085] [2024-11-14 03:16:52,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:16:52,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:16:52,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:16:52,147 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:16:52,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 03:16:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:16:52,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-14 03:16:52,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:16:52,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:16:52,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 03:16:52,568 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:16:52,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:16:52,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 03:16:52,658 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:16:52,658 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:16:52,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109532085] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:16:52,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1647616334] [2024-11-14 03:16:52,947 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-14 03:16:52,948 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:16:52,949 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:16:52,949 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:16:52,949 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:16:53,786 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-14 03:16:54,476 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:17:10,825 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1730#(and (exists ((|v_#memory_$Pointer$.offset_115| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_115| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_115| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 0)))) (not (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (<= 1 |#StackHeapBarrier|) (exists ((|v_#memory_int_95| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_95| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_int_95| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))))) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (exists ((|v_#memory_$Pointer$.base_115| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_115| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_115| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))))) (<= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) 7) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-14 03:17:10,825 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:17:10,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:17:10,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2024-11-14 03:17:10,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792790486] [2024-11-14 03:17:10,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:17:10,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 03:17:10,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:17:10,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 03:17:10,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=666, Unknown=2, NotChecked=0, Total=756 [2024-11-14 03:17:10,827 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand has 13 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:17:12,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:17:12,249 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2024-11-14 03:17:12,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:17:12,250 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-11-14 03:17:12,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:17:12,251 INFO L225 Difference]: With dead ends: 115 [2024-11-14 03:17:12,251 INFO L226 Difference]: Without dead ends: 115 [2024-11-14 03:17:12,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=103, Invalid=765, Unknown=2, NotChecked=0, Total=870 [2024-11-14 03:17:12,253 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:17:12,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 501 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-14 03:17:12,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-14 03:17:12,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-14 03:17:12,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 58 states have (on average 2.0172413793103448) internal successors, (117), 109 states have internal predecessors, (117), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:17:12,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2024-11-14 03:17:12,261 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 21 [2024-11-14 03:17:12,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:17:12,261 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2024-11-14 03:17:12,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:17:12,262 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2024-11-14 03:17:12,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 03:17:12,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:17:12,262 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:17:12,290 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 03:17:12,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:17:12,463 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-14 03:17:12,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:17:12,464 INFO L85 PathProgramCache]: Analyzing trace with hash -971033385, now seen corresponding path program 1 times [2024-11-14 03:17:12,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:17:12,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687351820] [2024-11-14 03:17:12,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:17:12,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:17:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:17:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:17:12,640 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:17:12,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687351820] [2024-11-14 03:17:12,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687351820] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:17:12,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522649824] [2024-11-14 03:17:12,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:17:12,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:17:12,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:17:12,644 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:17:12,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 03:17:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:17:12,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-14 03:17:12,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:17:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:17:12,855 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:17:12,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:17:12,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522649824] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:17:12,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2021617890] [2024-11-14 03:17:12,939 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-14 03:17:12,939 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:17:12,939 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:17:12,939 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:17:12,939 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:17:13,673 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2024-11-14 03:17:13,791 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:17:31,353 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2115#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_20| Int)) (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_20|) 1))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-14 03:17:31,353 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:17:31,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:17:31,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-14 03:17:31,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854332191] [2024-11-14 03:17:31,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:17:31,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:17:31,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:17:31,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:17:31,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=355, Unknown=7, NotChecked=0, Total=420 [2024-11-14 03:17:31,355 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:17:31,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:17:31,544 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2024-11-14 03:17:31,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:17:31,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-14 03:17:31,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:17:31,545 INFO L225 Difference]: With dead ends: 115 [2024-11-14 03:17:31,546 INFO L226 Difference]: Without dead ends: 115 [2024-11-14 03:17:31,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=58, Invalid=355, Unknown=7, NotChecked=0, Total=420 [2024-11-14 03:17:31,546 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:17:31,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 476 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:17:31,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-14 03:17:31,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-14 03:17:31,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 58 states have (on average 2.0) internal successors, (116), 109 states have internal predecessors, (116), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:17:31,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2024-11-14 03:17:31,553 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 23 [2024-11-14 03:17:31,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:17:31,553 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2024-11-14 03:17:31,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:17:31,553 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2024-11-14 03:17:31,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 03:17:31,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:17:31,554 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:17:31,577 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 03:17:31,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-14 03:17:31,754 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-14 03:17:31,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:17:31,755 INFO L85 PathProgramCache]: Analyzing trace with hash -42240757, now seen corresponding path program 1 times [2024-11-14 03:17:31,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:17:31,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870977924] [2024-11-14 03:17:31,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:17:31,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:17:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:17:31,935 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 03:17:31,935 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:17:31,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870977924] [2024-11-14 03:17:31,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870977924] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:17:31,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704072678] [2024-11-14 03:17:31,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:17:31,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:17:31,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:17:31,939 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:17:31,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 03:17:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:17:32,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-14 03:17:32,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:17:32,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:17:32,258 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-14 03:17:32,335 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-14 03:17:32,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-14 03:17:32,359 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2024-11-14 03:17:32,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:17:32,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704072678] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:17:32,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1238909313] [2024-11-14 03:17:32,470 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 03:17:32,470 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:17:32,470 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:17:32,470 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:17:32,470 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:17:33,405 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-14 03:17:34,133 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:17:56,527 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2464#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_21| Int)) (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_21|) 1))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-14 03:17:56,527 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:17:56,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:17:56,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2024-11-14 03:17:56,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264390206] [2024-11-14 03:17:56,528 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:17:56,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 03:17:56,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:17:56,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 03:17:56,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=570, Unknown=6, NotChecked=48, Total=702 [2024-11-14 03:17:56,530 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 10 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:17:57,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:17:57,522 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2024-11-14 03:17:57,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:17:57,524 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-11-14 03:17:57,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:17:57,525 INFO L225 Difference]: With dead ends: 114 [2024-11-14 03:17:57,528 INFO L226 Difference]: Without dead ends: 114 [2024-11-14 03:17:57,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=95, Invalid=715, Unknown=6, NotChecked=54, Total=870 [2024-11-14 03:17:57,530 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 9 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:17:57,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 384 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 403 Invalid, 0 Unknown, 118 Unchecked, 0.8s Time] [2024-11-14 03:17:57,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-14 03:17:57,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-14 03:17:57,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 58 states have (on average 1.9827586206896552) internal successors, (115), 108 states have internal predecessors, (115), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 03:17:57,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2024-11-14 03:17:57,544 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 24 [2024-11-14 03:17:57,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:17:57,545 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2024-11-14 03:17:57,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:17:57,545 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2024-11-14 03:17:57,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 03:17:57,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:17:57,547 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:17:57,577 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 03:17:57,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-14 03:17:57,748 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-14 03:17:57,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:17:57,749 INFO L85 PathProgramCache]: Analyzing trace with hash -42240756, now seen corresponding path program 1 times [2024-11-14 03:17:57,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:17:57,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467897325] [2024-11-14 03:17:57,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:17:57,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:17:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:17:58,243 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:17:58,244 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:17:58,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467897325] [2024-11-14 03:17:58,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467897325] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:17:58,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165179912] [2024-11-14 03:17:58,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:17:58,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:17:58,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:17:58,248 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:17:58,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 03:17:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:17:58,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 03:17:58,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:17:58,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 03:17:58,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:17:58,783 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-14 03:17:58,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:17:58,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 03:17:58,872 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:17:58,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:17:58,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-14 03:17:58,975 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:17:59,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165179912] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:17:59,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1033073224] [2024-11-14 03:17:59,218 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-14 03:17:59,218 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:17:59,218 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:17:59,218 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:17:59,219 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:18:00,267 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2024-11-14 03:18:00,780 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:18:19,068 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2824#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_22| Int)) (<= (select |#length| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_22|) 3)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2024-11-14 03:18:19,068 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:18:19,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:18:19,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-11-14 03:18:19,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199376961] [2024-11-14 03:18:19,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:18:19,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 03:18:19,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:18:19,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 03:18:19,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=887, Unknown=3, NotChecked=60, Total=1056 [2024-11-14 03:18:19,071 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 15 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:18:20,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:18:20,497 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2024-11-14 03:18:20,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 03:18:20,499 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-11-14 03:18:20,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:18:20,502 INFO L225 Difference]: With dead ends: 131 [2024-11-14 03:18:20,502 INFO L226 Difference]: Without dead ends: 131 [2024-11-14 03:18:20,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=137, Invalid=1124, Unknown=3, NotChecked=68, Total=1332 [2024-11-14 03:18:20,504 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 24 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:18:20,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 618 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 424 Invalid, 0 Unknown, 140 Unchecked, 1.1s Time] [2024-11-14 03:18:20,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-14 03:18:20,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 124. [2024-11-14 03:18:20,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 117 states have internal predecessors, (129), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-14 03:18:20,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 139 transitions. [2024-11-14 03:18:20,513 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 139 transitions. Word has length 24 [2024-11-14 03:18:20,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:18:20,513 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 139 transitions. [2024-11-14 03:18:20,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:18:20,514 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 139 transitions. [2024-11-14 03:18:20,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 03:18:20,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:18:20,515 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:18:20,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 03:18:20,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-14 03:18:20,716 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-14 03:18:20,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:18:20,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1309463463, now seen corresponding path program 1 times [2024-11-14 03:18:20,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:18:20,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892206682] [2024-11-14 03:18:20,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:18:20,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:18:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:18:20,974 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:18:20,974 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:18:20,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892206682] [2024-11-14 03:18:20,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892206682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:18:20,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:18:20,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:18:20,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610162239] [2024-11-14 03:18:20,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:18:20,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:18:20,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:18:20,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:18:20,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:18:20,979 INFO L87 Difference]: Start difference. First operand 124 states and 139 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:18:21,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:18:21,982 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2024-11-14 03:18:21,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:18:21,983 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-14 03:18:21,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:18:21,985 INFO L225 Difference]: With dead ends: 123 [2024-11-14 03:18:21,985 INFO L226 Difference]: Without dead ends: 123 [2024-11-14 03:18:21,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:18:21,986 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 6 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:18:21,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 351 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-14 03:18:21,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-14 03:18:21,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-14 03:18:21,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 67 states have (on average 1.9104477611940298) internal successors, (128), 116 states have internal predecessors, (128), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-14 03:18:21,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 138 transitions. [2024-11-14 03:18:21,993 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 138 transitions. Word has length 25 [2024-11-14 03:18:21,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:18:21,993 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 138 transitions. [2024-11-14 03:18:21,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:18:21,994 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 138 transitions. [2024-11-14 03:18:21,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 03:18:21,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:18:21,995 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:18:21,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 03:18:21,996 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-14 03:18:21,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:18:21,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1309463462, now seen corresponding path program 1 times [2024-11-14 03:18:21,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:18:21,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722690513] [2024-11-14 03:18:21,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:18:21,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:18:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:18:22,449 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:18:22,449 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:18:22,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722690513] [2024-11-14 03:18:22,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722690513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:18:22,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:18:22,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:18:22,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551844486] [2024-11-14 03:18:22,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:18:22,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:18:22,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:18:22,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:18:22,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:18:22,452 INFO L87 Difference]: Start difference. First operand 123 states and 138 transitions. Second operand has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:18:23,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:18:23,426 INFO L93 Difference]: Finished difference Result 122 states and 137 transitions. [2024-11-14 03:18:23,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:18:23,427 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-14 03:18:23,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:18:23,428 INFO L225 Difference]: With dead ends: 122 [2024-11-14 03:18:23,429 INFO L226 Difference]: Without dead ends: 122 [2024-11-14 03:18:23,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:18:23,430 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 5 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:18:23,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 376 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-14 03:18:23,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-14 03:18:23,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-14 03:18:23,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 115 states have internal predecessors, (127), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-14 03:18:23,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 137 transitions. [2024-11-14 03:18:23,437 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 137 transitions. Word has length 25 [2024-11-14 03:18:23,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:18:23,439 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 137 transitions. [2024-11-14 03:18:23,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:18:23,440 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 137 transitions. [2024-11-14 03:18:23,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 03:18:23,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:18:23,441 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:18:23,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 03:18:23,441 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-14 03:18:23,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:18:23,442 INFO L85 PathProgramCache]: Analyzing trace with hash -494962174, now seen corresponding path program 1 times [2024-11-14 03:18:23,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:18:23,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962806220] [2024-11-14 03:18:23,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:18:23,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:18:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:18:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-14 03:18:23,603 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:18:23,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962806220] [2024-11-14 03:18:23,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962806220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:18:23,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:18:23,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:18:23,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512034305] [2024-11-14 03:18:23,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:18:23,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:18:23,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:18:23,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:18:23,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:18:23,607 INFO L87 Difference]: Start difference. First operand 122 states and 137 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:18:23,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:18:23,760 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2024-11-14 03:18:23,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:18:23,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2024-11-14 03:18:23,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:18:23,762 INFO L225 Difference]: With dead ends: 104 [2024-11-14 03:18:23,763 INFO L226 Difference]: Without dead ends: 104 [2024-11-14 03:18:23,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:18:23,764 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:18:23,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 276 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:18:23,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-14 03:18:23,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-14 03:18:23,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 54 states have (on average 1.9259259259259258) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:18:23,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2024-11-14 03:18:23,774 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 34 [2024-11-14 03:18:23,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:18:23,775 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2024-11-14 03:18:23,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:18:23,775 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2024-11-14 03:18:23,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 03:18:23,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:18:23,777 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:18:23,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 03:18:23,777 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-14 03:18:23,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:18:23,778 INFO L85 PathProgramCache]: Analyzing trace with hash 789192447, now seen corresponding path program 1 times [2024-11-14 03:18:23,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:18:23,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261357403] [2024-11-14 03:18:23,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:18:23,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:18:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:18:24,811 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:18:24,811 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:18:24,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261357403] [2024-11-14 03:18:24,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261357403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:18:24,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118740566] [2024-11-14 03:18:24,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:18:24,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:18:24,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:18:24,814 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:18:24,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 03:18:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:18:25,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-14 03:18:25,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:18:25,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:18:25,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 03:18:25,104 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-11-14 03:18:25,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:18:25,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 03:18:25,198 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-14 03:18:25,271 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 03:18:25,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-14 03:18:25,458 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 03:18:25,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-14 03:18:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 10 not checked. [2024-11-14 03:18:25,513 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:18:26,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118740566] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:18:26,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [254535698] [2024-11-14 03:18:26,367 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-14 03:18:26,367 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:18:26,368 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:18:26,368 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:18:26,368 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:18:27,507 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 03:18:27,548 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:18:42,385 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4016#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_append_~data#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_22| Int)) (and (or (and (exists ((|v_#memory_int_190| (Array Int (Array Int Int))) (|v_#memory_int_188| (Array Int (Array Int Int))) (|v_#memory_int_189| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_189| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_189| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_190| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4))) |v_#memory_int_190|) (= |#memory_int| (store |v_#memory_int_190| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_190| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8 1))) (= |v_#memory_int_189| (store |v_#memory_int_188| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_188| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_189| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))))) (exists ((|v_#length_159| (Array Int Int))) (= (store |v_#length_159| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 12) |#length|)) (exists ((|v_#valid_191| (Array Int Int))) (and (= (select |v_#valid_191| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (store |v_#valid_191| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#valid|))) (<= (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_214| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_47| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_47| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_#memory_$Pointer$.base_214| (Array Int (Array Int Int))) (|v_#memory_int_194| (Array Int (Array Int Int))) (|v_#memory_int_195| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_194| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_194| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_195| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_195|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (store (store |v_#memory_$Pointer$.base_214| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_214| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_214| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_214| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select (select (store (store |v_#memory_$Pointer$.offset_214| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_214| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_214| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_214| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 8 (select |v_old(#length)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select |v_old(#valid)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= |v_old(#memory_int)_AFTER_CALL_47| (store |v_#memory_int_195| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_195| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select |v_old(#valid)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (<= 4 (select |v_old(#length)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))))) (exists ((|v_#memory_$Pointer$.base_208| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_208| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_208| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_208| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_208| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_208| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (= |v_ULTIMATE.start_dll_circular_append_~head#1.base_22| |ULTIMATE.start_main_~#s~0#1.base|)) (and (exists ((|v_#memory_int_190| (Array Int (Array Int Int))) (|v_#memory_int_188| (Array Int (Array Int Int))) (|v_#memory_int_189| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_189| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_189| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_190| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4))) |v_#memory_int_190|) (= |#memory_int| (store |v_#memory_int_190| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_190| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8 1))) (= |v_#memory_int_189| (store |v_#memory_int_188| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_188| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_189| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))))) (exists ((|v_#memory_$Pointer$.offset_214| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_46| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_#memory_$Pointer$.base_214| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (Array Int (Array Int Int))) (|v_#memory_int_194| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_80| (Array Int Int)) (|v_#memory_int_195| (Array Int (Array Int Int)))) (and (= (select (select (store (store |v_#memory_$Pointer$.offset_214| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_214| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_214| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_214| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (= (store (store |v_#memory_$Pointer$.base_214| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_214| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_214| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_214| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_46|) (<= 4 (select |v_#length_BEFORE_CALL_80| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= (store |v_#memory_int_194| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_194| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_195| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_195|) (<= 8 (select |v_#length_BEFORE_CALL_80| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |v_old(#memory_int)_AFTER_CALL_46| (store |v_#memory_int_195| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_195| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))))) (exists ((|v_#length_159| (Array Int Int))) (= (store |v_#length_159| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 12) |#length|)) (exists ((|v_#valid_191| (Array Int Int))) (and (= (select |v_#valid_191| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (store |v_#valid_191| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#valid|))) (<= (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_208| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_208| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_208| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_208| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_208| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_208| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (= |v_ULTIMATE.start_dll_circular_append_~head#1.base_22| |ULTIMATE.start_main_~#s~0#1.base|))) (not (= (select |#valid| |v_ULTIMATE.start_dll_circular_append_~head#1.base_22|) 1)))) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| 0))' at error location [2024-11-14 03:18:42,385 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:18:42,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:18:42,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 13 [2024-11-14 03:18:42,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905099121] [2024-11-14 03:18:42,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:18:42,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 03:18:42,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:18:42,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 03:18:42,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1081, Unknown=3, NotChecked=134, Total=1332 [2024-11-14 03:18:42,388 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand has 15 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 3 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-14 03:18:44,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:18:44,103 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2024-11-14 03:18:44,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:18:44,104 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 3 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 34 [2024-11-14 03:18:44,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:18:44,106 INFO L225 Difference]: With dead ends: 113 [2024-11-14 03:18:44,106 INFO L226 Difference]: Without dead ends: 113 [2024-11-14 03:18:44,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 67 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=137, Invalid=1274, Unknown=3, NotChecked=146, Total=1560 [2024-11-14 03:18:44,107 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 105 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 230 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:18:44,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 262 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 462 Invalid, 0 Unknown, 230 Unchecked, 1.4s Time] [2024-11-14 03:18:44,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-14 03:18:44,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 96. [2024-11-14 03:18:44,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 91 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:18:44,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2024-11-14 03:18:44,114 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 34 [2024-11-14 03:18:44,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:18:44,115 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2024-11-14 03:18:44,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 3 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-14 03:18:44,115 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2024-11-14 03:18:44,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 03:18:44,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:18:44,117 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:18:44,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 03:18:44,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:18:44,317 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-14 03:18:44,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:18:44,318 INFO L85 PathProgramCache]: Analyzing trace with hash 789192448, now seen corresponding path program 1 times [2024-11-14 03:18:44,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:18:44,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355137477] [2024-11-14 03:18:44,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:18:44,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:18:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:18:45,606 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:18:45,606 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:18:45,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355137477] [2024-11-14 03:18:45,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355137477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:18:45,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50525843] [2024-11-14 03:18:45,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:18:45,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:18:45,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:18:45,609 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:18:45,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 03:18:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:18:45,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 03:18:45,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:18:45,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 03:18:45,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 03:18:45,966 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-14 03:18:46,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:18:46,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 03:18:46,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 03:18:46,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:18:46,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 03:18:46,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 03:18:46,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:18:46,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 03:18:46,567 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-14 03:18:46,567 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:18:46,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50525843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:18:46,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:18:46,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2024-11-14 03:18:46,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83590573] [2024-11-14 03:18:46,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:18:46,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:18:46,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:18:46,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:18:46,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=254, Unknown=1, NotChecked=32, Total=342 [2024-11-14 03:18:46,569 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:18:47,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:18:47,118 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2024-11-14 03:18:47,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:18:47,120 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2024-11-14 03:18:47,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:18:47,121 INFO L225 Difference]: With dead ends: 91 [2024-11-14 03:18:47,122 INFO L226 Difference]: Without dead ends: 91 [2024-11-14 03:18:47,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=285, Unknown=1, NotChecked=34, Total=380 [2024-11-14 03:18:47,123 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 24 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:18:47,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 219 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 192 Invalid, 0 Unknown, 123 Unchecked, 0.5s Time] [2024-11-14 03:18:47,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-14 03:18:47,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-14 03:18:47,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 86 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:18:47,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2024-11-14 03:18:47,130 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 34 [2024-11-14 03:18:47,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:18:47,132 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2024-11-14 03:18:47,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:18:47,133 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2024-11-14 03:18:47,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 03:18:47,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:18:47,133 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 03:18:47,162 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 03:18:47,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-14 03:18:47,334 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-14 03:18:47,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:18:47,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1795269280, now seen corresponding path program 1 times [2024-11-14 03:18:47,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:18:47,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032442564] [2024-11-14 03:18:47,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:18:47,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:18:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:18:47,586 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 03:18:47,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:18:47,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032442564] [2024-11-14 03:18:47,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032442564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:18:47,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:18:47,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:18:47,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294554371] [2024-11-14 03:18:47,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:18:47,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:18:47,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:18:47,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:18:47,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:18:47,588 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 6 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-14 03:18:48,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:18:48,336 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2024-11-14 03:18:48,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:18:48,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-11-14 03:18:48,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:18:48,339 INFO L225 Difference]: With dead ends: 87 [2024-11-14 03:18:48,339 INFO L226 Difference]: Without dead ends: 87 [2024-11-14 03:18:48,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:18:48,340 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 17 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:18:48,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 217 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:18:48,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-14 03:18:48,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-14 03:18:48,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 82 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:18:48,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2024-11-14 03:18:48,346 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 36 [2024-11-14 03:18:48,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:18:48,347 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2024-11-14 03:18:48,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-14 03:18:48,347 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2024-11-14 03:18:48,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 03:18:48,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:18:48,349 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 03:18:48,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 03:18:48,349 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-14 03:18:48,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:18:48,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1795269279, now seen corresponding path program 1 times [2024-11-14 03:18:48,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:18:48,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60434038] [2024-11-14 03:18:48,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:18:48,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:18:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:18:48,743 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 03:18:48,744 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:18:48,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60434038] [2024-11-14 03:18:48,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60434038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:18:48,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:18:48,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:18:48,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294026951] [2024-11-14 03:18:48,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:18:48,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:18:48,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:18:48,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:18:48,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:18:48,750 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-14 03:18:49,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:18:49,398 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2024-11-14 03:18:49,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:18:49,399 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-11-14 03:18:49,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:18:49,400 INFO L225 Difference]: With dead ends: 83 [2024-11-14 03:18:49,400 INFO L226 Difference]: Without dead ends: 83 [2024-11-14 03:18:49,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:18:49,401 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 16 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:18:49,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 244 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 03:18:49,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-14 03:18:49,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-14 03:18:49,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.537037037037037) internal successors, (83), 78 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:18:49,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2024-11-14 03:18:49,410 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 36 [2024-11-14 03:18:49,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:18:49,412 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2024-11-14 03:18:49,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-14 03:18:49,412 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2024-11-14 03:18:49,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 03:18:49,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:18:49,413 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 03:18:49,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-14 03:18:49,414 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-14 03:18:49,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:18:49,414 INFO L85 PathProgramCache]: Analyzing trace with hash 181238113, now seen corresponding path program 1 times [2024-11-14 03:18:49,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:18:49,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144801292] [2024-11-14 03:18:49,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:18:49,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:18:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:18:52,388 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:18:52,389 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:18:52,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144801292] [2024-11-14 03:18:52,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144801292] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:18:52,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975541466] [2024-11-14 03:18:52,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:18:52,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:18:52,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:18:52,393 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:18:52,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 03:18:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:18:52,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-14 03:18:52,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:18:52,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 03:18:52,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:18:53,797 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 19 treesize of output 11 [2024-11-14 03:18:53,809 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 7 treesize of output 3 [2024-11-14 03:18:54,260 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_79| Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_79| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_79|))) (<= (+ |v_node_create_~temp~0#1.base_79| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |v_node_create_~temp~0#1.base_79| (select |c_#length| |v_node_create_~temp~0#1.base_79|)) |c_#length|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_79|) 0) (= (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_79| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_79|)) |c_#memory_$Pointer$.offset|))) is different from true [2024-11-14 03:18:54,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:18:54,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:18:54,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:18:54,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 03:18:54,320 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-14 03:18:54,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-14 03:18:54,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:18:54,477 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 17 treesize of output 9 [2024-11-14 03:18:54,597 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2024-11-14 03:18:54,597 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:18:55,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975541466] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:18:55,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1945174315] [2024-11-14 03:18:55,348 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-14 03:18:55,348 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:18:55,348 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:18:55,348 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:18:55,348 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:18:56,441 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 03:18:56,482 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:19:32,377 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5063#(and (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_dll_circular_append_~head#1.base|) (or (< (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 4) 0) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 8))) (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_circular_append_~head#1.base|) 1) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)))) (= |ULTIMATE.start_dll_circular_append_~data#1| 1) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_append_~head#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (or (and (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_231| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_231| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_231| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (exists ((|v_#length_174| (Array Int Int))) (= (store |v_#length_174| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 12) |#length|)) (<= (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_231| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_231| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_231| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (|v_#memory_$Pointer$.offset_237| (Array Int (Array Int Int))) (|v_#memory_int_213| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_237| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_97| (Array Int (Array Int Int))) (|v_#memory_int_212| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_109| (Array Int Int))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (store (store |v_#memory_$Pointer$.base_237| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_237| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_237| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_237| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 8 (select |v_#length_BEFORE_CALL_109| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select |v_old(#valid)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (= (store |v_#memory_int_212| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_212| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_213| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_213|) (= (store |v_#memory_int_213| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_213| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_#memory_int_BEFORE_CALL_97| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_#memory_int_BEFORE_CALL_97|) (<= 4 (select |v_#length_BEFORE_CALL_109| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= (select (select (store (store |v_#memory_$Pointer$.offset_237| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_237| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_237| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_237| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_61| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (exists ((|v_#valid_201| (Array Int Int))) (and (= (store |v_#valid_201| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_201| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (exists ((|v_#memory_int_206| (Array Int (Array Int Int))) (|v_#memory_int_207| (Array Int (Array Int Int))) (|v_#memory_int_208| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_206| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_206| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_207| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_207|) (= (store |v_#memory_int_208| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_208| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8 1)) |#memory_int|) (= (store |v_#memory_int_207| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_207| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_208| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4))) |v_#memory_int_208|)))) (and (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_237| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#memory_int_213| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_237| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_#memory_int_212| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_60| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_60| (Array Int Int))) (and (<= 4 (select |v_old(#length)_AFTER_CALL_60| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= (select (select (store (store |v_#memory_$Pointer$.offset_237| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_237| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_237| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_237| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 8 (select |v_old(#length)_AFTER_CALL_60| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |v_old(#memory_int)_AFTER_CALL_60| (store |v_#memory_int_213| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_213| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_60| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| (store (store |v_#memory_$Pointer$.base_237| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_237| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_237| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_237| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (store |v_#memory_int_212| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_212| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_213| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_213|) (= (select |v_old(#valid)_AFTER_CALL_60| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (select |v_old(#valid)_AFTER_CALL_60| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1))) (exists ((|v_#memory_$Pointer$.base_231| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_231| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_231| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (exists ((|v_#length_174| (Array Int Int))) (= (store |v_#length_174| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 12) |#length|)) (<= (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_231| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_231| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_231| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#valid_201| (Array Int Int))) (and (= (store |v_#valid_201| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_201| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (exists ((|v_#memory_int_206| (Array Int (Array Int Int))) (|v_#memory_int_207| (Array Int (Array Int Int))) (|v_#memory_int_208| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_206| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_206| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_207| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_207|) (= (store |v_#memory_int_208| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_208| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8 1)) |#memory_int|) (= (store |v_#memory_int_207| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_207| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_208| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4))) |v_#memory_int_208|))))) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| 0))' at error location [2024-11-14 03:19:32,377 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:19:32,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:19:32,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2024-11-14 03:19:32,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266528862] [2024-11-14 03:19:32,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:19:32,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-14 03:19:32,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:19:32,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-14 03:19:32,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2684, Unknown=7, NotChecked=104, Total=2970 [2024-11-14 03:19:32,380 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 29 states, 22 states have (on average 2.590909090909091) internal successors, (57), 25 states have internal predecessors, (57), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-14 03:19:36,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:19:36,952 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2024-11-14 03:19:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 03:19:36,953 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 22 states have (on average 2.590909090909091) internal successors, (57), 25 states have internal predecessors, (57), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2024-11-14 03:19:36,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:19:36,954 INFO L225 Difference]: With dead ends: 82 [2024-11-14 03:19:36,954 INFO L226 Difference]: Without dead ends: 82 [2024-11-14 03:19:36,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 942 ImplicationChecksByTransitivity, 40.6s TimeCoverageRelationStatistics Valid=257, Invalid=3772, Unknown=7, NotChecked=124, Total=4160 [2024-11-14 03:19:36,956 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 77 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:19:36,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 666 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1200 Invalid, 0 Unknown, 87 Unchecked, 2.7s Time] [2024-11-14 03:19:36,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-14 03:19:36,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-14 03:19:36,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 77 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:19:36,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2024-11-14 03:19:36,960 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 37 [2024-11-14 03:19:36,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:19:36,960 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2024-11-14 03:19:36,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 22 states have (on average 2.590909090909091) internal successors, (57), 25 states have internal predecessors, (57), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-14 03:19:36,960 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2024-11-14 03:19:36,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 03:19:36,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:19:36,961 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 03:19:36,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 03:19:37,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-14 03:19:37,162 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-14 03:19:37,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:19:37,162 INFO L85 PathProgramCache]: Analyzing trace with hash 181238112, now seen corresponding path program 1 times [2024-11-14 03:19:37,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:19:37,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269053324] [2024-11-14 03:19:37,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:19:37,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:19:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:19:38,622 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:19:38,623 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:19:38,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269053324] [2024-11-14 03:19:38,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269053324] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:19:38,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862505734] [2024-11-14 03:19:38,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:19:38,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:19:38,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:19:38,628 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:19:38,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 03:19:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:19:38,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-14 03:19:38,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:19:39,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:19:39,560 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 9 treesize of output 5 [2024-11-14 03:19:39,928 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_89| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_89|) 0) (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_89| (select |c_#valid| |v_node_create_~temp~0#1.base_89|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_89| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_89|))) (<= (+ |v_node_create_~temp~0#1.base_89| 1) |c_#StackHeapBarrier|))) is different from true [2024-11-14 03:19:40,022 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-14 03:19:40,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 23 treesize of output 24 [2024-11-14 03:19:40,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:19:40,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-14 03:19:40,209 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 17 treesize of output 9 [2024-11-14 03:19:40,216 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2024-11-14 03:19:40,216 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:19:40,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862505734] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:19:40,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [640118283] [2024-11-14 03:19:40,531 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-14 03:19:40,531 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:19:40,531 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:19:40,531 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:19:40,531 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:19:41,676 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 03:19:41,706 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:20:17,361 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5421#(and (= |ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) (<= 1 |#StackHeapBarrier|) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) 1)) (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (or (and (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_254| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_254| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_254| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_$Pointer$.offset_249| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_249| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_249| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (exists ((|v_#length_181| (Array Int Int))) (= (store |v_#length_181| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 12) |#length|)) (exists ((|v_#valid_212| (Array Int Int))) (and (= (select |v_#valid_212| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (store |v_#valid_212| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_#memory_int_224| (Array Int (Array Int Int))) (|v_#memory_int_225| (Array Int (Array Int Int))) (|v_#memory_int_226| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_226| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_226| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8 1))) (= |v_#memory_int_225| (store |v_#memory_int_224| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_224| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_225| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (= (store |v_#memory_int_225| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_225| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_226| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4))) |v_#memory_int_226|))) (<= (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#length_BEFORE_CALL_127| (Array Int Int)) (|v_#memory_$Pointer$.base_260| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_115| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_71| (Array Int (Array Int Int))) (|v_#memory_int_231| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_255| (Array Int (Array Int Int))) (|v_#memory_int_230| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_71| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (= 1 (select |v_old(#valid)_AFTER_CALL_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (store |v_#memory_int_230| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_230| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_231| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_231|) (= (store (store |v_#memory_$Pointer$.base_260| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_260| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_260| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_260| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_71|) (= 0 (select (select (store (store |v_#memory_$Pointer$.offset_255| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_255| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_255| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_255| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (<= 4 (select |v_#length_BEFORE_CALL_127| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (<= 8 (select |v_#length_BEFORE_CALL_127| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |v_#memory_int_BEFORE_CALL_115| (store |v_#memory_int_231| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_231| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_#memory_int_BEFORE_CALL_115| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_71| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))))))) (and (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_254| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_254| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_254| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_$Pointer$.offset_249| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_249| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_249| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (exists ((|v_#length_181| (Array Int Int))) (= (store |v_#length_181| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 12) |#length|)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_72| (Array Int Int)) (|v_#memory_$Pointer$.base_260| (Array Int (Array Int Int))) (|v_#memory_int_231| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_72| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_72| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_255| (Array Int (Array Int Int))) (|v_#memory_int_230| (Array Int (Array Int Int)))) (and (= (store (store |v_#memory_$Pointer$.base_260| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_260| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_260| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_260| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_72|) (<= 4 (select |v_old(#length)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= (select |v_old(#valid)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (<= 8 (select |v_old(#length)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |v_old(#memory_int)_AFTER_CALL_72| (store |v_#memory_int_231| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_231| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select |v_old(#valid)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (= (store |v_#memory_int_230| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_230| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_231| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_231|) (= (select (select (store (store |v_#memory_$Pointer$.offset_255| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_255| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_255| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_255| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (exists ((|v_#valid_212| (Array Int Int))) (and (= (select |v_#valid_212| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (store |v_#valid_212| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_#memory_int_224| (Array Int (Array Int Int))) (|v_#memory_int_225| (Array Int (Array Int Int))) (|v_#memory_int_226| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_226| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_226| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8 1))) (= |v_#memory_int_225| (store |v_#memory_int_224| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_224| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_225| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0)))) (= (store |v_#memory_int_225| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_225| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_226| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4))) |v_#memory_int_226|))) (<= (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 0)))) (= (select |#valid| |ULTIMATE.start_dll_circular_append_~head#1.base|) 1) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)))) (= |ULTIMATE.start_dll_circular_append_~data#1| 1) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_append_~head#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| 0))' at error location [2024-11-14 03:20:17,361 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:20:17,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:20:17,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2024-11-14 03:20:17,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667039683] [2024-11-14 03:20:17,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:20:17,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 03:20:17,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:20:17,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 03:20:17,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2005, Unknown=7, NotChecked=90, Total=2256 [2024-11-14 03:20:17,364 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 24 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 21 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-14 03:20:20,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:20:20,188 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2024-11-14 03:20:20,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 03:20:20,189 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 21 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2024-11-14 03:20:20,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:20:20,190 INFO L225 Difference]: With dead ends: 81 [2024-11-14 03:20:20,190 INFO L226 Difference]: Without dead ends: 81 [2024-11-14 03:20:20,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 37.9s TimeCoverageRelationStatistics Valid=193, Invalid=2456, Unknown=7, NotChecked=100, Total=2756 [2024-11-14 03:20:20,192 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 71 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:20:20,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 423 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 750 Invalid, 0 Unknown, 86 Unchecked, 2.1s Time] [2024-11-14 03:20:20,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-14 03:20:20,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-14 03:20:20,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.5) internal successors, (81), 76 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:20:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2024-11-14 03:20:20,204 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 37 [2024-11-14 03:20:20,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:20:20,204 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2024-11-14 03:20:20,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 21 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-14 03:20:20,205 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2024-11-14 03:20:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-14 03:20:20,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:20,206 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 03:20:20,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-14 03:20:20,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:20:20,407 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-14 03:20:20,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:20,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1323418955, now seen corresponding path program 1 times [2024-11-14 03:20:20,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:20:20,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498111341] [2024-11-14 03:20:20,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:20,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:20:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:23,497 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:20:23,497 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:20:23,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498111341] [2024-11-14 03:20:23,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498111341] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:20:23,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372573099] [2024-11-14 03:20:23,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:23,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:20:23,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:20:23,500 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:20:23,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 03:20:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:24,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-14 03:20:24,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:24,965 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 27 treesize of output 1 [2024-11-14 03:20:25,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:20:25,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 14 [2024-11-14 03:20:25,115 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 7 treesize of output 3 [2024-11-14 03:20:25,365 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_100| Int)) (and (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_100| 1)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_100| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_100|))) (= (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_100| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_100|)) |c_#memory_$Pointer$.base|) (<= (+ |v_node_create_~temp~0#1.base_100| 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_100|) 0))) is different from true [2024-11-14 03:20:25,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:20:25,403 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 03:20:25,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 30 [2024-11-14 03:20:25,482 INFO L349 Elim1Store]: treesize reduction 92, result has 31.9 percent of original size [2024-11-14 03:20:25,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 57 [2024-11-14 03:20:25,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:20:25,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:20:25,774 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 7 treesize of output 3 [2024-11-14 03:20:25,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:20:25,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 25 [2024-11-14 03:20:26,109 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2024-11-14 03:20:26,109 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:20:26,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372573099] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:20:26,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2114824916] [2024-11-14 03:20:26,786 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-14 03:20:26,786 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:20:26,786 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:20:26,786 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:20:26,786 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:20:28,049 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 03:20:28,078 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:21:13,294 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5782#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 4)) (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_dll_circular_append_~head#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) 1) (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_circular_append_~head#1.base|) 1) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0))) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)))) (= |ULTIMATE.start_dll_circular_append_~data#1| 1) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_append_~head#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 4)) |ULTIMATE.start_dll_circular_append_~last~1#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (or (and (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_272| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_272| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_272| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (exists ((|v_#memory_int_242| (Array Int (Array Int Int))) (|v_#memory_int_243| (Array Int (Array Int Int))) (|v_#memory_int_244| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_244| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_244| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8 1)) |#memory_int|) (= (store |v_#memory_int_243| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_243| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_244| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4))) |v_#memory_int_244|) (= (store |v_#memory_int_242| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_242| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_243| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_243|))) (exists ((|v_#valid_222| (Array Int Int))) (and (= (store |v_#valid_222| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_222| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (<= (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_284| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_82| (Array Int (Array Int Int))) (|v_#memory_int_248| (Array Int (Array Int Int))) (|v_#memory_int_249| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_82| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_278| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_82| (Array Int Int)) (|v_old(#length)_AFTER_CALL_82| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_82| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= |v_old(#memory_int)_AFTER_CALL_82| (store |v_#memory_int_249| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_249| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_82| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 4 (select |v_old(#length)_AFTER_CALL_82| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| (store (store |v_#memory_$Pointer$.base_284| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_284| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_284| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_284| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 8 (select |v_old(#length)_AFTER_CALL_82| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select (select (store (store |v_#memory_$Pointer$.offset_278| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_278| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_278| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_278| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_#memory_int_249| (store |v_#memory_int_248| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_248| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_249| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0)))) (= (select |v_old(#valid)_AFTER_CALL_82| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1))) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_278| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_278| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_278| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))) |#memory_$Pointer$.base|)) (exists ((|v_#length_188| (Array Int Int))) (= (store |v_#length_188| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 12) |#length|))) (and (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_272| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_272| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_272| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (exists ((|v_#memory_int_242| (Array Int (Array Int Int))) (|v_#memory_int_243| (Array Int (Array Int Int))) (|v_#memory_int_244| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_244| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_244| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8 1)) |#memory_int|) (= (store |v_#memory_int_243| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_243| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_244| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4))) |v_#memory_int_244|) (= (store |v_#memory_int_242| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_242| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_243| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_243|))) (exists ((|v_#valid_222| (Array Int Int))) (and (= (store |v_#valid_222| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_222| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (<= (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_278| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_278| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_278| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))) |#memory_$Pointer$.base|)) (exists ((|v_#length_188| (Array Int Int))) (= (store |v_#length_188| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 12) |#length|)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_83| (Array Int Int)) (|v_#memory_$Pointer$.base_284| (Array Int (Array Int Int))) (|v_#memory_int_248| (Array Int (Array Int Int))) (|v_#memory_int_249| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_83| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_83| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_278| (Array Int (Array Int Int)))) (and (= (select |v_old(#valid)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= |v_#memory_int_249| (store |v_#memory_int_248| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_248| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_249| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0)))) (= |v_old(#memory_int)_AFTER_CALL_83| (store |v_#memory_int_249| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_249| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 4 (select |v_old(#length)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= (select (select (store (store |v_#memory_$Pointer$.offset_278| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_278| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_278| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_278| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store (store |v_#memory_$Pointer$.base_284| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_284| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_284| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_284| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_83|) (<= 8 (select |v_old(#length)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select |v_old(#valid)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_83| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1))))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 4))) 1)) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| 0))' at error location [2024-11-14 03:21:13,294 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:21:13,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:21:13,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 30 [2024-11-14 03:21:13,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143082990] [2024-11-14 03:21:13,295 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:21:13,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-14 03:21:13,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:21:13,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-14 03:21:13,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2992, Unknown=11, NotChecked=110, Total=3306 [2024-11-14 03:21:13,297 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 31 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 28 states have internal predecessors, (56), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-14 03:21:17,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:17,699 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2024-11-14 03:21:17,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 03:21:17,700 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 28 states have internal predecessors, (56), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2024-11-14 03:21:17,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:17,701 INFO L225 Difference]: With dead ends: 80 [2024-11-14 03:21:17,701 INFO L226 Difference]: Without dead ends: 80 [2024-11-14 03:21:17,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1269 ImplicationChecksByTransitivity, 50.6s TimeCoverageRelationStatistics Valid=305, Invalid=4518, Unknown=11, NotChecked=136, Total=4970 [2024-11-14 03:21:17,704 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 75 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:21:17,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 522 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 776 Invalid, 0 Unknown, 85 Unchecked, 2.0s Time] [2024-11-14 03:21:17,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-14 03:21:17,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-14 03:21:17,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:21:17,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2024-11-14 03:21:17,712 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 38 [2024-11-14 03:21:17,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:17,713 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2024-11-14 03:21:17,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 28 states have internal predecessors, (56), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-14 03:21:17,713 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2024-11-14 03:21:17,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-14 03:21:17,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:17,718 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 03:21:17,745 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-14 03:21:17,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:21:17,919 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-14 03:21:17,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:17,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1323418956, now seen corresponding path program 1 times [2024-11-14 03:21:17,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:21:17,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929656448] [2024-11-14 03:21:17,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:17,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:21:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:21,742 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:21:21,742 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:21:21,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929656448] [2024-11-14 03:21:21,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929656448] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:21:21,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314870065] [2024-11-14 03:21:21,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:21,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:21:21,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:21:21,745 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:21:21,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 03:21:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:22,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-14 03:21:22,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:24,079 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 27 treesize of output 1 [2024-11-14 03:21:24,105 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 27 treesize of output 1 [2024-11-14 03:21:24,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:21:24,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 32 [2024-11-14 03:21:24,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:21:24,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2024-11-14 03:21:24,772 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_111| Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_111| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_111|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_111|) 0) (<= (+ |v_node_create_~temp~0#1.base_111| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_111| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_111|)) |c_#memory_$Pointer$.offset|) (= |c_#length| (store |c_old(#length)| |v_node_create_~temp~0#1.base_111| (select |c_#length| |v_node_create_~temp~0#1.base_111|))))) is different from true [2024-11-14 03:21:24,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:24,839 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-14 03:21:24,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 54 [2024-11-14 03:21:24,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:24,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:24,862 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 03:21:24,862 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 1 case distinctions, treesize of input 50 treesize of output 42 [2024-11-14 03:21:24,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:24,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2024-11-14 03:21:24,934 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2024-11-14 03:21:24,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2024-11-14 03:21:25,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:21:25,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 32 [2024-11-14 03:21:25,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:21:25,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2024-11-14 03:21:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-14 03:21:25,531 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:21:26,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314870065] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:21:26,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1440814161] [2024-11-14 03:21:26,649 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-14 03:21:26,650 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:21:26,650 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:21:26,650 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:21:26,650 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:21:27,772 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 03:21:27,799 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:22:15,307 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6172#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 4)) (or (< (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 4)) 0) (< (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 4))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 4)) 4))) (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_dll_circular_append_~head#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) 1) (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_circular_append_~head#1.base|) 1) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0))) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)))) (= |ULTIMATE.start_dll_circular_append_~data#1| 1) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_append_~head#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (or (and (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_231| (Array Int Int))) (and (= (store |v_#valid_231| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_231| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (exists ((|v_#memory_int_260| (Array Int (Array Int Int))) (|v_#memory_int_261| (Array Int (Array Int Int))) (|v_#memory_int_262| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_262| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_262| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8 1))) (= (store |v_#memory_int_260| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_260| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_261| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_261|) (= (store |v_#memory_int_261| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_261| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_262| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4))) |v_#memory_int_262|))) (exists ((|v_#memory_$Pointer$.offset_296| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_296| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_296| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_94| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_94| (Array Int Int)) (|v_#memory_$Pointer$.offset_302| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_308| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_94| (Array Int Int)) (|v_#memory_int_BEFORE_CALL_154| (Array Int (Array Int Int))) (|v_#memory_int_266| (Array Int (Array Int Int))) (|v_#memory_int_267| (Array Int (Array Int Int)))) (and (= |v_#memory_int_267| (store |v_#memory_int_266| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_266| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_267| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0)))) (<= 4 (select |v_old(#length)_AFTER_CALL_94| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= (select |v_old(#valid)_AFTER_CALL_94| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| (store (store |v_#memory_$Pointer$.base_308| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_308| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_308| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_308| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= 1 (select |v_old(#valid)_AFTER_CALL_94| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (<= 8 (select |v_old(#length)_AFTER_CALL_94| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select (select (store (store |v_#memory_$Pointer$.offset_302| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_302| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_302| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_302| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_#memory_int_BEFORE_CALL_154| (store |v_#memory_int_267| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_267| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_#memory_int_BEFORE_CALL_154| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_94| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))))) (<= (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_302| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_302| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_302| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#length_198| (Array Int Int))) (= (store |v_#length_198| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 12) |#length|))) (and (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_231| (Array Int Int))) (and (= (store |v_#valid_231| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_231| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) (exists ((|v_#memory_int_260| (Array Int (Array Int Int))) (|v_#memory_int_261| (Array Int (Array Int Int))) (|v_#memory_int_262| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_262| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_262| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8 1))) (= (store |v_#memory_int_260| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_260| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_261| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_261|) (= (store |v_#memory_int_261| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_261| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_262| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 4))) |v_#memory_int_262|))) (exists ((|v_#memory_$Pointer$.offset_296| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_296| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_296| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (<= (+ |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_302| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_302| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_302| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8))))) (not (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#length_198| (Array Int Int))) (= (store |v_#length_198| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| 12) |#length|)) (exists ((|v_#memory_$Pointer$.offset_302| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_93| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_308| (Array Int (Array Int Int))) (|v_#memory_int_266| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_93| (Array Int (Array Int Int))) (|v_#memory_int_267| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_93| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_93| (Array Int Int))) (and (<= 4 (select |v_old(#length)_AFTER_CALL_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) (= (select |v_old(#valid)_AFTER_CALL_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 1) (= (select (select (store (store |v_#memory_$Pointer$.offset_302| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_302| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_302| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.offset_302| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 0)) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 8 (select |v_old(#length)_AFTER_CALL_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (store |v_#memory_int_266| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_int_266| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_#memory_int_267| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0))) |v_#memory_int_267|) (= (select |v_old(#valid)_AFTER_CALL_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| (store (store |v_#memory_$Pointer$.base_308| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_308| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_308| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) (store (select |v_#memory_$Pointer$.base_308| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= |v_old(#memory_int)_AFTER_CALL_93| (store |v_#memory_int_267| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_267| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_93| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))))))) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| 0))' at error location [2024-11-14 03:22:15,308 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:22:15,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:22:15,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 43 [2024-11-14 03:22:15,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055357283] [2024-11-14 03:22:15,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:22:15,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-14 03:22:15,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:22:15,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-14 03:22:15,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=4731, Unknown=10, NotChecked=138, Total=5112 [2024-11-14 03:22:15,312 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 44 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 37 states have internal predecessors, (64), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 03:22:23,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:22:23,038 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2024-11-14 03:22:23,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-14 03:22:23,039 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 37 states have internal predecessors, (64), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2024-11-14 03:22:23,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:22:23,040 INFO L225 Difference]: With dead ends: 96 [2024-11-14 03:22:23,040 INFO L226 Difference]: Without dead ends: 96 [2024-11-14 03:22:23,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1951 ImplicationChecksByTransitivity, 55.5s TimeCoverageRelationStatistics Valid=379, Invalid=6925, Unknown=10, NotChecked=168, Total=7482 [2024-11-14 03:22:23,043 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 119 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1702 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 1813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:22:23,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 694 Invalid, 1813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1702 Invalid, 0 Unknown, 102 Unchecked, 4.6s Time] [2024-11-14 03:22:23,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-14 03:22:23,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 79. [2024-11-14 03:22:23,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.462962962962963) internal successors, (79), 74 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:22:23,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2024-11-14 03:22:23,049 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 38 [2024-11-14 03:22:23,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:22:23,049 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2024-11-14 03:22:23,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 37 states have internal predecessors, (64), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 03:22:23,050 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2024-11-14 03:22:23,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-14 03:22:23,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:22:23,050 INFO L215 NwaCegarLoop]: trace histogram [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 03:22:23,079 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-14 03:22:23,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:22:23,255 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-14 03:22:23,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:22:23,256 INFO L85 PathProgramCache]: Analyzing trace with hash 165321317, now seen corresponding path program 1 times [2024-11-14 03:22:23,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:22:23,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572045973] [2024-11-14 03:22:23,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:22:23,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:22:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:22:23,648 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-14 03:22:23,649 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:22:23,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572045973] [2024-11-14 03:22:23,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572045973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:22:23,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:22:23,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:22:23,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173279309] [2024-11-14 03:22:23,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:22:23,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:22:23,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:22:23,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:22:23,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:22:23,652 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:22:24,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:22:24,008 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2024-11-14 03:22:24,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:22:24,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2024-11-14 03:22:24,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:22:24,010 INFO L225 Difference]: With dead ends: 76 [2024-11-14 03:22:24,010 INFO L226 Difference]: Without dead ends: 76 [2024-11-14 03:22:24,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:22:24,013 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 92 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:22:24,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 138 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:22:24,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-14 03:22:24,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-14 03:22:24,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 71 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:22:24,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2024-11-14 03:22:24,017 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 40 [2024-11-14 03:22:24,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:22:24,018 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2024-11-14 03:22:24,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:22:24,018 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2024-11-14 03:22:24,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-14 03:22:24,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:22:24,018 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:22:24,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-14 03:22:24,019 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-14 03:22:24,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:22:24,019 INFO L85 PathProgramCache]: Analyzing trace with hash 829997347, now seen corresponding path program 1 times [2024-11-14 03:22:24,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:22:24,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040948713] [2024-11-14 03:22:24,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:22:24,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:22:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:22:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 03:22:24,464 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:22:24,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040948713] [2024-11-14 03:22:24,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040948713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:22:24,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:22:24,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 03:22:24,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047461694] [2024-11-14 03:22:24,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:22:24,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 03:22:24,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:22:24,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 03:22:24,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:22:24,466 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 9 states, 6 states have (on average 4.666666666666667) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:22:25,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:22:25,291 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2024-11-14 03:22:25,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 03:22:25,291 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 4.666666666666667) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2024-11-14 03:22:25,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:22:25,292 INFO L225 Difference]: With dead ends: 100 [2024-11-14 03:22:25,292 INFO L226 Difference]: Without dead ends: 100 [2024-11-14 03:22:25,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:22:25,293 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 40 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:22:25,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 258 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 03:22:25,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-14 03:22:25,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 78. [2024-11-14 03:22:25,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 73 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:22:25,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2024-11-14 03:22:25,301 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 41 [2024-11-14 03:22:25,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:22:25,302 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2024-11-14 03:22:25,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 4.666666666666667) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:22:25,302 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2024-11-14 03:22:25,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-14 03:22:25,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:22:25,304 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:22:25,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-14 03:22:25,304 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-14 03:22:25,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:22:25,306 INFO L85 PathProgramCache]: Analyzing trace with hash 829997348, now seen corresponding path program 1 times [2024-11-14 03:22:25,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:22:25,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71163939] [2024-11-14 03:22:25,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:22:25,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:22:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:22:26,076 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 03:22:26,077 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:22:26,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71163939] [2024-11-14 03:22:26,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71163939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:22:26,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:22:26,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 03:22:26,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101608999] [2024-11-14 03:22:26,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:22:26,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 03:22:26,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:22:26,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 03:22:26,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:22:26,079 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 9 states, 6 states have (on average 5.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:22:27,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:22:27,097 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2024-11-14 03:22:27,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:22:27,098 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 5.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2024-11-14 03:22:27,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:22:27,099 INFO L225 Difference]: With dead ends: 98 [2024-11-14 03:22:27,100 INFO L226 Difference]: Without dead ends: 98 [2024-11-14 03:22:27,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:22:27,101 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 36 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:22:27,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 345 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-14 03:22:27,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-14 03:22:27,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 80. [2024-11-14 03:22:27,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 75 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:22:27,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2024-11-14 03:22:27,109 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 41 [2024-11-14 03:22:27,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:22:27,109 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2024-11-14 03:22:27,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 5.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:22:27,110 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2024-11-14 03:22:27,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-14 03:22:27,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:22:27,111 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:22:27,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-14 03:22:27,111 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-14 03:22:27,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:22:27,111 INFO L85 PathProgramCache]: Analyzing trace with hash -2102911898, now seen corresponding path program 1 times [2024-11-14 03:22:27,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:22:27,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405597922] [2024-11-14 03:22:27,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:22:27,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:22:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:22:29,543 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 03:22:29,544 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:22:29,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405597922] [2024-11-14 03:22:29,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405597922] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:22:29,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809921311] [2024-11-14 03:22:29,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:22:29,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:22:29,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:22:29,547 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:22:29,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-14 03:22:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:22:29,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-14 03:22:29,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:22:30,800 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-14 03:22:30,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 28 [2024-11-14 03:22:30,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:22:31,032 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-14 03:22:31,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 40 [2024-11-14 03:22:31,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 03:22:31,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:22:31,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:22:31,520 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 17 treesize of output 9 [2024-11-14 03:22:31,600 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 03:22:31,600 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:22:31,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809921311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:22:31,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:22:31,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [19] total 32 [2024-11-14 03:22:31,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050523640] [2024-11-14 03:22:31,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:22:31,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 03:22:31,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:22:31,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 03:22:31,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=953, Unknown=0, NotChecked=0, Total=1056 [2024-11-14 03:22:31,602 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 15 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:22:33,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:22:33,252 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2024-11-14 03:22:33,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 03:22:33,253 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2024-11-14 03:22:33,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:22:33,254 INFO L225 Difference]: With dead ends: 79 [2024-11-14 03:22:33,254 INFO L226 Difference]: Without dead ends: 79 [2024-11-14 03:22:33,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=177, Invalid=1545, Unknown=0, NotChecked=0, Total=1722 [2024-11-14 03:22:33,255 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 72 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:22:33,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 406 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-14 03:22:33,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-14 03:22:33,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-14 03:22:33,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 74 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:22:33,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2024-11-14 03:22:33,258 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 43 [2024-11-14 03:22:33,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:22:33,259 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2024-11-14 03:22:33,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:22:33,259 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2024-11-14 03:22:33,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-14 03:22:33,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:22:33,260 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:22:33,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-14 03:22:33,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-14 03:22:33,464 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-14 03:22:33,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:22:33,464 INFO L85 PathProgramCache]: Analyzing trace with hash -2102911897, now seen corresponding path program 1 times [2024-11-14 03:22:33,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:22:33,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625615420] [2024-11-14 03:22:33,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:22:33,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:22:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:22:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:22:36,806 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:22:36,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625615420] [2024-11-14 03:22:36,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625615420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:22:36,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:22:36,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-14 03:22:36,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022393786] [2024-11-14 03:22:36,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:22:36,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 03:22:36,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:22:36,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 03:22:36,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2024-11-14 03:22:36,809 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 20 states, 16 states have (on average 2.3125) internal successors, (37), 17 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:22:39,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:22:39,168 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2024-11-14 03:22:39,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 03:22:39,168 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 2.3125) internal successors, (37), 17 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2024-11-14 03:22:39,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:22:39,169 INFO L225 Difference]: With dead ends: 78 [2024-11-14 03:22:39,169 INFO L226 Difference]: Without dead ends: 78 [2024-11-14 03:22:39,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2024-11-14 03:22:39,170 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 67 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:22:39,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 497 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-14 03:22:39,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-14 03:22:39,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-14 03:22:39,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 73 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:22:39,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2024-11-14 03:22:39,174 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 43 [2024-11-14 03:22:39,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:22:39,175 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2024-11-14 03:22:39,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 2.3125) internal successors, (37), 17 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:22:39,175 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2024-11-14 03:22:39,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-14 03:22:39,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:22:39,176 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:22:39,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-14 03:22:39,176 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-11-14 03:22:39,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:22:39,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1463769541, now seen corresponding path program 1 times [2024-11-14 03:22:39,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:22:39,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018548231] [2024-11-14 03:22:39,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:22:39,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:22:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:22:40,100 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:22:40,100 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:22:40,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018548231] [2024-11-14 03:22:40,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018548231] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:22:40,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102652841] [2024-11-14 03:22:40,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:22:40,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:22:40,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:22:40,103 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:22:40,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0c6f88e-7183-40f0-89ac-2da907d780a8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-14 03:22:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:22:40,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 03:22:40,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:22:40,624 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 8 treesize of output 4 [2024-11-14 03:22:40,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:22:40,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-14 03:22:40,958 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:22:40,958 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:22:41,065 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2984 (Array Int Int)) (|v_node_create_~temp~0#1.base_128| Int)) (or (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_128| 1)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_128| v_ArrVal_2984) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0)))) is different from false [2024-11-14 03:22:41,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102652841] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:22:41,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [943623750] [2024-11-14 03:22:41,069 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2024-11-14 03:22:41,069 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:22:41,070 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:22:41,070 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:22:41,070 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:22:44,043 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2024-11-14 03:22:44,069 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:23:36,887 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification. DAG size of input: 225 DAG size of output: 219 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:24:15,033 WARN L286 SmtUtils]: Spent 27.12s on a formula simplification. DAG size of input: 235 DAG size of output: 229 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:24:49,066 WARN L286 SmtUtils]: Spent 19.98s on a formula simplification. DAG size of input: 233 DAG size of output: 227 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:25:25,488 WARN L286 SmtUtils]: Spent 23.64s on a formula simplification. DAG size of input: 247 DAG size of output: 237 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:26:05,695 WARN L286 SmtUtils]: Spent 25.08s on a formula simplification. DAG size of input: 258 DAG size of output: 242 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:26:05,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [943623750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:26:05,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:26:05,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [15, 16] total 47 [2024-11-14 03:26:05,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448271329] [2024-11-14 03:26:05,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:26:05,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-14 03:26:05,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:26:05,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-14 03:26:05,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2004, Unknown=23, NotChecked=90, Total=2256 [2024-11-14 03:26:05,699 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 29 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:26:14,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:26:16,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:26:18,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:26:21,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:26:23,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:26:26,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:26:28,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:26:30,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:26:33,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:26:36,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:26:38,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:26:40,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:26:44,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:26:46,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:26:49,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:26:51,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:26:53,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:27:02,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]