./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ --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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 04:12:10,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 04:12:11,032 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-19 04:12:11,037 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 04:12:11,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 04:12:11,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 04:12:11,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 04:12:11,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 04:12:11,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 04:12:11,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 04:12:11,067 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 04:12:11,067 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 04:12:11,068 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 04:12:11,068 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 04:12:11,069 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 04:12:11,069 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 04:12:11,070 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 04:12:11,070 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 04:12:11,071 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 04:12:11,071 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 04:12:11,072 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 04:12:11,075 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 04:12:11,075 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 04:12:11,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 04:12:11,076 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 04:12:11,077 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 04:12:11,077 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 04:12:11,077 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 04:12:11,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 04:12:11,078 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 04:12:11,078 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 04:12:11,079 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 04:12:11,079 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 04:12:11,079 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 04:12:11,080 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 04:12:11,080 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 04:12:11,080 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 04:12:11,081 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 04:12:11,081 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 04:12:11,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:12:11,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 04:12:11,083 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 04:12:11,084 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 04:12:11,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 04:12:11,084 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 04:12:11,084 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 04:12:11,085 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ 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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2023-11-19 04:12:11,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 04:12:11,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 04:12:11,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 04:12:11,393 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 04:12:11,395 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 04:12:11,396 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2023-11-19 04:12:14,517 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 04:12:14,897 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 04:12:14,898 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2023-11-19 04:12:14,918 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/data/8f647a091/4ea3dcb659064038909d5ce6ac27bd45/FLAGf45e93bb3 [2023-11-19 04:12:14,934 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/data/8f647a091/4ea3dcb659064038909d5ce6ac27bd45 [2023-11-19 04:12:14,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 04:12:14,944 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 04:12:14,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 04:12:14,948 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 04:12:14,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 04:12:14,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:12:14" (1/1) ... [2023-11-19 04:12:14,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f7493d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:14, skipping insertion in model container [2023-11-19 04:12:14,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:12:14" (1/1) ... [2023-11-19 04:12:15,013 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 04:12:15,349 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:12:15,359 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 04:12:15,440 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:12:15,477 INFO L206 MainTranslator]: Completed translation [2023-11-19 04:12:15,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:15 WrapperNode [2023-11-19 04:12:15,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 04:12:15,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 04:12:15,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 04:12:15,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 04:12:15,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:15" (1/1) ... [2023-11-19 04:12:15,522 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:15" (1/1) ... [2023-11-19 04:12:15,559 INFO L138 Inliner]: procedures = 127, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 127 [2023-11-19 04:12:15,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 04:12:15,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 04:12:15,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 04:12:15,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 04:12:15,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:15" (1/1) ... [2023-11-19 04:12:15,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:15" (1/1) ... [2023-11-19 04:12:15,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:15" (1/1) ... [2023-11-19 04:12:15,592 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:15" (1/1) ... [2023-11-19 04:12:15,600 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:15" (1/1) ... [2023-11-19 04:12:15,610 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:15" (1/1) ... [2023-11-19 04:12:15,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:15" (1/1) ... [2023-11-19 04:12:15,619 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:15" (1/1) ... [2023-11-19 04:12:15,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 04:12:15,630 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 04:12:15,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 04:12:15,630 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 04:12:15,635 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:15" (1/1) ... [2023-11-19 04:12:15,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:12:15,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:12:15,666 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 04:12:15,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 04:12:15,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 04:12:15,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 04:12:15,698 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-19 04:12:15,698 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-19 04:12:15,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 04:12:15,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 04:12:15,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 04:12:15,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 04:12:15,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 04:12:15,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 04:12:15,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 04:12:15,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 04:12:15,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 04:12:15,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 04:12:15,822 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 04:12:15,824 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 04:12:16,246 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 04:12:16,296 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 04:12:16,302 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-19 04:12:16,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:12:16 BoogieIcfgContainer [2023-11-19 04:12:16,308 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 04:12:16,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 04:12:16,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 04:12:16,315 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 04:12:16,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:12:14" (1/3) ... [2023-11-19 04:12:16,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40fd9dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:12:16, skipping insertion in model container [2023-11-19 04:12:16,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:15" (2/3) ... [2023-11-19 04:12:16,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40fd9dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:12:16, skipping insertion in model container [2023-11-19 04:12:16,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:12:16" (3/3) ... [2023-11-19 04:12:16,321 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2023-11-19 04:12:16,341 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 04:12:16,341 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2023-11-19 04:12:16,393 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:12:16,401 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@200f502f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:12:16,401 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2023-11-19 04:12:16,405 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 69 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:12:16,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-19 04:12:16,412 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:16,413 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 04:12:16,414 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-19 04:12:16,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:16,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1573405085, now seen corresponding path program 1 times [2023-11-19 04:12:16,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:16,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573492535] [2023-11-19 04:12:16,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:16,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:16,811 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:16,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573492535] [2023-11-19 04:12:16,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573492535] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:16,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:16,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:12:16,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943299684] [2023-11-19 04:12:16,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:16,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:12:16,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:16,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:12:16,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:12:16,870 INFO L87 Difference]: Start difference. First operand has 73 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 69 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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) [2023-11-19 04:12:16,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:16,950 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2023-11-19 04:12:16,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:12:16,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 6 [2023-11-19 04:12:16,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:16,960 INFO L225 Difference]: With dead ends: 78 [2023-11-19 04:12:16,960 INFO L226 Difference]: Without dead ends: 76 [2023-11-19 04:12:16,963 INFO L412 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 [2023-11-19 04:12:16,967 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:16,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 128 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:12:16,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-19 04:12:17,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2023-11-19 04:12:17,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 35 states have (on average 2.085714285714286) internal successors, (73), 67 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:12:17,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2023-11-19 04:12:17,008 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 6 [2023-11-19 04:12:17,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:17,009 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2023-11-19 04:12:17,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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) [2023-11-19 04:12:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2023-11-19 04:12:17,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-19 04:12:17,010 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:17,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 04:12:17,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 04:12:17,010 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-19 04:12:17,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:17,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1416346933, now seen corresponding path program 1 times [2023-11-19 04:12:17,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:17,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083972188] [2023-11-19 04:12:17,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:17,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:17,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:17,076 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:17,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083972188] [2023-11-19 04:12:17,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083972188] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:17,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:17,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:12:17,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971152014] [2023-11-19 04:12:17,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:17,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:12:17,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:17,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:12:17,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:12:17,080 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-11-19 04:12:17,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:17,151 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2023-11-19 04:12:17,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:12:17,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2023-11-19 04:12:17,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:17,153 INFO L225 Difference]: With dead ends: 69 [2023-11-19 04:12:17,154 INFO L226 Difference]: Without dead ends: 69 [2023-11-19 04:12:17,154 INFO L412 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 [2023-11-19 04:12:17,156 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:17,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 92 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:17,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-19 04:12:17,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-11-19 04:12:17,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 65 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:12:17,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2023-11-19 04:12:17,165 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 6 [2023-11-19 04:12:17,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:17,165 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2023-11-19 04:12:17,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-11-19 04:12:17,166 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2023-11-19 04:12:17,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-19 04:12:17,166 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:17,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 04:12:17,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 04:12:17,167 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-19 04:12:17,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:17,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1416346934, now seen corresponding path program 1 times [2023-11-19 04:12:17,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:17,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131174432] [2023-11-19 04:12:17,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:17,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:17,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:17,266 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:17,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131174432] [2023-11-19 04:12:17,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131174432] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:17,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:17,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:12:17,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749774385] [2023-11-19 04:12:17,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:17,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:12:17,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:17,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:12:17,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:12:17,269 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-11-19 04:12:17,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:17,331 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2023-11-19 04:12:17,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:12:17,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2023-11-19 04:12:17,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:17,333 INFO L225 Difference]: With dead ends: 67 [2023-11-19 04:12:17,333 INFO L226 Difference]: Without dead ends: 67 [2023-11-19 04:12:17,334 INFO L412 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 [2023-11-19 04:12:17,335 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:17,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 95 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-19 04:12:17,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-11-19 04:12:17,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 63 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:12:17,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2023-11-19 04:12:17,344 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 6 [2023-11-19 04:12:17,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:17,344 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2023-11-19 04:12:17,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-11-19 04:12:17,345 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2023-11-19 04:12:17,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 04:12:17,345 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:17,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:17,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 04:12:17,346 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-19 04:12:17,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:17,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1854972271, now seen corresponding path program 1 times [2023-11-19 04:12:17,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:17,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664855721] [2023-11-19 04:12:17,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:17,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:17,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:17,460 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:17,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664855721] [2023-11-19 04:12:17,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664855721] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:17,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:17,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:12:17,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248032884] [2023-11-19 04:12:17,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:17,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:12:17,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:17,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:12:17,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:12:17,463 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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) [2023-11-19 04:12:17,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:17,597 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2023-11-19 04:12:17,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:12:17,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2023-11-19 04:12:17,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:17,600 INFO L225 Difference]: With dead ends: 67 [2023-11-19 04:12:17,601 INFO L226 Difference]: Without dead ends: 67 [2023-11-19 04:12:17,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:12:17,602 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 5 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:17,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 192 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:17,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-19 04:12:17,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2023-11-19 04:12:17,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 62 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:12:17,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2023-11-19 04:12:17,610 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 10 [2023-11-19 04:12:17,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:17,611 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2023-11-19 04:12:17,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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) [2023-11-19 04:12:17,611 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2023-11-19 04:12:17,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 04:12:17,612 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:17,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:17,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 04:12:17,612 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-19 04:12:17,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:17,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1854972270, now seen corresponding path program 1 times [2023-11-19 04:12:17,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:17,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209367841] [2023-11-19 04:12:17,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:17,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:17,855 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:17,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209367841] [2023-11-19 04:12:17,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209367841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:17,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:17,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 04:12:17,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951030085] [2023-11-19 04:12:17,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:17,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:12:17,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:17,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:12:17,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:12:17,859 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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) [2023-11-19 04:12:17,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:17,986 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2023-11-19 04:12:17,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:12:17,987 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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 10 [2023-11-19 04:12:17,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:17,988 INFO L225 Difference]: With dead ends: 66 [2023-11-19 04:12:17,988 INFO L226 Difference]: Without dead ends: 66 [2023-11-19 04:12:17,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 04:12:17,990 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 5 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:17,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 223 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:17,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-19 04:12:17,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2023-11-19 04:12:17,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 61 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:12:17,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2023-11-19 04:12:17,997 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 10 [2023-11-19 04:12:18,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:18,002 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2023-11-19 04:12:18,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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) [2023-11-19 04:12:18,002 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2023-11-19 04:12:18,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 04:12:18,003 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:18,003 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:18,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 04:12:18,004 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-19 04:12:18,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:18,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1289069132, now seen corresponding path program 1 times [2023-11-19 04:12:18,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:18,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649047558] [2023-11-19 04:12:18,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:18,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:18,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 04:12:18,219 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:18,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649047558] [2023-11-19 04:12:18,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649047558] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:12:18,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508939575] [2023-11-19 04:12:18,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:18,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:12:18,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:12:18,226 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:12:18,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 04:12:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:18,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 04:12:18,380 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:12:18,429 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:18,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:12:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 04:12:18,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508939575] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:12:18,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1887658306] [2023-11-19 04:12:18,498 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-19 04:12:18,499 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:12:18,503 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:12:18,509 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:12:18,509 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:12:21,118 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 144 for LOIs [2023-11-19 04:12:21,952 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:12:30,677 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '899#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_append_~data#1| 1) (= 1 |ULTIMATE.start_sll_append_#in~data#1|) (<= 2 |ULTIMATE.start_sll_append_#in~head#1.base|) (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1)) (= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (or (and (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (= 1 (select |v_old(#valid)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#memory_int_54| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_10| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_10| (store |v_#memory_int_54| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_54| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_75| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (store |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#memory_$Pointer$.offset_75| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#length_BEFORE_CALL_17| (Array Int Int))) (<= 8 (select |v_#length_BEFORE_CALL_17| |ULTIMATE.start_sll_create_#res#1.base|))) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#length_73| (Array Int Int))) (= |#length| (store |v_#length_73| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8))) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_50| (Array Int (Array Int Int)))) (and (= |v_#memory_int_51| (store |v_#memory_int_50| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_50| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_51| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_51| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_51| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 1))))) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_88| (Array Int Int))) (and (= (store |v_#valid_88| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_88| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_sll_append_~head#1.base|) (exists ((|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_71| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_71| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_$Pointer$.offset_71| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_71| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_71| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))))) (and (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_75| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#length_73| (Array Int Int))) (= |#length| (store |v_#length_73| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8))) (exists ((|v_old(#length)_AFTER_CALL_9| (Array Int Int))) (<= 8 (select |v_old(#length)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_50| (Array Int (Array Int Int)))) (and (= |v_#memory_int_51| (store |v_#memory_int_50| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_50| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_51| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_51| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_51| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 1))))) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 1)) (exists ((|v_#valid_88| (Array Int Int))) (and (= (store |v_#valid_88| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_88| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_sll_append_~head#1.base|) (exists ((|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_71| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_71| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_int_54| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= (store |v_#memory_int_54| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_54| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 4))) |v_old(#memory_int)_AFTER_CALL_9|)) (exists ((|v_#memory_$Pointer$.base_75| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (store |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#memory_$Pointer$.offset_71| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_71| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_71| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))))))' at error location [2023-11-19 04:12:30,677 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:12:30,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:12:30,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2023-11-19 04:12:30,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027040597] [2023-11-19 04:12:30,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:12:30,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:12:30,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:30,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:12:30,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=206, Unknown=1, NotChecked=0, Total=240 [2023-11-19 04:12:30,680 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 04:12:30,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:30,741 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2023-11-19 04:12:30,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:12:30,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 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 19 [2023-11-19 04:12:30,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:30,744 INFO L225 Difference]: With dead ends: 69 [2023-11-19 04:12:30,744 INFO L226 Difference]: Without dead ends: 69 [2023-11-19 04:12:30,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=33, Invalid=206, Unknown=1, NotChecked=0, Total=240 [2023-11-19 04:12:30,746 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:30,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 111 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:30,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-19 04:12:30,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-11-19 04:12:30,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 64 states have internal predecessors, (70), 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) [2023-11-19 04:12:30,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2023-11-19 04:12:30,754 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 19 [2023-11-19 04:12:30,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:30,754 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2023-11-19 04:12:30,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 04:12:30,755 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2023-11-19 04:12:30,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-19 04:12:30,756 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:30,756 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:30,786 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 04:12:30,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:12:30,966 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-19 04:12:30,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:30,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1236561829, now seen corresponding path program 2 times [2023-11-19 04:12:30,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:30,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995201826] [2023-11-19 04:12:30,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:30,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:31,515 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-19 04:12:31,515 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:31,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995201826] [2023-11-19 04:12:31,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995201826] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:12:31,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690199245] [2023-11-19 04:12:31,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 04:12:31,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:12:31,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:12:31,522 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:12:31,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 04:12:31,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-19 04:12:31,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 04:12:31,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-19 04:12:31,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:12:31,764 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 [2023-11-19 04:12:31,813 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 [2023-11-19 04:12:31,877 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 04:12:31,878 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 14 treesize of output 13 [2023-11-19 04:12:31,982 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 [2023-11-19 04:12:32,005 WARN L876 $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 [2023-11-19 04:12:32,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:12:32,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 [2023-11-19 04:12:32,083 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 [2023-11-19 04:12:32,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:12:32,123 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 [2023-11-19 04:12:32,129 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 8 not checked. [2023-11-19 04:12:32,129 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:12:32,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690199245] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:12:32,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [664972267] [2023-11-19 04:12:32,212 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-19 04:12:32,213 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:12:32,213 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:12:32,213 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:12:32,213 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:12:33,963 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 123 for LOIs [2023-11-19 04:12:34,607 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:12:41,686 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1156#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_append_~data#1| 1) (= 1 |ULTIMATE.start_sll_append_#in~data#1|) (<= 2 |ULTIMATE.start_sll_append_#in~head#1.base|) (or (and (exists ((|v_#length_80| (Array Int Int))) (= (store |v_#length_80| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8) |#length|)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_21| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#valid_101| (Array Int Int))) (and (= (select |v_#valid_101| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_101| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|))) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_83| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_83| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_83| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_sll_append_~head#1.base|) (exists ((|v_#memory_int_62| (Array Int (Array Int Int))) (|v_#memory_int_63| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_63| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_63| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 1))) (= |v_#memory_int_63| (store |v_#memory_int_62| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_62| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_63| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4)))))) (exists ((|v_#memory_$Pointer$.offset_83| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_83| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_83| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_35| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_35| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (and (exists ((|v_#length_80| (Array Int Int))) (= (store |v_#length_80| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8) |#length|)) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_33| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_33| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#valid_101| (Array Int Int))) (and (= (select |v_#valid_101| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_101| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|))) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_83| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_83| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_83| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_sll_append_~head#1.base|) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)) (exists ((|v_#memory_int_62| (Array Int (Array Int Int))) (|v_#memory_int_63| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_63| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_63| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 1))) (= |v_#memory_int_63| (store |v_#memory_int_62| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_62| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_63| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4)))))) (exists ((|v_#memory_$Pointer$.offset_83| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_83| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_83| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))))) (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1)) (= |ULTIMATE.start_sll_append_#in~head#1.offset| 0))' at error location [2023-11-19 04:12:41,686 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:12:41,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 04:12:41,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2023-11-19 04:12:41,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849667760] [2023-11-19 04:12:41,687 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 04:12:41,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-19 04:12:41,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:41,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-19 04:12:41,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=664, Unknown=2, NotChecked=52, Total=812 [2023-11-19 04:12:41,689 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 16 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-19 04:12:42,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:42,118 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2023-11-19 04:12:42,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 04:12:42,119 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2023-11-19 04:12:42,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:42,120 INFO L225 Difference]: With dead ends: 74 [2023-11-19 04:12:42,120 INFO L226 Difference]: Without dead ends: 74 [2023-11-19 04:12:42,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=123, Invalid=809, Unknown=2, NotChecked=58, Total=992 [2023-11-19 04:12:42,123 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 93 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:42,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 162 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 265 Invalid, 0 Unknown, 72 Unchecked, 0.3s Time] [2023-11-19 04:12:42,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-19 04:12:42,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2023-11-19 04:12:42,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 59 states have internal predecessors, (65), 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) [2023-11-19 04:12:42,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2023-11-19 04:12:42,129 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 28 [2023-11-19 04:12:42,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:42,130 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2023-11-19 04:12:42,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-19 04:12:42,130 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2023-11-19 04:12:42,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-19 04:12:42,131 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:42,131 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:42,153 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-19 04:12:42,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:12:42,342 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-19 04:12:42,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:42,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1236561828, now seen corresponding path program 1 times [2023-11-19 04:12:42,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:42,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427720243] [2023-11-19 04:12:42,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:42,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:43,313 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 04:12:43,313 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:43,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427720243] [2023-11-19 04:12:43,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427720243] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:12:43,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715871871] [2023-11-19 04:12:43,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:43,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:12:43,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:12:43,330 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:12:43,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 04:12:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:43,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-19 04:12:43,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:12:43,490 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 [2023-11-19 04:12:43,533 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 [2023-11-19 04:12:43,542 WARN L876 $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 [2023-11-19 04:12:43,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:12:43,570 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 [2023-11-19 04:12:43,601 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 [2023-11-19 04:12:43,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:12:43,664 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 [2023-11-19 04:12:43,758 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 [2023-11-19 04:12:43,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:12:43,809 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 [2023-11-19 04:12:43,842 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 8 not checked. [2023-11-19 04:12:43,843 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:12:43,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715871871] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:12:43,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1050244657] [2023-11-19 04:12:43,995 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-19 04:12:43,995 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:12:43,996 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:12:43,996 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:12:43,996 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:12:45,208 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 144 for LOIs [2023-11-19 04:12:45,611 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:12:55,038 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1424#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_append_~data#1| 1) (= 1 |ULTIMATE.start_sll_append_#in~data#1|) (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_sll_append_~head#1.base|) 3) (or (and (exists ((|v_#valid_108| (Array Int Int))) (and (= (select |v_#valid_108| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_108| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_#memory_$Pointer$.offset_99| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_99| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_99| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_99| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_31| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_31| (store |v_#memory_$Pointer$.base_99| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_99| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_31| |ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_31| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_78| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_31| (store |v_#memory_int_78| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_78| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_31| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (exists ((|v_#memory_$Pointer$.base_95| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_95| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_95| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_sll_append_~head#1.base|) (exists ((|v_#length_93| (Array Int Int))) (= (store |v_#length_93| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8) |#length|)) (exists ((|v_#length_BEFORE_CALL_57| (Array Int Int))) (<= 8 (select |v_#length_BEFORE_CALL_57| |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_31| |ULTIMATE.start_sll_create_#res#1.base|) 1)) (exists ((|v_#memory_int_74| (Array Int (Array Int Int))) (|v_#memory_int_75| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_75| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_75| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 1))) (= |v_#memory_int_75| (store |v_#memory_int_74| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_74| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_75| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4)))))) (exists ((|v_#memory_$Pointer$.offset_95| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_95| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_95| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))))) (and (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_32| |ULTIMATE.start_sll_create_#res#1.base|) 1)) (exists ((|v_#valid_108| (Array Int Int))) (and (= (select |v_#valid_108| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_108| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_#memory_$Pointer$.offset_99| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_99| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_99| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_99| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_32| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| (store |v_#memory_$Pointer$.base_99| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_99| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |ULTIMATE.start_sll_create_#res#1.base|) 4)))))) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_95| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_95| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_95| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (= |ULTIMATE.start_sll_append_#in~head#1.base| |ULTIMATE.start_sll_append_~head#1.base|) (exists ((|v_old(#length)_AFTER_CALL_32| (Array Int Int))) (<= 8 (select |v_old(#length)_AFTER_CALL_32| |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#length_93| (Array Int Int))) (= (store |v_#length_93| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8) |#length|)) (exists ((|v_#memory_int_78| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_32| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_32| (store |v_#memory_int_78| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_78| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_32| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (exists ((|v_#memory_int_74| (Array Int (Array Int Int))) (|v_#memory_int_75| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_75| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_75| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 1))) (= |v_#memory_int_75| (store |v_#memory_int_74| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_74| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_75| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4)))))) (exists ((|v_#memory_$Pointer$.offset_95| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_95| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_95| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_append_#in~head#1.offset| 0))' at error location [2023-11-19 04:12:55,038 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:12:55,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 04:12:55,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2023-11-19 04:12:55,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931640054] [2023-11-19 04:12:55,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 04:12:55,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-19 04:12:55,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:55,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-19 04:12:55,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=938, Unknown=2, NotChecked=62, Total=1122 [2023-11-19 04:12:55,042 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 20 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-19 04:12:56,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:56,011 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2023-11-19 04:12:56,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 04:12:56,012 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2023-11-19 04:12:56,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:56,014 INFO L225 Difference]: With dead ends: 69 [2023-11-19 04:12:56,014 INFO L226 Difference]: Without dead ends: 69 [2023-11-19 04:12:56,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=159, Invalid=1175, Unknown=2, NotChecked=70, Total=1406 [2023-11-19 04:12:56,016 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 193 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:56,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 214 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 431 Invalid, 0 Unknown, 67 Unchecked, 0.6s Time] [2023-11-19 04:12:56,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-19 04:12:56,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2023-11-19 04:12:56,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 54 states have internal predecessors, (60), 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) [2023-11-19 04:12:56,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2023-11-19 04:12:56,027 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 28 [2023-11-19 04:12:56,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:56,028 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2023-11-19 04:12:56,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-19 04:12:56,028 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2023-11-19 04:12:56,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-19 04:12:56,030 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:56,030 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:56,054 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 04:12:56,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:12:56,246 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-11-19 04:12:56,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:56,247 INFO L85 PathProgramCache]: Analyzing trace with hash -478938770, now seen corresponding path program 1 times [2023-11-19 04:12:56,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:56,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364432100] [2023-11-19 04:12:56,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:56,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:57,770 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 04:12:57,770 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:57,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364432100] [2023-11-19 04:12:57,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364432100] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:12:57,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825435591] [2023-11-19 04:12:57,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:57,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:12:57,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:12:57,772 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:12:57,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b5c1df-4382-4786-9e10-e8f85e66338c/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 04:12:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:58,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-19 04:12:58,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:12:58,170 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 [2023-11-19 04:12:58,505 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 [2023-11-19 04:12:58,511 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 [2023-11-19 04:12:58,738 WARN L876 $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|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-19 04:12:58,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:12:58,759 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 [2023-11-19 04:12:58,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:12:58,769 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 [2023-11-19 04:12:58,791 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-19 04:12:58,792 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 [2023-11-19 04:12:58,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:12:58,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 04:12:58,888 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 [2023-11-19 04:12:58,933 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2023-11-19 04:12:58,933 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:12:59,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825435591] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:12:59,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1647680547] [2023-11-19 04:12:59,328 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-19 04:12:59,328 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:12:59,328 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:12:59,329 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:12:59,329 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:13:00,891 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 144 for LOIs [2023-11-19 04:13:01,491 INFO L180 IcfgInterpreter]: Interpretation finished