./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/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_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/bin/utaipan-verify-t7M7D8N6sZ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 05:04:31,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:04:31,209 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-19 05:04:31,218 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:04:31,219 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:04:31,265 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:04:31,266 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:04:31,266 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:04:31,268 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:04:31,274 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:04:31,274 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:04:31,276 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:04:31,276 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:04:31,278 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 05:04:31,279 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:04:31,279 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:04:31,280 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 05:04:31,280 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 05:04:31,281 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:04:31,281 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 05:04:31,287 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 05:04:31,288 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 05:04:31,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:04:31,290 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 05:04:31,290 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 05:04:31,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:04:31,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 05:04:31,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:04:31,292 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 05:04:31,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:04:31,294 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 05:04:31,294 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 05:04:31,295 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 05:04:31,295 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:04:31,295 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:04:31,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:04:31,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:04:31,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:04:31,296 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:04:31,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 05:04:31,297 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 05:04:31,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 05:04:31,298 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 05:04:31,298 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:04:31,299 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:04:31,299 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_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/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_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2023-11-19 05:04:31,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:04:31,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:04:31,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:04:31,706 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:04:31,707 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:04:31,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2023-11-19 05:04:34,816 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 05:04:35,139 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 05:04:35,140 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2023-11-19 05:04:35,154 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/bin/utaipan-verify-t7M7D8N6sZ/data/609be2f75/98e8a8bba6204df687a8b753b5d99912/FLAG4d55f04c3 [2023-11-19 05:04:35,168 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/bin/utaipan-verify-t7M7D8N6sZ/data/609be2f75/98e8a8bba6204df687a8b753b5d99912 [2023-11-19 05:04:35,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 05:04:35,172 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 05:04:35,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 05:04:35,174 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 05:04:35,179 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 05:04:35,180 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:04:35" (1/1) ... [2023-11-19 05:04:35,181 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52f3733b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:04:35, skipping insertion in model container [2023-11-19 05:04:35,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:04:35" (1/1) ... [2023-11-19 05:04:35,255 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 05:04:35,606 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2023-11-19 05:04:35,610 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:04:35,622 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 05:04:35,665 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2023-11-19 05:04:35,667 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:04:35,702 INFO L206 MainTranslator]: Completed translation [2023-11-19 05:04:35,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:04:35 WrapperNode [2023-11-19 05:04:35,703 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 05:04:35,704 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 05:04:35,704 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 05:04:35,704 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 05:04:35,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:04:35" (1/1) ... [2023-11-19 05:04:35,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:04:35" (1/1) ... [2023-11-19 05:04:35,752 INFO L138 Inliner]: procedures = 127, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 105 [2023-11-19 05:04:35,752 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 05:04:35,753 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 05:04:35,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 05:04:35,753 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 05:04:35,762 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:04:35" (1/1) ... [2023-11-19 05:04:35,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:04:35" (1/1) ... [2023-11-19 05:04:35,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:04:35" (1/1) ... [2023-11-19 05:04:35,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:04:35" (1/1) ... [2023-11-19 05:04:35,776 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:04:35" (1/1) ... [2023-11-19 05:04:35,779 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:04:35" (1/1) ... [2023-11-19 05:04:35,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:04:35" (1/1) ... [2023-11-19 05:04:35,783 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:04:35" (1/1) ... [2023-11-19 05:04:35,787 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 05:04:35,788 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 05:04:35,788 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 05:04:35,788 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 05:04:35,789 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:04:35" (1/1) ... [2023-11-19 05:04:35,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:04:35,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:04:35,824 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 05:04:35,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 05:04:35,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 05:04:35,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 05:04:35,871 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-19 05:04:35,871 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-19 05:04:35,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 05:04:35,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 05:04:35,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 05:04:35,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 05:04:35,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 05:04:35,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 05:04:35,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 05:04:35,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 05:04:35,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 05:04:35,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 05:04:36,024 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 05:04:36,026 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 05:04:36,261 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 05:04:36,314 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 05:04:36,315 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-19 05:04:36,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:04:36 BoogieIcfgContainer [2023-11-19 05:04:36,332 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 05:04:36,334 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 05:04:36,334 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 05:04:36,338 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 05:04:36,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:04:35" (1/3) ... [2023-11-19 05:04:36,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2272ab8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:04:36, skipping insertion in model container [2023-11-19 05:04:36,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:04:35" (2/3) ... [2023-11-19 05:04:36,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2272ab8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:04:36, skipping insertion in model container [2023-11-19 05:04:36,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:04:36" (3/3) ... [2023-11-19 05:04:36,341 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2023-11-19 05:04:36,357 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 05:04:36,357 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 05:04:36,406 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 05:04:36,413 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@397270b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 05:04:36,413 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 05:04:36,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 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 05:04:36,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 05:04:36,425 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:04:36,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:04:36,426 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:04:36,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:04:36,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1235008322, now seen corresponding path program 1 times [2023-11-19 05:04:36,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:04:36,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542584375] [2023-11-19 05:04:36,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:04:36,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:04:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:04:36,846 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 05:04:36,848 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:04:36,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542584375] [2023-11-19 05:04:36,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542584375] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:04:36,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:04:36,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:04:36,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519809127] [2023-11-19 05:04:36,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:04:36,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:04:36,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:04:36,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:04:36,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:04:36,893 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 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 2.6666666666666665) internal successors, (8), 3 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 05:04:36,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:04:36,947 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2023-11-19 05:04:36,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:04:36,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 05:04:36,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:04:36,956 INFO L225 Difference]: With dead ends: 35 [2023-11-19 05:04:36,957 INFO L226 Difference]: Without dead ends: 17 [2023-11-19 05:04:36,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:04:36,963 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:04:36,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 28 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:04:36,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-11-19 05:04:36,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2023-11-19 05:04:36,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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 05:04:36,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-11-19 05:04:37,000 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 10 [2023-11-19 05:04:37,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:04:37,000 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-11-19 05:04:37,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 05:04:37,001 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-11-19 05:04:37,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 05:04:37,003 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:04:37,003 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:04:37,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 05:04:37,004 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:04:37,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:04:37,004 INFO L85 PathProgramCache]: Analyzing trace with hash -908152313, now seen corresponding path program 1 times [2023-11-19 05:04:37,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:04:37,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315606984] [2023-11-19 05:04:37,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:04:37,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:04:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:04:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 05:04:37,191 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:04:37,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315606984] [2023-11-19 05:04:37,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315606984] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:04:37,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233980335] [2023-11-19 05:04:37,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:04:37,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:04:37,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:04:37,195 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:04:37,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 05:04:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:04:37,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 05:04:37,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:04:37,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:04:37,488 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:04:37,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 05:04:37,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233980335] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:04:37,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1088303891] [2023-11-19 05:04:37,575 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-11-19 05:04:37,575 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:04:37,579 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:04:37,584 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:04:37,585 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:04:40,109 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 137 for LOIs [2023-11-19 05:04:40,435 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:04:51,977 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.base_52| (Array Int (Array Int Int))) (|v_#memory_int_63| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_52| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_prepend_~head#1.base_14| Int) (|v_ULTIMATE.start_sll_prepend_#in~head#1.base_11| Int) (|v_#memory_int_19| (Array Int (Array Int Int)))) (and (= (store (store |v_#memory_$Pointer$.base_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.base_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_$Pointer$.base_52| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_14| (store (select (store |v_#memory_$Pointer$.base_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.base_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_$Pointer$.base_52| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0))) |#memory_$Pointer$.base|) (or (and (exists ((|v_#memory_$Pointer$.offset_51| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_51| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_51| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_$Pointer$.base_51| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (and (= (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|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (store |v_#memory_$Pointer$.base_51| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_51| |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)))))) (exists ((|v_#length_23| (Array Int Int))) (= |#length| (store |v_#length_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) 8))) (= |v_ULTIMATE.start_sll_prepend_~head#1.base_14| |v_ULTIMATE.start_sll_prepend_#in~head#1.base_11|) (exists ((|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_48| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.base_48| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0))) |v_#memory_$Pointer$.base_52|)) (exists ((|v_#memory_$Pointer$.offset_48| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_48| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.offset_48| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0))) |v_#memory_$Pointer$.offset_52|)) (exists ((|v_#valid_33| (Array Int Int))) (and (= (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) 1) |#valid|) (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0))) (exists ((|v_#memory_int_31| (Array Int (Array Int Int))) (|v_#memory_int_59| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_59| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_int_59| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_int_31| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4))) |v_#memory_int_31|) (= |v_#memory_int_63| (store |v_#memory_int_31| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_int_31| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0 1))))) (exists ((|v_#memory_int_62| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= (store |v_#memory_int_62| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_62| |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|)) (= |v_ULTIMATE.start_sll_prepend_#in~head#1.base_11| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ 1 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) |#StackHeapBarrier|)) (and (exists ((|v_#memory_$Pointer$.offset_51| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_51| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_51| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_51| (Array Int (Array Int Int)))) (and (= (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|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (store |v_#memory_$Pointer$.base_51| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_51| |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)))))) (exists ((|v_#memory_int_62| (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_62| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_62| |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))))) (exists ((|v_#length_23| (Array Int Int))) (= |#length| (store |v_#length_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) 8))) (= |v_ULTIMATE.start_sll_prepend_~head#1.base_14| |v_ULTIMATE.start_sll_prepend_#in~head#1.base_11|) (exists ((|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_48| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.base_48| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0))) |v_#memory_$Pointer$.base_52|)) (exists ((|v_#memory_$Pointer$.offset_48| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_48| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.offset_48| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0))) |v_#memory_$Pointer$.offset_52|)) (exists ((|v_#valid_33| (Array Int Int))) (and (= (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) 1) |#valid|) (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0))) (exists ((|v_#memory_int_31| (Array Int (Array Int Int))) (|v_#memory_int_59| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_59| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_int_59| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_int_31| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4))) |v_#memory_int_31|) (= |v_#memory_int_63| (store |v_#memory_int_31| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_int_31| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 0 1))))) (= |v_ULTIMATE.start_sll_prepend_#in~head#1.base_11| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ 1 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) |#StackHeapBarrier|))) (= |#memory_int| (store |v_#memory_int_19| |v_ULTIMATE.start_sll_prepend_~head#1.base_14| (store (select |v_#memory_int_19| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)))) (= |v_#memory_int_19| (store |v_#memory_int_63| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_int_63| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_int_19| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.offset_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_$Pointer$.offset_52| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_14| (store (select (store |v_#memory_$Pointer$.offset_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.offset_52| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0)) 4 (select (select |v_#memory_$Pointer$.offset_52| |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0))) |v_ULTIMATE.start_sll_prepend_~head#1.base_14|) 0 0))))) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-19 05:04:51,977 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:04:51,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:04:51,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-19 05:04:51,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158866456] [2023-11-19 05:04:51,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:04:51,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:04:51,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:04:51,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:04:51,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=203, Unknown=3, NotChecked=0, Total=240 [2023-11-19 05:04:51,982 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 05:04:52,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:04:52,032 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2023-11-19 05:04:52,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:04:52,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16 [2023-11-19 05:04:52,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:04:52,035 INFO L225 Difference]: With dead ends: 28 [2023-11-19 05:04:52,036 INFO L226 Difference]: Without dead ends: 18 [2023-11-19 05:04:52,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=34, Invalid=203, Unknown=3, NotChecked=0, Total=240 [2023-11-19 05:04:52,038 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:04:52,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 28 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:04:52,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-19 05:04:52,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-19 05:04:52,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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 05:04:52,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-11-19 05:04:52,044 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 16 [2023-11-19 05:04:52,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:04:52,044 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-11-19 05:04:52,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 05:04:52,045 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-11-19 05:04:52,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-19 05:04:52,046 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:04:52,046 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:04:52,060 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-19 05:04:52,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:04:52,252 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:04:52,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:04:52,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1199292684, now seen corresponding path program 2 times [2023-11-19 05:04:52,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:04:52,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228761303] [2023-11-19 05:04:52,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:04:52,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:04:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:04:53,467 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-19 05:04:53,468 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:04:53,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228761303] [2023-11-19 05:04:53,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228761303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:04:53,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:04:53,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 05:04:53,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983076588] [2023-11-19 05:04:53,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:04:53,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 05:04:53,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:04:53,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 05:04:53,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-19 05:04:53,472 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 05:04:53,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:04:53,633 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2023-11-19 05:04:53,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 05:04:53,634 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-11-19 05:04:53,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:04:53,635 INFO L225 Difference]: With dead ends: 25 [2023-11-19 05:04:53,635 INFO L226 Difference]: Without dead ends: 23 [2023-11-19 05:04:53,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-11-19 05:04:53,637 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 17 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:04:53,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 36 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:04:53,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-19 05:04:53,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2023-11-19 05:04:53,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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 05:04:53,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2023-11-19 05:04:53,645 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 22 [2023-11-19 05:04:53,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:04:53,645 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2023-11-19 05:04:53,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 05:04:53,646 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2023-11-19 05:04:53,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-19 05:04:53,647 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:04:53,647 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:04:53,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 05:04:53,648 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:04:53,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:04:53,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1199347709, now seen corresponding path program 1 times [2023-11-19 05:04:53,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:04:53,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291874568] [2023-11-19 05:04:53,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:04:53,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:04:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:04:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-19 05:04:53,949 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:04:53,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291874568] [2023-11-19 05:04:53,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291874568] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:04:53,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:04:53,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 05:04:53,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905372485] [2023-11-19 05:04:53,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:04:53,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 05:04:53,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:04:53,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 05:04:53,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:04:53,952 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 05:04:54,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:04:54,024 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2023-11-19 05:04:54,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 05:04:54,026 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-11-19 05:04:54,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:04:54,027 INFO L225 Difference]: With dead ends: 23 [2023-11-19 05:04:54,027 INFO L226 Difference]: Without dead ends: 20 [2023-11-19 05:04:54,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-19 05:04:54,029 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:04:54,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 47 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:04:54,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-19 05:04:54,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-19 05:04:54,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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 05:04:54,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-11-19 05:04:54,041 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 22 [2023-11-19 05:04:54,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:04:54,042 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-11-19 05:04:54,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 05:04:54,042 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-11-19 05:04:54,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-19 05:04:54,043 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:04:54,044 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:04:54,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 05:04:54,044 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:04:54,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:04:54,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1469067847, now seen corresponding path program 1 times [2023-11-19 05:04:54,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:04:54,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076175391] [2023-11-19 05:04:54,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:04:54,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:04:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:04:56,483 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 05:04:56,483 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:04:56,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076175391] [2023-11-19 05:04:56,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076175391] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:04:56,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345707313] [2023-11-19 05:04:56,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:04:56,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:04:56,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:04:56,486 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:04:56,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 05:04:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:04:56,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 99 conjunts are in the unsatisfiable core [2023-11-19 05:04:56,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:04:56,744 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 05:04:56,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 05:04:56,858 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 23 treesize of output 11 [2023-11-19 05:04:57,024 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 30 treesize of output 18 [2023-11-19 05:04:57,030 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 05:04:57,036 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 05:04:57,041 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 05:04:57,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:04:57,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 05:04:57,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:04:57,216 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 38 treesize of output 29 [2023-11-19 05:04:57,241 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-19 05:04:57,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-19 05:04:57,266 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-19 05:04:57,267 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 05:04:57,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:04:57,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:04:57,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-19 05:04:57,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:04:57,405 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 100 treesize of output 38 [2023-11-19 05:04:57,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:04:57,426 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 67 treesize of output 21 [2023-11-19 05:04:57,578 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-11-19 05:04:57,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 41 [2023-11-19 05:04:57,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:04:57,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-19 05:04:57,750 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 05:04:57,750 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:04:59,988 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_373 (Array Int Int)) (|ULTIMATE.start_sll_prepend_#t~ret7#1.offset| Int) (v_ArrVal_375 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (+ |ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4))) (let ((.cse3 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)))) (.cse0 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_373) |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_375) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))))) is different from false [2023-11-19 05:05:00,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345707313] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:05:00,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1344206352] [2023-11-19 05:05:00,844 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-11-19 05:05:00,844 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:05:00,845 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:05:00,845 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:05:00,845 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:05:02,288 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 120 for LOIs [2023-11-19 05:05:02,562 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:05:07,764 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '535#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |#StackHeapBarrier|) (= |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) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-19 05:05:07,764 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:05:07,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 05:05:07,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2023-11-19 05:05:07,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961845315] [2023-11-19 05:05:07,765 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 05:05:07,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-19 05:05:07,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:05:07,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-19 05:05:07,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1535, Unknown=1, NotChecked=78, Total=1722 [2023-11-19 05:05:07,768 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-19 05:05:09,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:05:09,029 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2023-11-19 05:05:09,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-19 05:05:09,029 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24 [2023-11-19 05:05:09,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:05:09,030 INFO L225 Difference]: With dead ends: 27 [2023-11-19 05:05:09,030 INFO L226 Difference]: Without dead ends: 25 [2023-11-19 05:05:09,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=158, Invalid=2197, Unknown=1, NotChecked=94, Total=2450 [2023-11-19 05:05:09,033 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 05:05:09,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 108 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 05:05:09,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-19 05:05:09,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2023-11-19 05:05:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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 05:05:09,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2023-11-19 05:05:09,042 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 24 [2023-11-19 05:05:09,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:05:09,043 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2023-11-19 05:05:09,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-19 05:05:09,043 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2023-11-19 05:05:09,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-19 05:05:09,044 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:05:09,044 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:05:09,065 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-19 05:05:09,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:05:09,256 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:05:09,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:05:09,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1469122872, now seen corresponding path program 1 times [2023-11-19 05:05:09,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:05:09,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381117936] [2023-11-19 05:05:09,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:05:09,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:05:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:05:10,030 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 05:05:10,030 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:05:10,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381117936] [2023-11-19 05:05:10,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381117936] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:05:10,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372519523] [2023-11-19 05:05:10,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:05:10,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:05:10,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:05:10,036 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:05:10,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bedf7f5b-c29e-41b4-8c8d-d16d67a0efc8/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 05:05:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:05:10,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 89 conjunts are in the unsatisfiable core [2023-11-19 05:05:10,213 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:05:10,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 05:05:10,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-19 05:05:10,586 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-19 05:05:10,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2023-11-19 05:05:10,593 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 05:05:10,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-11-19 05:05:10,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:05:10,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 05:05:10,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:05:10,819 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-19 05:05:10,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 42 [2023-11-19 05:05:10,848 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-19 05:05:10,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-19 05:05:10,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:05:10,947 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 18 treesize of output 14 [2023-11-19 05:05:10,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:05:11,012 INFO L349 Elim1Store]: treesize reduction 98, result has 21.6 percent of original size [2023-11-19 05:05:11,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 62 [2023-11-19 05:05:11,025 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 24 treesize of output 20 [2023-11-19 05:05:11,668 INFO L349 Elim1Store]: treesize reduction 52, result has 76.9 percent of original size [2023-11-19 05:05:11,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 147 treesize of output 244 [2023-11-19 05:05:14,838 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 05:05:14,838 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:05:14,894 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_prepend_~head#1.offset| Int) (v_ArrVal_521 (Array Int Int))) (not (= (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (+ |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse1 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_521))) (store .cse2 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0))) is different from false [2023-11-19 05:05:15,037 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_528 (Array Int Int)) (|ULTIMATE.start_sll_prepend_~head#1.offset| Int) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| Int) (v_ArrVal_521 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25|) 0)) (not (= 0 (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| (store v_ArrVal_528 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| v_ArrVal_528) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse1 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25|))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| v_ArrVal_521))) (store .cse2 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |ULTIMATE.start_sll_prepend_~head#1.offset| 0))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from false [2023-11-19 05:05:15,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372519523] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:05:15,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2103634836] [2023-11-19 05:05:15,057 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-19 05:05:15,057 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:05:15,057 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:05:15,057 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:05:15,058 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:05:16,780 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 137 for LOIs [2023-11-19 05:05:16,936 INFO L180 IcfgInterpreter]: Interpretation finished