./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91eab82f-31c5-4782-b9fa-f6c5b7d95284/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91eab82f-31c5-4782-b9fa-f6c5b7d95284/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_91eab82f-31c5-4782-b9fa-f6c5b7d95284/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91eab82f-31c5-4782-b9fa-f6c5b7d95284/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91eab82f-31c5-4782-b9fa-f6c5b7d95284/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_91eab82f-31c5-4782-b9fa-f6c5b7d95284/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 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 01:02:56,026 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 01:02:56,098 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91eab82f-31c5-4782-b9fa-f6c5b7d95284/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-12 01:02:56,104 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 01:02:56,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 01:02:56,137 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 01:02:56,138 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 01:02:56,138 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 01:02:56,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 01:02:56,145 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 01:02:56,146 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 01:02:56,147 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 01:02:56,148 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 01:02:56,154 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 01:02:56,154 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 01:02:56,155 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 01:02:56,156 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 01:02:56,157 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 01:02:56,158 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 01:02:56,158 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 01:02:56,160 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 01:02:56,161 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 01:02:56,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 01:02:56,163 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 01:02:56,163 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 01:02:56,164 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 01:02:56,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 01:02:56,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 01:02:56,165 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 01:02:56,166 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 01:02:56,167 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 01:02:56,167 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 01:02:56,168 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 01:02:56,168 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 01:02:56,168 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 01:02:56,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 01:02:56,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 01:02:56,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 01:02:56,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 01:02:56,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 01:02:56,171 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 01:02:56,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 01:02:56,171 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 01:02:56,172 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 01:02:56,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 01:02:56,173 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_91eab82f-31c5-4782-b9fa-f6c5b7d95284/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_91eab82f-31c5-4782-b9fa-f6c5b7d95284/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 -> 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab [2023-11-12 01:02:56,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 01:02:56,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 01:02:56,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 01:02:56,586 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 01:02:56,586 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 01:02:56,589 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91eab82f-31c5-4782-b9fa-f6c5b7d95284/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2023-11-12 01:03:00,036 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 01:03:00,414 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 01:03:00,415 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91eab82f-31c5-4782-b9fa-f6c5b7d95284/sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2023-11-12 01:03:00,439 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91eab82f-31c5-4782-b9fa-f6c5b7d95284/bin/utaipan-verify-NcY6lQBIFX/data/059d9aa1b/27e5c610daea497993d477efe58f4fbf/FLAGd90f6aeed [2023-11-12 01:03:00,459 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91eab82f-31c5-4782-b9fa-f6c5b7d95284/bin/utaipan-verify-NcY6lQBIFX/data/059d9aa1b/27e5c610daea497993d477efe58f4fbf [2023-11-12 01:03:00,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 01:03:00,467 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 01:03:00,474 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 01:03:00,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 01:03:00,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 01:03:00,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:03:00" (1/1) ... [2023-11-12 01:03:00,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cc9a67e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:03:00, skipping insertion in model container [2023-11-12 01:03:00,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:03:00" (1/1) ... [2023-11-12 01:03:00,557 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 01:03:01,041 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_91eab82f-31c5-4782-b9fa-f6c5b7d95284/sv-benchmarks/c/list-simple/sll2n_append_unequal.i[24323,24336] [2023-11-12 01:03:01,052 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 01:03:01,065 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 01:03:01,134 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_91eab82f-31c5-4782-b9fa-f6c5b7d95284/sv-benchmarks/c/list-simple/sll2n_append_unequal.i[24323,24336] [2023-11-12 01:03:01,136 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 01:03:01,170 INFO L206 MainTranslator]: Completed translation [2023-11-12 01:03:01,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:03:01 WrapperNode [2023-11-12 01:03:01,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 01:03:01,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 01:03:01,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 01:03:01,173 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 01:03:01,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:03:01" (1/1) ... [2023-11-12 01:03:01,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:03:01" (1/1) ... [2023-11-12 01:03:01,224 INFO L138 Inliner]: procedures = 127, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2023-11-12 01:03:01,224 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 01:03:01,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 01:03:01,225 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 01:03:01,225 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 01:03:01,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:03:01" (1/1) ... [2023-11-12 01:03:01,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:03:01" (1/1) ... [2023-11-12 01:03:01,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:03:01" (1/1) ... [2023-11-12 01:03:01,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:03:01" (1/1) ... [2023-11-12 01:03:01,252 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:03:01" (1/1) ... [2023-11-12 01:03:01,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:03:01" (1/1) ... [2023-11-12 01:03:01,259 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:03:01" (1/1) ... [2023-11-12 01:03:01,261 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:03:01" (1/1) ... [2023-11-12 01:03:01,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 01:03:01,267 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 01:03:01,267 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 01:03:01,267 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 01:03:01,284 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:03:01" (1/1) ... [2023-11-12 01:03:01,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 01:03:01,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91eab82f-31c5-4782-b9fa-f6c5b7d95284/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:03:01,321 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91eab82f-31c5-4782-b9fa-f6c5b7d95284/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 01:03:01,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91eab82f-31c5-4782-b9fa-f6c5b7d95284/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 01:03:01,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 01:03:01,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 01:03:01,362 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-12 01:03:01,362 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-12 01:03:01,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 01:03:01,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 01:03:01,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 01:03:01,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 01:03:01,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 01:03:01,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 01:03:01,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 01:03:01,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 01:03:01,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 01:03:01,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 01:03:01,511 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 01:03:01,522 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 01:03:01,881 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 01:03:01,973 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 01:03:01,980 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-12 01:03:01,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:03:01 BoogieIcfgContainer [2023-11-12 01:03:01,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 01:03:01,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 01:03:01,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 01:03:01,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 01:03:01,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:03:00" (1/3) ... [2023-11-12 01:03:01,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b37e95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:03:01, skipping insertion in model container [2023-11-12 01:03:01,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:03:01" (2/3) ... [2023-11-12 01:03:01,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b37e95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:03:01, skipping insertion in model container [2023-11-12 01:03:01,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:03:01" (3/3) ... [2023-11-12 01:03:01,999 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2023-11-12 01:03:02,023 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 01:03:02,025 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 01:03:02,090 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 01:03:02,098 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;@50ef7cf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 01:03:02,098 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 01:03:02,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 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 01:03:02,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 01:03:02,112 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:03:02,112 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:03:02,113 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 01:03:02,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:03:02,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1806204982, now seen corresponding path program 1 times [2023-11-12 01:03:02,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:03:02,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448274017] [2023-11-12 01:03:02,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:03:02,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:03:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:03:02,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:03:02,497 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:03:02,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448274017] [2023-11-12 01:03:02,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448274017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:03:02,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:03:02,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 01:03:02,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515644742] [2023-11-12 01:03:02,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:03:02,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 01:03:02,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:03:02,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 01:03:02,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 01:03:02,541 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 01:03:02,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:03:02,606 INFO L93 Difference]: Finished difference Result 53 states and 77 transitions. [2023-11-12 01:03:02,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 01:03:02,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-11-12 01:03:02,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:03:02,618 INFO L225 Difference]: With dead ends: 53 [2023-11-12 01:03:02,618 INFO L226 Difference]: Without dead ends: 26 [2023-11-12 01:03:02,622 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 01:03:02,630 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 01:03:02,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 01:03:02,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-12 01:03:02,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-11-12 01:03:02,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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 01:03:02,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-11-12 01:03:02,685 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 12 [2023-11-12 01:03:02,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:03:02,687 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-11-12 01:03:02,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 01:03:02,688 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-11-12 01:03:02,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-12 01:03:02,690 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:03:02,691 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:03:02,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 01:03:02,691 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 01:03:02,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:03:02,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1904638321, now seen corresponding path program 1 times [2023-11-12 01:03:02,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:03:02,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462794819] [2023-11-12 01:03:02,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:03:02,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:03:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:03:02,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 01:03:02,929 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:03:02,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462794819] [2023-11-12 01:03:02,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462794819] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 01:03:02,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269562439] [2023-11-12 01:03:02,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:03:02,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:03:02,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91eab82f-31c5-4782-b9fa-f6c5b7d95284/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:03:02,935 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91eab82f-31c5-4782-b9fa-f6c5b7d95284/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 01:03:02,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91eab82f-31c5-4782-b9fa-f6c5b7d95284/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 01:03:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:03:03,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 01:03:03,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 01:03:03,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:03:03,234 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 01:03:03,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 01:03:03,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269562439] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 01:03:03,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [774874657] [2023-11-12 01:03:03,338 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-11-12 01:03:03,338 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 01:03:03,343 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 01:03:03,349 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 01:03:03,351 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 01:03:06,035 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 139 for LOIs [2023-11-12 01:03:06,350 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 01:03:15,895 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '238#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#memory_$Pointer$.base_54| (Array Int (Array Int Int))) (|v_#memory_int_55| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_54| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_append_#in~head#1.base_9| Int) (|v_ULTIMATE.start_sll_append_~head#1.base_13| Int)) (and (= (store |v_#memory_$Pointer$.base_54| |v_ULTIMATE.start_sll_append_~head#1.base_13| (store (select |v_#memory_$Pointer$.base_54| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0))) |#memory_$Pointer$.base|) (or (and (exists ((|v_#memory_$Pointer$.base_53| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (store |v_#memory_$Pointer$.base_53| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_53| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 4)))))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 0)) (exists ((|v_#length_23| (Array Int Int))) (= (store |v_#length_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 8) |#length|)) (exists ((|v_#memory_$Pointer$.offset_50| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_50| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (store (select |v_#memory_$Pointer$.offset_50| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_54| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0))) |v_#memory_$Pointer$.offset_54|)) (exists ((|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_53| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_53| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_sll_append_#in~head#1.base_9| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_54| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= (store |v_#memory_int_54| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_54| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 4))) |v_old(#memory_int)_AFTER_CALL_9|)) (exists ((|v_#memory_$Pointer$.base_50| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_50| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (store (select |v_#memory_$Pointer$.base_50| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_54| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0))) |v_#memory_$Pointer$.base_54|)) (exists ((|v_#valid_33| (Array Int Int))) (and (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0) (= (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 1) |#valid|))) (= |v_ULTIMATE.start_sll_append_#in~head#1.base_9| |v_ULTIMATE.start_sll_append_~head#1.base_13|) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_26| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_51| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_51| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4 (select (select |v_#memory_int_26| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4))) |v_#memory_int_26|) (= (store |v_#memory_int_26| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_26| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0 5)) |v_#memory_int_55|)))) (and (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 0)) (exists ((|v_#length_23| (Array Int Int))) (= (store |v_#length_23| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 8) |#length|)) (exists ((|v_#memory_int_54| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_10| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_10| (store |v_#memory_int_54| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_54| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (exists ((|v_#memory_$Pointer$.offset_50| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_50| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (store (select |v_#memory_$Pointer$.offset_50| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_54| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0))) |v_#memory_$Pointer$.offset_54|)) (exists ((|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_53| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_53| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_53| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (store |v_#memory_$Pointer$.base_53| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_53| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (= |v_ULTIMATE.start_sll_append_#in~head#1.base_9| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_50| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_50| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (store (select |v_#memory_$Pointer$.base_50| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_54| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0))) |v_#memory_$Pointer$.base_54|)) (exists ((|v_#valid_33| (Array Int Int))) (and (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0) (= (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 1) |#valid|))) (= |v_ULTIMATE.start_sll_append_#in~head#1.base_9| |v_ULTIMATE.start_sll_append_~head#1.base_13|) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_26| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_51| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_51| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4 (select (select |v_#memory_int_26| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 4))) |v_#memory_int_26|) (= (store |v_#memory_int_26| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) (store (select |v_#memory_int_26| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)) 0 5)) |v_#memory_int_55|))))) (= (select (select |v_#memory_$Pointer$.base_54| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 0) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_54| |v_ULTIMATE.start_sll_append_~head#1.base_13| (store (select |v_#memory_$Pointer$.offset_54| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0 0))) (<= 2 |v_ULTIMATE.start_sll_append_#in~head#1.base_9|) (<= 2 |v_ULTIMATE.start_sll_append_~head#1.base_13|) (= (select (select |v_#memory_$Pointer$.offset_54| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0) 0) (= |#memory_int| (store |v_#memory_int_55| |v_ULTIMATE.start_sll_append_~head#1.base_13| (store (select |v_#memory_int_55| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_append_~head#1.base_13|) 0)))))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 0))' at error location [2023-11-12 01:03:15,895 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 01:03:15,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 01:03:15,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-12 01:03:15,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474693703] [2023-11-12 01:03:15,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 01:03:15,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 01:03:15,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:03:15,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 01:03:15,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=233, Unknown=3, NotChecked=0, Total=272 [2023-11-12 01:03:15,900 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-12 01:03:15,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:03:15,928 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2023-11-12 01:03:15,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 01:03:15,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 18 [2023-11-12 01:03:15,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:03:15,930 INFO L225 Difference]: With dead ends: 46 [2023-11-12 01:03:15,930 INFO L226 Difference]: Without dead ends: 27 [2023-11-12 01:03:15,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=36, Invalid=233, Unknown=3, NotChecked=0, Total=272 [2023-11-12 01:03:15,932 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 01:03:15,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 01:03:15,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-12 01:03:15,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-12 01:03:15,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 01:03:15,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2023-11-12 01:03:15,939 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2023-11-12 01:03:15,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:03:15,940 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2023-11-12 01:03:15,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-12 01:03:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2023-11-12 01:03:15,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-12 01:03:15,942 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:03:15,942 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:03:15,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91eab82f-31c5-4782-b9fa-f6c5b7d95284/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 01:03:16,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91eab82f-31c5-4782-b9fa-f6c5b7d95284/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:03:16,150 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 01:03:16,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:03:16,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1509467688, now seen corresponding path program 2 times [2023-11-12 01:03:16,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:03:16,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837940994] [2023-11-12 01:03:16,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:03:16,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:03:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:03:16,910 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 01:03:16,912 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:03:16,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837940994] [2023-11-12 01:03:16,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837940994] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 01:03:16,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934362783] [2023-11-12 01:03:16,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 01:03:16,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:03:16,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91eab82f-31c5-4782-b9fa-f6c5b7d95284/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:03:16,920 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91eab82f-31c5-4782-b9fa-f6c5b7d95284/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 01:03:16,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91eab82f-31c5-4782-b9fa-f6c5b7d95284/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 01:03:17,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-12 01:03:17,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 01:03:17,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-12 01:03:17,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 01:03:17,233 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 01:03:17,255 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))))) is different from true [2023-11-12 01:03:17,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:03:17,271 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 01:03:17,298 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 01:03:17,316 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2023-11-12 01:03:17,317 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 01:03:17,381 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_17| Int) (v_ArrVal_212 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_17| v_ArrVal_212) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_17| 1)))) is different from false [2023-11-12 01:03:17,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934362783] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 01:03:17,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1281539533] [2023-11-12 01:03:17,388 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-11-12 01:03:17,388 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 01:03:17,389 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 01:03:17,389 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 01:03:17,389 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 01:03:19,172 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 139 for LOIs [2023-11-12 01:03:19,443 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 01:03:30,013 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '457#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_15| Int) (|v_#memory_$Pointer$.offset_65| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_append_#in~head#1.base_11| Int) (|v_#memory_$Pointer$.base_68| (Array Int (Array Int Int))) (|v_#memory_int_72| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_65| |v_ULTIMATE.start_sll_append_~head#1.base_15| (store (select |v_#memory_$Pointer$.offset_65| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0 0))) (<= 2 |v_ULTIMATE.start_sll_append_#in~head#1.base_11|) (= (select (select |v_#memory_$Pointer$.offset_65| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0) 0) (<= 2 |v_ULTIMATE.start_sll_append_~head#1.base_15|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_68| |v_ULTIMATE.start_sll_append_~head#1.base_15| (store (select |v_#memory_$Pointer$.base_68| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0)))) (= (select (select |v_#memory_$Pointer$.base_68| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0) 0) (= |#memory_int| (store |v_#memory_int_72| |v_ULTIMATE.start_sll_append_~head#1.base_15| (store (select |v_#memory_int_72| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0)))) (or (and (exists ((|v_#memory_int_71| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_20| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_20| (store |v_#memory_int_71| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_71| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_20| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (exists ((|v_#memory_$Pointer$.offset_61| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_65| (store |v_#memory_$Pointer$.offset_61| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0) (store (store (select |v_#memory_$Pointer$.offset_61| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_65| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0)) 0))))) (= |v_ULTIMATE.start_sll_append_#in~head#1.base_11| |v_ULTIMATE.start_sll_append_~head#1.base_15|) (exists ((|v_#memory_$Pointer$.base_64| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0) (store (store (select |v_#memory_$Pointer$.base_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0)) 0))) |v_#memory_$Pointer$.base_68|)) (= |v_ULTIMATE.start_sll_append_#in~head#1.base_11| |ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0))) (exists ((|v_#memory_int_68| (Array Int (Array Int Int))) (|v_#memory_int_26| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_26| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0) (store (select |v_#memory_int_26| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0)) 0 5)) |v_#memory_int_72|) (= |v_#memory_int_26| (store |v_#memory_int_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0) (store (select |v_#memory_int_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0)) 4 (select (select |v_#memory_int_26| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0)) 4)))))) (exists ((|v_#length_30| (Array Int Int))) (= (store |v_#length_30| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0) 8) |#length|)) (exists ((|v_#memory_$Pointer$.offset_64| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_64| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_64| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_67| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (store |v_#memory_$Pointer$.base_67| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_67| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#valid_40| (Array Int Int))) (and (= (store |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0) 1) |#valid|) (= (select |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0)) 0))) (<= (+ 1 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0)) |#StackHeapBarrier|)) (and (exists ((|v_#memory_$Pointer$.offset_61| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_65| (store |v_#memory_$Pointer$.offset_61| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0) (store (store (select |v_#memory_$Pointer$.offset_61| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_65| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0)) 0))))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_21| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_67| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_67| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_67| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_sll_create_#res#1.base|) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_21|) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (= |v_ULTIMATE.start_sll_append_#in~head#1.base_11| |v_ULTIMATE.start_sll_append_~head#1.base_15|) (exists ((|v_#memory_$Pointer$.base_64| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0) (store (store (select |v_#memory_$Pointer$.base_64| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0)) 0))) |v_#memory_$Pointer$.base_68|)) (= |v_ULTIMATE.start_sll_append_#in~head#1.base_11| |ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0))) (exists ((|v_#memory_int_68| (Array Int (Array Int Int))) (|v_#memory_int_26| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_26| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0) (store (select |v_#memory_int_26| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0)) 0 5)) |v_#memory_int_72|) (= |v_#memory_int_26| (store |v_#memory_int_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0) (store (select |v_#memory_int_68| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0)) 4 (select (select |v_#memory_int_26| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0)) 4)))))) (exists ((|v_#memory_int_71| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_21| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_21| (store |v_#memory_int_71| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_71| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_21| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (exists ((|v_#length_30| (Array Int Int))) (= (store |v_#length_30| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0) 8) |#length|)) (exists ((|v_#memory_$Pointer$.offset_64| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_64| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_64| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#valid_40| (Array Int Int))) (and (= (store |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0) 1) |#valid|) (= (select |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0)) 0))) (<= (+ 1 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_15|) 0)) |#StackHeapBarrier|))))) (= (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|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) 0))' at error location [2023-11-12 01:03:30,013 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 01:03:30,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 01:03:30,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2023-11-12 01:03:30,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027124708] [2023-11-12 01:03:30,014 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 01:03:30,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-12 01:03:30,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:03:30,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-12 01:03:30,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=896, Unknown=6, NotChecked=122, Total=1122 [2023-11-12 01:03:30,017 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 20 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 01:03:30,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:03:30,474 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2023-11-12 01:03:30,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 01:03:30,475 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24 [2023-11-12 01:03:30,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:03:30,476 INFO L225 Difference]: With dead ends: 37 [2023-11-12 01:03:30,476 INFO L226 Difference]: Without dead ends: 27 [2023-11-12 01:03:30,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=140, Invalid=1193, Unknown=7, NotChecked=142, Total=1482 [2023-11-12 01:03:30,478 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 01:03:30,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 198 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 183 Invalid, 0 Unknown, 32 Unchecked, 0.2s Time] [2023-11-12 01:03:30,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-12 01:03:30,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-12 01:03:30,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 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 01:03:30,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2023-11-12 01:03:30,485 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 24 [2023-11-12 01:03:30,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:03:30,485 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2023-11-12 01:03:30,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 01:03:30,486 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2023-11-12 01:03:30,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 01:03:30,487 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:03:30,487 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:03:30,493 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91eab82f-31c5-4782-b9fa-f6c5b7d95284/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 01:03:30,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91eab82f-31c5-4782-b9fa-f6c5b7d95284/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:03:30,693 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 01:03:30,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:03:30,694 INFO L85 PathProgramCache]: Analyzing trace with hash 975690952, now seen corresponding path program 1 times [2023-11-12 01:03:30,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:03:30,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305010308] [2023-11-12 01:03:30,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:03:30,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:03:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:03:32,075 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 01:03:32,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:03:32,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305010308] [2023-11-12 01:03:32,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305010308] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 01:03:32,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039566053] [2023-11-12 01:03:32,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:03:32,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:03:32,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91eab82f-31c5-4782-b9fa-f6c5b7d95284/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:03:32,078 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91eab82f-31c5-4782-b9fa-f6c5b7d95284/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 01:03:32,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91eab82f-31c5-4782-b9fa-f6c5b7d95284/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 01:03:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:03:32,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 97 conjunts are in the unsatisfiable core [2023-11-12 01:03:32,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 01:03:32,273 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 01:03:32,322 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-12 01:03:32,456 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-12 01:03:32,456 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 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-12 01:03:32,592 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 01:03:32,592 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 1 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 01:03:32,747 INFO L322 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-11-12 01:03:32,747 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2023-11-12 01:03:32,864 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-12 01:03:33,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:03:33,085 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:03:33,086 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 30 [2023-11-12 01:03:33,094 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-12 01:03:33,110 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 01:03:33,110 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2023-11-12 01:03:33,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:03:33,299 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 16 treesize of output 11 [2023-11-12 01:03:33,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:03:33,321 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-12 01:03:33,321 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 56 [2023-11-12 01:03:33,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:03:33,355 INFO L322 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2023-11-12 01:03:33,356 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2023-11-12 01:03:34,193 INFO L322 Elim1Store]: treesize reduction 64, result has 26.4 percent of original size [2023-11-12 01:03:34,194 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 125 [2023-11-12 01:03:34,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:03:34,260 INFO L322 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2023-11-12 01:03:34,261 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 95 treesize of output 53 [2023-11-12 01:03:34,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:03:34,435 INFO L322 Elim1Store]: treesize reduction 6, result has 76.0 percent of original size [2023-11-12 01:03:34,436 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 58 [2023-11-12 01:03:34,445 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-12 01:03:34,453 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 01:03:34,454 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 01:03:35,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039566053] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 01:03:35,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1631230221] [2023-11-12 01:03:35,493 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-12 01:03:35,493 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 01:03:35,493 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 01:03:35,493 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 01:03:35,494 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 01:03:37,293 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 139 for LOIs [2023-11-12 01:03:37,579 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 01:03:42,208 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0))) (and (= 5 |c_ULTIMATE.start_sll_append_~data#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| 5) (= |c_ULTIMATE.start_sll_append_#t~mem11#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0)) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#in~head#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| .cse2) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0) |c_ULTIMATE.start_sll_append_#t~mem11#1.base|) (<= 2 |c_ULTIMATE.start_main_~#s~0#1.base|) (or (not (= .cse2 0)) (not (= .cse1 0))) (<= 2 |c_ULTIMATE.start_sll_append_~head#1.base|) (let ((.cse3 (exists ((|v_#memory_$Pointer$.offset_76| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_76| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_76| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))))) (.cse4 (exists ((|v_#length_37| (Array Int Int))) (= (store |v_#length_37| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 8) |c_#length|))) (.cse5 (= |c_ULTIMATE.start_sll_append_#in~head#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse6 (= |c_ULTIMATE.start_sll_append_#in~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse7 (not (= |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 0))) (.cse8 (exists ((|v_#memory_$Pointer$.offset_79| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_79| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_79| |c_ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (.cse9 (exists ((|v_#valid_52| (Array Int Int))) (and (= (select |v_#valid_52| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= |c_#valid| (store |v_#valid_52| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 1))))) (.cse10 (exists ((|v_#memory_$Pointer$.base_80| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_80| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_80| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))))) (.cse11 (exists ((|v_#memory_int_85| (Array Int (Array Int Int))) (|v_#memory_int_26| (Array Int (Array Int Int)))) (let ((.cse13 (select |v_#memory_int_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|))) (and (= (store |v_#memory_int_26| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| (store .cse13 0 5)) |c_#memory_int|) (= |v_#memory_int_26| (store |v_#memory_int_85| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_85| |c_ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select .cse13 4)))))))) (.cse12 (<= (+ |c_ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |c_#StackHeapBarrier|))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (exists ((|v_#memory_int_88| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_32| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_32| (store |v_#memory_int_88| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_88| |c_ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_32| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))))) .cse9 .cse10 .cse11 (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_32| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_83| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_83| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_83| |c_ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_32|) (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) .cse12) (and .cse3 .cse4 .cse5 (exists ((|v_#memory_$Pointer$.base_83| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_31| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_83| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_83| |c_ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_31| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_31|) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_31| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) |c_ULTIMATE.start_sll_create_#res#1.base|))) .cse6 .cse7 .cse8 (exists ((|v_#memory_int_88| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_31| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_31| (store |v_#memory_int_88| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_88| |c_ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_31| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))))) .cse9 .cse10 .cse11 .cse12))) (= |c_ULTIMATE.start_main_~len~0#1| 2) (<= 2 |c_ULTIMATE.start_sll_append_#in~head#1.base|) (= 5 |c_ULTIMATE.start_sll_append_#in~data#1|))) is different from true [2023-11-12 01:03:52,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1631230221] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:03:52,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-12 01:03:52,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16, 22] total 50 [2023-11-12 01:03:52,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151082694] [2023-11-12 01:03:52,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:03:52,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-12 01:03:52,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:03:52,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-12 01:03:52,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=2863, Unknown=11, NotChecked=108, Total=3192 [2023-11-12 01:03:52,199 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 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 01:03:54,929 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]