./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 cf1a7837 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_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX --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-cf1a783 [2023-11-12 00:13:58,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:13:58,141 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-12 00:13:58,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:13:58,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:13:58,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:13:58,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:13:58,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:13:58,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:13:58,196 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:13:58,197 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:13:58,198 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:13:58,199 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:13:58,201 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:13:58,201 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:13:58,202 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:13:58,202 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:13:58,203 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:13:58,203 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:13:58,204 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:13:58,205 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:13:58,205 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:13:58,207 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:13:58,207 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:13:58,208 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:13:58,208 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:13:58,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:13:58,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:13:58,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:13:58,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:13:58,212 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:13:58,213 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:13:58,213 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:13:58,213 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:13:58,214 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:13:58,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:13:58,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:13:58,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:13:58,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:13:58,216 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:13:58,216 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:13:58,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:13:58,217 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:13:58,217 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:13:58,218 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:13:58,218 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_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX/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_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX 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-12 00:13:58,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:13:58,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:13:58,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:13:58,625 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:13:58,625 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:13:58,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2023-11-12 00:14:01,981 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:14:02,464 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:14:02,465 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2023-11-12 00:14:02,487 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX/data/aba57f29b/504c6c1bdefc4e73b82de09d208b87ee/FLAGd30195c0a [2023-11-12 00:14:02,659 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX/data/aba57f29b/504c6c1bdefc4e73b82de09d208b87ee [2023-11-12 00:14:02,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:14:02,664 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:14:02,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:14:02,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:14:02,673 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:14:02,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:14:02" (1/1) ... [2023-11-12 00:14:02,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1692df3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:14:02, skipping insertion in model container [2023-11-12 00:14:02,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:14:02" (1/1) ... [2023-11-12 00:14:02,733 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:14:03,237 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_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2023-11-12 00:14:03,249 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:14:03,263 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:14:03,355 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_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2023-11-12 00:14:03,360 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:14:03,407 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:14:03,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:14:03 WrapperNode [2023-11-12 00:14:03,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:14:03,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:14:03,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:14:03,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:14:03,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:14:03" (1/1) ... [2023-11-12 00:14:03,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:14:03" (1/1) ... [2023-11-12 00:14:03,509 INFO L138 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 139 [2023-11-12 00:14:03,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:14:03,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:14:03,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:14:03,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:14:03,523 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:14:03" (1/1) ... [2023-11-12 00:14:03,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:14:03" (1/1) ... [2023-11-12 00:14:03,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:14:03" (1/1) ... [2023-11-12 00:14:03,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:14:03" (1/1) ... [2023-11-12 00:14:03,553 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:14:03" (1/1) ... [2023-11-12 00:14:03,558 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:14:03" (1/1) ... [2023-11-12 00:14:03,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:14:03" (1/1) ... [2023-11-12 00:14:03,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:14:03" (1/1) ... [2023-11-12 00:14:03,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:14:03,567 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:14:03,568 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:14:03,568 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:14:03,569 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:14:03" (1/1) ... [2023-11-12 00:14:03,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:14:03,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:14:03,612 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:14:03,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:14:03,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:14:03,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:14:03,660 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-12 00:14:03,661 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-12 00:14:03,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:14:03,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:14:03,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:14:03,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:14:03,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:14:03,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:14:03,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 00:14:03,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:14:03,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:14:03,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:14:03,804 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:14:03,806 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:14:04,061 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:14:04,123 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:14:04,124 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-12 00:14:04,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:14:04 BoogieIcfgContainer [2023-11-12 00:14:04,129 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:14:04,132 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:14:04,134 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:14:04,138 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:14:04,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:14:02" (1/3) ... [2023-11-12 00:14:04,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6656bda6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:14:04, skipping insertion in model container [2023-11-12 00:14:04,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:14:03" (2/3) ... [2023-11-12 00:14:04,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6656bda6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:14:04, skipping insertion in model container [2023-11-12 00:14:04,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:14:04" (3/3) ... [2023-11-12 00:14:04,145 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2023-11-12 00:14:04,170 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:14:04,170 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 00:14:04,234 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:14:04,242 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;@6540060d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:14:04,243 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 00:14:04,248 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-12 00:14:04,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 00:14:04,258 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:14:04,259 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:14:04,260 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:14:04,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:14:04,266 INFO L85 PathProgramCache]: Analyzing trace with hash -605451759, now seen corresponding path program 1 times [2023-11-12 00:14:04,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:14:04,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719598564] [2023-11-12 00:14:04,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:14:04,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:14:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:14:04,849 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-12 00:14:04,850 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:14:04,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719598564] [2023-11-12 00:14:04,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719598564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:14:04,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:14:04,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:14:04,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484369225] [2023-11-12 00:14:04,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:14:04,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:14:04,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:14:04,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:14:04,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:14:04,926 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-12 00:14:04,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:14:04,995 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2023-11-12 00:14:04,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:14:04,998 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-12 00:14:04,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:14:05,007 INFO L225 Difference]: With dead ends: 53 [2023-11-12 00:14:05,007 INFO L226 Difference]: Without dead ends: 25 [2023-11-12 00:14:05,011 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-12 00:14:05,015 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-12 00:14:05,017 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-12 00:14:05,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-12 00:14:05,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-11-12 00:14:05,060 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-12 00:14:05,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-11-12 00:14:05,064 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 17 [2023-11-12 00:14:05,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:14:05,064 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-11-12 00:14:05,065 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-12 00:14:05,065 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-11-12 00:14:05,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-12 00:14:05,067 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:14:05,067 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-12 00:14:05,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:14:05,067 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:14:05,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:14:05,069 INFO L85 PathProgramCache]: Analyzing trace with hash -948913763, now seen corresponding path program 1 times [2023-11-12 00:14:05,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:14:05,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204862354] [2023-11-12 00:14:05,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:14:05,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:14:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:14:05,851 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-12 00:14:05,852 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:14:05,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204862354] [2023-11-12 00:14:05,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204862354] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:14:05,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166364036] [2023-11-12 00:14:05,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:14:05,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:14:05,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:14:05,861 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:14:05,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:14:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:14:06,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-12 00:14:06,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:14:06,393 INFO L351 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-12 00:14:06,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:14:06,461 INFO L351 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-12 00:14:06,499 INFO L351 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-12 00:14:06,518 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-12 00:14:06,518 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:14:06,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166364036] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:14:06,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [13964416] [2023-11-12 00:14:06,692 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-12 00:14:06,693 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:14:06,704 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:14:06,711 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:14:06,712 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:14:09,512 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-12 00:14:09,534 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:14:11,339 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#in~data#1| 1) (= 1 |c_ULTIMATE.start_sll_circular_append_~data#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |c_ULTIMATE.start_sll_circular_append_#t~mem10#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |c_ULTIMATE.start_sll_circular_append_#t~mem10#1.offset|) (<= 2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 2 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 2 |c_ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse2 (exists ((|v_#memory_$Pointer$.base_57| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_57| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_57| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4)))))) (.cse3 (exists ((|v_#memory_$Pointer$.offset_54| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_54| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_54| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4)))))) (.cse4 (exists ((|v_#memory_int_63| (Array Int (Array Int Int))) (|v_#memory_int_37| (Array Int (Array Int Int)))) (let ((.cse9 (select |v_#memory_int_37| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|))) (and (= (store |v_#memory_int_37| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store .cse9 4 1)) |c_#memory_int|) (= (store |v_#memory_int_63| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_63| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select .cse9 0))) |v_#memory_int_37|))))) (.cse5 (exists ((|v_#length_21| (Array Int Int))) (= |c_#length| (store |v_#length_21| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8)))) (.cse6 (exists ((|v_#valid_33| (Array Int Int))) (and (= (select |v_#valid_33| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |c_#valid| (store |v_#valid_33| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1))))) (.cse7 (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0))) (.cse8 (<= (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |c_#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 .cse3 (exists ((|v_#memory_$Pointer$.base_60| (Array Int (Array Int Int))) (|v_#memory_int_66| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_57| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| Int) (|v_#memory_int_BEFORE_CALL_21| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_57| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.offset_57| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 0)) |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_int_66| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_int_66| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 (select (select |v_#memory_int_BEFORE_CALL_21| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0))) |v_#memory_int_BEFORE_CALL_21|) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_60| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.base_60| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (exists ((|v_#memory_$Pointer$.base_60| (Array Int (Array Int Int))) (|v_#memory_int_66| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_57| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| Int) (|v_old(#memory_int)_AFTER_CALL_12| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_57| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.offset_57| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 0)) |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_12| (store |v_#memory_int_66| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_int_66| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_12| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0)))) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_60| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.base_60| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) (= |c_ULTIMATE.start_main_~len~0#1| 2)) is different from true [2023-11-12 00:14:14,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [13964416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:14:14,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:14:14,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [13, 13] total 34 [2023-11-12 00:14:14,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255897620] [2023-11-12 00:14:14,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:14:14,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-12 00:14:14,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:14:14,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-12 00:14:14,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1077, Unknown=10, NotChecked=66, Total=1260 [2023-11-12 00:14:14,576 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-12 00:14:17,228 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-12 00:14:18,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:14:18,125 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2023-11-12 00:14:18,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-12 00:14:18,125 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-12 00:14:18,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:14:18,127 INFO L225 Difference]: With dead ends: 28 [2023-11-12 00:14:18,127 INFO L226 Difference]: Without dead ends: 26 [2023-11-12 00:14:18,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=107, Invalid=1077, Unknown=10, NotChecked=66, Total=1260 [2023-11-12 00:14:18,129 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-12 00:14:18,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 3 Unknown, 58 Unchecked, 3.5s Time] [2023-11-12 00:14:18,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-12 00:14:18,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-12 00:14:18,138 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-12 00:14:18,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2023-11-12 00:14:18,140 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 23 [2023-11-12 00:14:18,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:14:18,141 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-11-12 00:14:18,141 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-12 00:14:18,141 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2023-11-12 00:14:18,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-12 00:14:18,142 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:14:18,143 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-12 00:14:18,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:14:18,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:14:18,350 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:14:18,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:14:18,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1371121901, now seen corresponding path program 1 times [2023-11-12 00:14:18,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:14:18,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756291712] [2023-11-12 00:14:18,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:14:18,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:14:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:14:18,830 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-12 00:14:18,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:14:18,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756291712] [2023-11-12 00:14:18,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756291712] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:14:18,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132451458] [2023-11-12 00:14:18,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:14:18,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:14:18,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:14:18,837 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:14:18,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:14:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:14:19,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-12 00:14:19,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:14:19,161 INFO L351 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-12 00:14:19,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:14:19,205 INFO L351 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-12 00:14:19,241 INFO L351 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-12 00:14:19,260 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-12 00:14:19,260 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:14:19,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132451458] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:14:19,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [323837061] [2023-11-12 00:14:19,386 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-11-12 00:14:19,387 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:14:19,387 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:14:19,387 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:14:19,387 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:14:21,068 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-12 00:14:21,079 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:14:32,289 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '449#(and (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 4)) 1) (= |ULTIMATE.start_main_~count~0#1| 1) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |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_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (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|) (<= 2 |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) (= |#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))) (<= 2 |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_10|) (= (select (select |v_#memory_$Pointer$.offset_69| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 0))) (= (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-12 00:14:32,290 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:14:32,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:14:32,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2023-11-12 00:14:32,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448249341] [2023-11-12 00:14:32,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:14:32,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-12 00:14:32,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:14:32,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-12 00:14:32,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1281, Unknown=14, NotChecked=0, Total=1406 [2023-11-12 00:14:32,295 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:14:32,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:14:32,850 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2023-11-12 00:14:32,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 00:14:32,851 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 25 [2023-11-12 00:14:32,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:14:32,852 INFO L225 Difference]: With dead ends: 34 [2023-11-12 00:14:32,852 INFO L226 Difference]: Without dead ends: 25 [2023-11-12 00:14:32,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=163, Invalid=1714, Unknown=15, NotChecked=0, Total=1892 [2023-11-12 00:14:32,855 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 33 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:14:32,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 148 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:14:32,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-12 00:14:32,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-11-12 00:14:32,863 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-12 00:14:32,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2023-11-12 00:14:32,864 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 25 [2023-11-12 00:14:32,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:14:32,864 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-11-12 00:14:32,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 00:14:32,865 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2023-11-12 00:14:32,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-12 00:14:32,866 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:14:32,866 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-12 00:14:32,873 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-12 00:14:33,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:14:33,073 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 00:14:33,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:14:33,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1950307874, now seen corresponding path program 1 times [2023-11-12 00:14:33,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:14:33,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134145669] [2023-11-12 00:14:33,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:14:33,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:14:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:14:34,257 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-12 00:14:34,258 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:14:34,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134145669] [2023-11-12 00:14:34,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134145669] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:14:34,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550497026] [2023-11-12 00:14:34,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:14:34,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:14:34,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:14:34,261 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:14:34,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eb4e6da-554d-4f8d-ae33-fa86cd164d79/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:14:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:14:34,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-12 00:14:34,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:14:34,685 INFO L351 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-12 00:14:34,862 INFO L351 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-12 00:14:34,947 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-12 00:14:34,948 INFO L351 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-12 00:14:35,060 INFO L351 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-12 00:14:35,166 INFO L351 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-12 00:14:35,300 INFO L351 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-12 00:14:35,306 INFO L351 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-12 00:14:35,313 INFO L351 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-12 00:14:35,318 INFO L351 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-12 00:14:35,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:14:35,495 INFO L351 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-12 00:14:35,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:14:35,509 INFO L351 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-12 00:14:35,534 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-12 00:14:35,534 INFO L351 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-12 00:14:35,574 INFO L322 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-12 00:14:35,575 INFO L351 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-12 00:14:35,945 INFO L322 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-12 00:14:35,945 INFO L351 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-12 00:14:35,980 INFO L322 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-12 00:14:35,981 INFO L351 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-12 00:14:35,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:14:35,996 INFO L351 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-12 00:14:36,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:14:36,006 INFO L351 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-12 00:14:36,015 INFO L351 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-12 00:14:36,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:14:36,028 INFO L351 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-12 00:14:36,135 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-12 00:14:36,135 INFO L351 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-12 00:14:36,151 INFO L351 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-12 00:14:36,254 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-12 00:14:36,254 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:14:36,411 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int))) (or (not (= v_ArrVal_439 (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_439 |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_439) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_436) (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_437) |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_441)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2023-11-12 00:14:36,466 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_441 Int) (v_ArrVal_439 (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 (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_439) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_436) (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_437) |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_441)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (< (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|) (not (= v_ArrVal_439 (store (select |c_#memory_int| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| (select v_ArrVal_439 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17|))))))) is different from false [2023-11-12 00:14:36,491 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_441 Int) (v_ArrVal_439 (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 (< (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|) (not (= v_ArrVal_439 (store (select |c_#memory_int| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| (select v_ArrVal_439 |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_439) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_436) (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_437) |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_441)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from false [2023-11-12 00:14:36,652 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_441 Int) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| Int) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_450 (Array Int Int)) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_451))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_450)) (.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (< (select (select .cse0 |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|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| 1)) (not (= v_ArrVal_439 (store (select (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_452) .cse1) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| (select v_ArrVal_439 |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| .cse1 v_ArrVal_439) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_436) (select (select (store (store |c_#memory_$Pointer$.base| .cse1 (store (select .cse2 .cse1) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_437) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_17| v_ArrVal_441)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_435) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))) is different from false [2023-11-12 00:14:36,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550497026] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:14:36,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [499801724] [2023-11-12 00:14:36,658 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-11-12 00:14:36,658 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:14:36,659 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:14:36,659 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:14:36,659 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:14:38,082 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-12 00:14:38,092 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:14:50,035 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '701#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |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_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (exists ((|v_#memory_$Pointer$.offset_84| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_append_#in~head#1.base_12| Int) (|v_#memory_int_115| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| Int) (|v_#memory_$Pointer$.base_90| (Array Int (Array Int Int))) (|v_#memory_int_19| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_18| Int)) (and (or (and (not (= |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| 0)) (exists ((|v_#memory_$Pointer$.offset_80| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| (store (store (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_84| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 4))) |v_#memory_$Pointer$.offset_84|)) (exists ((|v_#valid_51| (Array Int Int))) (and (= (store |v_#valid_51| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| 1) |#valid|) (= (select |v_#valid_51| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0))) (exists ((|v_#memory_int_37| (Array Int (Array Int Int))) (|v_#memory_int_111| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_37| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| (store (select |v_#memory_int_37| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 4 1)) |v_#memory_int_115|) (= |v_#memory_int_37| (store |v_#memory_int_111| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| (store (select |v_#memory_int_111| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0 (select (select |v_#memory_int_37| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0)))))) (= |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_12| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_83| (Array Int (Array Int Int))) (|v_#memory_int_114| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_89| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_67| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| Int)) (and (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_89| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.base_89| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= 0 (select (select (store |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (store |v_#memory_int_114| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_int_114| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 (select (select |v_#memory_int_BEFORE_CALL_67| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0))) |v_#memory_int_BEFORE_CALL_67|))) (exists ((|v_#length_35| (Array Int Int))) (= |#length| (store |v_#length_35| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| 8))) (exists ((|v_#memory_$Pointer$.base_86| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| (store (store (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0 0) 4 (select (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 4))) |v_#memory_$Pointer$.base_90|)) (<= (+ |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_18| |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_12|)) (and (exists ((|v_#memory_$Pointer$.offset_83| (Array Int (Array Int Int))) (|v_#memory_int_114| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_39| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_89| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| Int)) (and (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_89| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.base_89| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= 0 (select (select (store |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.offset_83| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |v_old(#memory_int)_AFTER_CALL_39| (store |v_#memory_int_114| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_int_114| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_39| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0)))))) (not (= |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| 0)) (exists ((|v_#memory_$Pointer$.offset_80| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| (store (store (select |v_#memory_$Pointer$.offset_80| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_84| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 4))) |v_#memory_$Pointer$.offset_84|)) (exists ((|v_#valid_51| (Array Int Int))) (and (= (store |v_#valid_51| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| 1) |#valid|) (= (select |v_#valid_51| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0))) (exists ((|v_#memory_int_37| (Array Int (Array Int Int))) (|v_#memory_int_111| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_37| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| (store (select |v_#memory_int_37| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 4 1)) |v_#memory_int_115|) (= |v_#memory_int_37| (store |v_#memory_int_111| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| (store (select |v_#memory_int_111| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0 (select (select |v_#memory_int_37| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0)))))) (= |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_12| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_35| (Array Int Int))) (= |#length| (store |v_#length_35| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| 8))) (exists ((|v_#memory_$Pointer$.base_86| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| (store (store (select |v_#memory_$Pointer$.base_86| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0 0) 4 (select (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 4))) |v_#memory_$Pointer$.base_90|)) (<= (+ |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_18| |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_12|))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_84| (select (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) (store (select |v_#memory_$Pointer$.offset_84| (select (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)) (select (select |v_#memory_$Pointer$.offset_84| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) 0)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| (store (select (store |v_#memory_$Pointer$.offset_84| (select (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) (store (select |v_#memory_$Pointer$.offset_84| (select (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)) (select (select |v_#memory_$Pointer$.offset_84| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) 0)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0 (select (select (store |v_#memory_$Pointer$.offset_84| (select (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) (store (select |v_#memory_$Pointer$.offset_84| (select (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)) (select (select |v_#memory_$Pointer$.offset_84| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) 0)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)))) (= |v_#memory_int_19| (store |v_#memory_int_115| (select (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) (store (select |v_#memory_int_115| (select (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)) (select (select |v_#memory_$Pointer$.offset_84| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) (select (select |v_#memory_int_19| (select (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)) (select (select |v_#memory_$Pointer$.offset_84| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0))))) (= (store (store |v_#memory_$Pointer$.base_90| (select (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) (store (select |v_#memory_$Pointer$.base_90| (select (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)) (select (select |v_#memory_$Pointer$.offset_84| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| (store (select (store |v_#memory_$Pointer$.base_90| (select (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) (store (select |v_#memory_$Pointer$.base_90| (select (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)) (select (select |v_#memory_$Pointer$.offset_84| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|)) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0 (select (select (store |v_#memory_$Pointer$.base_90| (select (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) (store (select |v_#memory_$Pointer$.base_90| (select (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)) (select (select |v_#memory_$Pointer$.offset_84| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0))) |#memory_$Pointer$.base|) (= (select (select |v_#memory_$Pointer$.offset_84| (select (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)) (select (select |v_#memory_$Pointer$.offset_84| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)) (select (select |v_#memory_$Pointer$.offset_84| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)) (<= 2 |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) (= |#memory_int| (store |v_#memory_int_19| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18| (store (select |v_#memory_int_19| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_append_~new_last~0#1.base_18|) 0)))) (or (not (= (select (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) 0)) (not (= 0 (select (select |v_#memory_$Pointer$.offset_84| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)))) (= (select (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0) (select (select |v_#memory_$Pointer$.base_90| (select (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0)) (select (select |v_#memory_$Pointer$.offset_84| |v_ULTIMATE.start_sll_circular_append_~head#1.base_18|) 0))) (<= 2 |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_12|))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 1)) (= (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-12 00:14:50,035 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:14:50,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:14:50,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 36 [2023-11-12 00:14:50,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941620123] [2023-11-12 00:14:50,035 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:14:50,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-12 00:14:50,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:14:50,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-12 00:14:50,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=3014, Unknown=19, NotChecked=452, Total=3660 [2023-11-12 00:14:50,040 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 36 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 states have internal predecessors, (37), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-12 00:14:53,039 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-12 00:14:56,275 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]