./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_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_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/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_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/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_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/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 b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 04:51:55,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 04:51:55,613 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-19 04:51:55,618 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 04:51:55,619 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 04:51:55,643 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 04:51:55,644 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 04:51:55,644 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 04:51:55,645 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 04:51:55,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 04:51:55,646 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 04:51:55,647 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 04:51:55,648 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 04:51:55,648 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 04:51:55,649 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 04:51:55,650 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 04:51:55,650 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 04:51:55,651 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 04:51:55,651 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 04:51:55,652 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 04:51:55,653 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 04:51:55,654 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 04:51:55,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 04:51:55,655 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 04:51:55,656 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 04:51:55,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 04:51:55,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 04:51:55,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 04:51:55,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 04:51:55,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 04:51:55,658 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 04:51:55,659 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 04:51:55,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 04:51:55,660 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 04:51:55,660 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 04:51:55,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 04:51:55,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:51:55,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 04:51:55,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 04:51:55,661 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 04:51:55,662 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 04:51:55,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 04:51:55,665 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 04:51:55,665 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 04:51:55,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 04:51:55,665 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_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/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_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/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 -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2023-11-19 04:51:55,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 04:51:55,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 04:51:55,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 04:51:55,969 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 04:51:55,970 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 04:51:55,972 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2023-11-19 04:51:59,183 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 04:51:59,568 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 04:51:59,569 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2023-11-19 04:51:59,593 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/bin/utaipan-verify-t7M7D8N6sZ/data/b8a71d7fc/1b7fafc74de442e2b9d5ca026ee9573d/FLAG17c8797ce [2023-11-19 04:51:59,610 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/bin/utaipan-verify-t7M7D8N6sZ/data/b8a71d7fc/1b7fafc74de442e2b9d5ca026ee9573d [2023-11-19 04:51:59,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 04:51:59,618 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 04:51:59,626 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 04:51:59,626 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 04:51:59,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 04:51:59,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:51:59" (1/1) ... [2023-11-19 04:51:59,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a37468a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:51:59, skipping insertion in model container [2023-11-19 04:51:59,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:51:59" (1/1) ... [2023-11-19 04:51:59,695 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 04:51:59,976 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_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2023-11-19 04:51:59,981 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:51:59,991 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 04:52:00,067 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_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2023-11-19 04:52:00,077 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:52:00,119 INFO L206 MainTranslator]: Completed translation [2023-11-19 04:52:00,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:52:00 WrapperNode [2023-11-19 04:52:00,120 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 04:52:00,121 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 04:52:00,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 04:52:00,122 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 04:52:00,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:52:00" (1/1) ... [2023-11-19 04:52:00,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:52:00" (1/1) ... [2023-11-19 04:52:00,201 INFO L138 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 139 [2023-11-19 04:52:00,202 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 04:52:00,202 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 04:52:00,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 04:52:00,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 04:52:00,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:52:00" (1/1) ... [2023-11-19 04:52:00,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:52:00" (1/1) ... [2023-11-19 04:52:00,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:52:00" (1/1) ... [2023-11-19 04:52:00,236 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:52:00" (1/1) ... [2023-11-19 04:52:00,245 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:52:00" (1/1) ... [2023-11-19 04:52:00,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:52:00" (1/1) ... [2023-11-19 04:52:00,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:52:00" (1/1) ... [2023-11-19 04:52:00,271 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:52:00" (1/1) ... [2023-11-19 04:52:00,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 04:52:00,275 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 04:52:00,275 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 04:52:00,276 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 04:52:00,277 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:52:00" (1/1) ... [2023-11-19 04:52:00,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:52:00,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:52:00,326 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 04:52:00,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 04:52:00,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 04:52:00,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 04:52:00,367 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-19 04:52:00,367 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-19 04:52:00,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 04:52:00,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 04:52:00,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 04:52:00,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 04:52:00,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 04:52:00,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 04:52:00,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 04:52:00,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 04:52:00,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 04:52:00,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 04:52:00,555 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 04:52:00,558 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 04:52:00,888 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 04:52:00,953 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 04:52:00,954 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-19 04:52:00,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:52:00 BoogieIcfgContainer [2023-11-19 04:52:00,959 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 04:52:00,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 04:52:00,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 04:52:00,967 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 04:52:00,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:51:59" (1/3) ... [2023-11-19 04:52:00,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127e9952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:52:00, skipping insertion in model container [2023-11-19 04:52:00,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:52:00" (2/3) ... [2023-11-19 04:52:00,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127e9952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:52:00, skipping insertion in model container [2023-11-19 04:52:00,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:52:00" (3/3) ... [2023-11-19 04:52:00,974 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2023-11-19 04:52:00,995 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 04:52:00,996 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 04:52:01,057 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:52:01,064 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;@3e3d0f5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:52:01,065 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 04:52:01,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:52:01,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-19 04:52:01,077 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:52:01,078 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:52:01,079 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:52:01,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:52:01,084 INFO L85 PathProgramCache]: Analyzing trace with hash -605451759, now seen corresponding path program 1 times [2023-11-19 04:52:01,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:52:01,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337627692] [2023-11-19 04:52:01,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:52:01,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:52:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:52:01,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 04:52:01,615 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:52:01,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337627692] [2023-11-19 04:52:01,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337627692] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:52:01,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:52:01,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:52:01,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285583403] [2023-11-19 04:52:01,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:52:01,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:52:01,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:52:01,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:52:01,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:52:01,673 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:52:01,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:52:01,750 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2023-11-19 04:52:01,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:52:01,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Word has length 17 [2023-11-19 04:52:01,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:52:01,760 INFO L225 Difference]: With dead ends: 53 [2023-11-19 04:52:01,760 INFO L226 Difference]: Without dead ends: 25 [2023-11-19 04:52:01,764 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 04:52:01,768 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:52:01,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:52:01,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-19 04:52:01,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-11-19 04:52:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:52:01,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-11-19 04:52:01,816 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 17 [2023-11-19 04:52:01,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:52:01,817 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-11-19 04:52:01,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:52:01,817 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-11-19 04:52:01,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-19 04:52:01,819 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:52:01,819 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:52:01,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 04:52:01,820 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:52:01,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:52:01,821 INFO L85 PathProgramCache]: Analyzing trace with hash -948913763, now seen corresponding path program 1 times [2023-11-19 04:52:01,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:52:01,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399775143] [2023-11-19 04:52:01,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:52:01,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:52:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:52:02,645 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 04:52:02,645 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:52:02,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399775143] [2023-11-19 04:52:02,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399775143] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:52:02,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894936096] [2023-11-19 04:52:02,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:52:02,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:52:02,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:52:02,649 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:52:02,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 04:52:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:52:02,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-19 04:52:02,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:52:03,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-19 04:52:03,039 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))))) is different from true [2023-11-19 04:52:03,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:52:03,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-19 04:52:03,093 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 16 treesize of output 8 [2023-11-19 04:52:03,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-19 04:52:03,113 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:52:03,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894936096] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:52:03,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1626769932] [2023-11-19 04:52:03,252 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-19 04:52:03,253 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:52:03,257 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:52:03,265 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:52:03,266 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:52:05,673 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-19 04:52:05,687 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:52:19,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1626769932] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:52:19,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-19 04:52:19,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [13, 13] total 31 [2023-11-19 04:52:19,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201360613] [2023-11-19 04:52:19,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:52:19,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-19 04:52:19,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:52:19,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-19 04:52:19,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=838, Unknown=8, NotChecked=58, Total=992 [2023-11-19 04:52:19,374 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:52:22,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-19 04:52:24,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-19 04:52:26,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:52:26,799 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2023-11-19 04:52:26,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-19 04:52:26,800 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 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) Word has length 23 [2023-11-19 04:52:26,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:52:26,801 INFO L225 Difference]: With dead ends: 28 [2023-11-19 04:52:26,801 INFO L226 Difference]: Without dead ends: 26 [2023-11-19 04:52:26,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=88, Invalid=838, Unknown=8, NotChecked=58, Total=992 [2023-11-19 04:52:26,804 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2023-11-19 04:52:26,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 67 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 254 Invalid, 2 Unknown, 0 Unchecked, 7.4s Time] [2023-11-19 04:52:26,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-19 04:52:26,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-19 04:52:26,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:52:26,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2023-11-19 04:52:26,817 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 23 [2023-11-19 04:52:26,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:52:26,818 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-11-19 04:52:26,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:52:26,819 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2023-11-19 04:52:26,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-19 04:52:26,820 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:52:26,820 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:52:26,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 04:52:27,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:52:27,037 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:52:27,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:52:27,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1371121901, now seen corresponding path program 1 times [2023-11-19 04:52:27,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:52:27,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018886503] [2023-11-19 04:52:27,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:52:27,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:52:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:52:27,570 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 04:52:27,570 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:52:27,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018886503] [2023-11-19 04:52:27,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018886503] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:52:27,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424588167] [2023-11-19 04:52:27,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:52:27,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:52:27,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:52:27,576 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:52:27,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 04:52:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:52:27,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-19 04:52:27,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:52:27,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-19 04:52:27,862 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))))) is different from true [2023-11-19 04:52:27,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:52:27,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-19 04:52:27,895 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 16 treesize of output 8 [2023-11-19 04:52:27,915 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-19 04:52:27,916 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:52:27,967 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_14| Int) (v_ArrVal_300 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_14| 1)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_14| v_ArrVal_300) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) 0)))) is different from false [2023-11-19 04:52:27,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424588167] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:52:27,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1679045408] [2023-11-19 04:52:27,974 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-11-19 04:52:27,975 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:52:27,975 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:52:27,976 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:52:27,976 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:52:29,677 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-19 04:52:29,704 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:52:51,356 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '442#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~count~0#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (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|) (exists ((|v_#memory_$Pointer$.base_75| (Array Int (Array Int Int))) (|v_#memory_int_86| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_append_#in~head#1.base_10| Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_16| Int) (|v_#memory_int_15| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_69| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_15| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16| (store (select |v_#memory_int_15| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)))) (or (and (exists ((|v_#valid_40| (Array Int Int))) (and (= (select |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0) (= (store |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 1) |#valid|))) (exists ((|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_71| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (store (select |v_#memory_$Pointer$.base_71| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.base_75| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 4))) |v_#memory_$Pointer$.base_75|)) (exists ((|v_#memory_$Pointer$.offset_65| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_65| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (store (select |v_#memory_$Pointer$.offset_65| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_69| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 4))) |v_#memory_$Pointer$.offset_69|)) (exists ((|v_#memory_int_37| (Array Int (Array Int Int))) (|v_#memory_int_82| (Array Int (Array Int Int)))) (and (= |v_#memory_int_37| (store |v_#memory_int_82| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_int_82| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 (select (select |v_#memory_int_37| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0)))) (= (store |v_#memory_int_37| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_int_37| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 4 1)) |v_#memory_int_86|))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 0)) (exists ((|v_old(#memory_int)_AFTER_CALL_26| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_74| (Array Int (Array Int Int))) (|v_#memory_int_85| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (and (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_74| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_74| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |v_old(#memory_int)_AFTER_CALL_26| (store |v_#memory_int_85| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_85| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_26| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0)))) (= (select (select (store |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (= |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_10| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_16| |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_10|) (exists ((|v_#length_28| (Array Int Int))) (= |#length| (store |v_#length_28| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 8)))) (and (exists ((|v_#valid_40| (Array Int Int))) (and (= (select |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0) (= (store |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 1) |#valid|))) (exists ((|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_71| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (store (select |v_#memory_$Pointer$.base_71| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.base_75| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 4))) |v_#memory_$Pointer$.base_75|)) (exists ((|v_#memory_$Pointer$.offset_65| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_65| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (store (select |v_#memory_$Pointer$.offset_65| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_69| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 4))) |v_#memory_$Pointer$.offset_69|)) (exists ((|v_#memory_int_37| (Array Int (Array Int Int))) (|v_#memory_int_82| (Array Int (Array Int Int)))) (and (= |v_#memory_int_37| (store |v_#memory_int_82| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_int_82| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 (select (select |v_#memory_int_37| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0)))) (= (store |v_#memory_int_37| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_int_37| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 4 1)) |v_#memory_int_86|))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 0)) (= |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_10| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_74| (Array Int (Array Int Int))) (|v_#memory_int_85| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_42| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (and (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_74| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_74| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (store |v_#memory_int_85| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_85| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 (select (select |v_#memory_int_BEFORE_CALL_42| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0))) |v_#memory_int_BEFORE_CALL_42|) (= (select (select (store |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_16| |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_10|) (exists ((|v_#length_28| (Array Int Int))) (= |#length| (store |v_#length_28| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 8))))) (= |v_#memory_int_15| (store |v_#memory_int_86| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_int_86| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 (select (select |v_#memory_int_15| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0)))) (= 0 (select (select |v_#memory_$Pointer$.base_75| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) (= (store (store |v_#memory_$Pointer$.base_75| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.base_75| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0))) |v_ULTIMATE.start_sll_circular_append_~head#1.base_16| (store (select (store |v_#memory_$Pointer$.base_75| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.base_75| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0))) |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0))) |#memory_$Pointer$.base|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_69| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.offset_69| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 0)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_16| (store (select (store |v_#memory_$Pointer$.offset_69| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.offset_69| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 0)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0 0))) (= (select (select |v_#memory_$Pointer$.offset_69| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 0))))' at error location [2023-11-19 04:52:51,357 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:52:51,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 04:52:51,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2023-11-19 04:52:51,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816263897] [2023-11-19 04:52:51,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 04:52:51,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-19 04:52:51,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:52:51,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-19 04:52:51,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=905, Unknown=5, NotChecked=122, Total=1122 [2023-11-19 04:52:51,361 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 17 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 04:52:51,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:52:51,815 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2023-11-19 04:52:51,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 04:52:51,816 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2023-11-19 04:52:51,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:52:51,817 INFO L225 Difference]: With dead ends: 34 [2023-11-19 04:52:51,817 INFO L226 Difference]: Without dead ends: 25 [2023-11-19 04:52:51,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=115, Invalid=1148, Unknown=5, NotChecked=138, Total=1406 [2023-11-19 04:52:51,820 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 21 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:52:51,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 123 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 157 Invalid, 0 Unknown, 30 Unchecked, 0.2s Time] [2023-11-19 04:52:51,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-19 04:52:51,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-11-19 04:52:51,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:52:51,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2023-11-19 04:52:51,829 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 25 [2023-11-19 04:52:51,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:52:51,830 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-11-19 04:52:51,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 04:52:51,830 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2023-11-19 04:52:51,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-19 04:52:51,831 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:52:51,831 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:52:51,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 04:52:52,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:52:52,046 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:52:52,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:52:52,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1950307874, now seen corresponding path program 1 times [2023-11-19 04:52:52,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:52:52,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44393031] [2023-11-19 04:52:52,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:52:52,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:52:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:52:53,261 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:52:53,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:52:53,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44393031] [2023-11-19 04:52:53,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44393031] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:52:53,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654891481] [2023-11-19 04:52:53,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:52:53,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:52:53,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:52:53,268 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:52:53,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_234c31cd-e3e0-4ecf-8b6a-a2f1ece42e13/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 04:52:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:52:53,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-19 04:52:53,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:52:53,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 04:52:53,933 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 04:52:54,029 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-19 04:52:54,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-19 04:52:54,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-19 04:52:54,265 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 20 treesize of output 15 [2023-11-19 04:52:54,429 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 38 treesize of output 22 [2023-11-19 04:52:54,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-19 04:52:54,447 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 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 04:52:54,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-19 04:52:54,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:52:54,660 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 04:52:54,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:52:54,679 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 46 treesize of output 35 [2023-11-19 04:52:54,718 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-19 04:52:54,718 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 04:52:54,760 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-19 04:52:54,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-19 04:52:55,163 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-19 04:52:55,163 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 85 [2023-11-19 04:52:55,204 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-19 04:52:55,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 177 treesize of output 126 [2023-11-19 04:52:55,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:52:55,218 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2023-11-19 04:52:55,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:52:55,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2023-11-19 04:52:55,240 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 75 treesize of output 26 [2023-11-19 04:52:55,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:52:55,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-11-19 04:52:55,355 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-19 04:52:55,366 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 57 treesize of output 28 [2023-11-19 04:52:55,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-19 04:52:55,498 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:52:55,498 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:52:55,666 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_438 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_442 Int) (v_ArrVal_440 (Array Int Int))) (or (not (= v_ArrVal_440 (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select v_ArrVal_440 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_440) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_437) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_438) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_442)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_436) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2023-11-19 04:52:55,725 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_438 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_442 Int) (v_ArrVal_440 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (= v_ArrVal_440 (store (select |c_#memory_int| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| (select v_ArrVal_440 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17|)))) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_440) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_437) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_438) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| v_ArrVal_442)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_436) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2023-11-19 04:52:55,750 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_438 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_442 Int) (v_ArrVal_440 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (= v_ArrVal_440 (store (select |c_#memory_int| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| (select v_ArrVal_440 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17|)))) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_440) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_437) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_438) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| v_ArrVal_442)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_436) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from false [2023-11-19 04:52:55,917 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_438 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_442 Int) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_22| Int) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_440 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| Int) (v_ArrVal_453 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_22| v_ArrVal_452))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_22| v_ArrVal_453))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_22|) 0)) (not (= v_ArrVal_440 (store (select (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_22| v_ArrVal_451) .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| (select v_ArrVal_440 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17|)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_22| 1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_440) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_22| v_ArrVal_437) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select .cse1 .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_22|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_22| v_ArrVal_438) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select .cse2 .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| v_ArrVal_442)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_22| v_ArrVal_436) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (< (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17|))))) is different from false [2023-11-19 04:52:55,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654891481] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:52:55,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1530934323] [2023-11-19 04:52:55,924 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-11-19 04:52:55,924 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:52:55,925 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:52:55,925 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:52:55,925 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:52:57,357 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-19 04:52:57,367 INFO L180 IcfgInterpreter]: Interpretation finished