./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-25 00:09:31,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-25 00:09:31,987 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-25 00:09:31,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-25 00:09:31,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-25 00:09:32,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-25 00:09:32,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-25 00:09:32,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-25 00:09:32,023 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-25 00:09:32,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-25 00:09:32,024 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-25 00:09:32,025 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-25 00:09:32,026 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-25 00:09:32,026 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-25 00:09:32,027 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-25 00:09:32,028 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-25 00:09:32,028 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-25 00:09:32,029 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-25 00:09:32,030 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-25 00:09:32,030 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-25 00:09:32,031 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-25 00:09:32,032 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-25 00:09:32,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-25 00:09:32,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-25 00:09:32,034 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-25 00:09:32,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-25 00:09:32,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-25 00:09:32,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-25 00:09:32,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-25 00:09:32,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-25 00:09:32,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-25 00:09:32,038 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-25 00:09:32,038 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-25 00:09:32,038 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-25 00:09:32,039 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-25 00:09:32,039 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-25 00:09:32,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-25 00:09:32,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:09:32,040 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-25 00:09:32,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-25 00:09:32,041 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-25 00:09:32,042 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-25 00:09:32,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-25 00:09:32,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-25 00:09:32,042 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-25 00:09:32,043 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-25 00:09:32,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-25 00:09:32,043 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_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91/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_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2023-11-25 00:09:32,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-25 00:09:32,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-25 00:09:32,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-25 00:09:32,356 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-25 00:09:32,357 INFO L274 PluginConnector]: CDTParser initialized [2023-11-25 00:09:32,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2023-11-25 00:09:35,514 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-25 00:09:35,856 INFO L384 CDTParser]: Found 1 translation units. [2023-11-25 00:09:35,858 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51fbaf4d-9c1e-4673-beff-e804900b10db/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2023-11-25 00:09:35,881 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91/data/682c31fa0/7837b5cae4084c7895f582bf52396865/FLAGfaba487a6 [2023-11-25 00:09:35,898 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91/data/682c31fa0/7837b5cae4084c7895f582bf52396865 [2023-11-25 00:09:35,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-25 00:09:35,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-25 00:09:35,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-25 00:09:35,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-25 00:09:35,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-25 00:09:35,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:09:35" (1/1) ... [2023-11-25 00:09:35,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56746989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:35, skipping insertion in model container [2023-11-25 00:09:35,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:09:35" (1/1) ... [2023-11-25 00:09:35,981 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-25 00:09:36,322 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_51fbaf4d-9c1e-4673-beff-e804900b10db/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2023-11-25 00:09:36,327 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:09:36,337 INFO L202 MainTranslator]: Completed pre-run [2023-11-25 00:09:36,385 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_51fbaf4d-9c1e-4673-beff-e804900b10db/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2023-11-25 00:09:36,386 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:09:36,420 INFO L206 MainTranslator]: Completed translation [2023-11-25 00:09:36,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:36 WrapperNode [2023-11-25 00:09:36,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-25 00:09:36,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-25 00:09:36,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-25 00:09:36,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-25 00:09:36,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:36" (1/1) ... [2023-11-25 00:09:36,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:36" (1/1) ... [2023-11-25 00:09:36,472 INFO L138 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 139 [2023-11-25 00:09:36,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-25 00:09:36,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-25 00:09:36,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-25 00:09:36,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-25 00:09:36,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:36" (1/1) ... [2023-11-25 00:09:36,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:36" (1/1) ... [2023-11-25 00:09:36,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:36" (1/1) ... [2023-11-25 00:09:36,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:36" (1/1) ... [2023-11-25 00:09:36,498 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:36" (1/1) ... [2023-11-25 00:09:36,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:36" (1/1) ... [2023-11-25 00:09:36,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:36" (1/1) ... [2023-11-25 00:09:36,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:36" (1/1) ... [2023-11-25 00:09:36,510 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-25 00:09:36,511 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-25 00:09:36,511 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-25 00:09:36,511 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-25 00:09:36,512 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:36" (1/1) ... [2023-11-25 00:09:36,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:09:36,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:09:36,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-25 00:09:36,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-25 00:09:36,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-25 00:09:36,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-25 00:09:36,609 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-25 00:09:36,610 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-25 00:09:36,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-25 00:09:36,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-25 00:09:36,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-25 00:09:36,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-25 00:09:36,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-25 00:09:36,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-25 00:09:36,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-25 00:09:36,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-25 00:09:36,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-25 00:09:36,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-25 00:09:36,753 INFO L241 CfgBuilder]: Building ICFG [2023-11-25 00:09:36,756 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-25 00:09:37,073 INFO L282 CfgBuilder]: Performing block encoding [2023-11-25 00:09:37,126 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-25 00:09:37,127 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-25 00:09:37,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:09:37 BoogieIcfgContainer [2023-11-25 00:09:37,129 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-25 00:09:37,132 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-25 00:09:37,132 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-25 00:09:37,136 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-25 00:09:37,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 12:09:35" (1/3) ... [2023-11-25 00:09:37,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3284840a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:09:37, skipping insertion in model container [2023-11-25 00:09:37,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:36" (2/3) ... [2023-11-25 00:09:37,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3284840a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:09:37, skipping insertion in model container [2023-11-25 00:09:37,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:09:37" (3/3) ... [2023-11-25 00:09:37,140 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2023-11-25 00:09:37,161 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-25 00:09:37,162 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-25 00:09:37,229 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-25 00:09:37,237 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;@5f317caf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-25 00:09:37,238 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-25 00:09:37,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-25 00:09:37,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-25 00:09:37,253 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:09:37,254 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:09:37,254 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:09:37,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:09:37,262 INFO L85 PathProgramCache]: Analyzing trace with hash 399683977, now seen corresponding path program 1 times [2023-11-25 00:09:37,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:09:37,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251199123] [2023-11-25 00:09:37,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:09:37,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:09:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:09:37,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-25 00:09:37,811 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:09:37,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251199123] [2023-11-25 00:09:37,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251199123] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:09:37,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:09:37,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-25 00:09:37,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068733264] [2023-11-25 00:09:37,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:09:37,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:09:37,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:09:37,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:09:37,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:09:37,865 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-25 00:09:37,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:09:37,921 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2023-11-25 00:09:37,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:09:37,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-11-25 00:09:37,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:09:37,931 INFO L225 Difference]: With dead ends: 53 [2023-11-25 00:09:37,931 INFO L226 Difference]: Without dead ends: 25 [2023-11-25 00:09:37,934 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-25 00:09:37,938 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-25 00:09:37,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-25 00:09:37,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-25 00:09:37,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-11-25 00:09:37,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-25 00:09:37,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-11-25 00:09:37,985 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 17 [2023-11-25 00:09:37,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:09:37,985 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-11-25 00:09:37,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-25 00:09:37,986 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-11-25 00:09:37,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-25 00:09:37,988 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:09:37,988 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:09:37,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-25 00:09:37,989 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:09:37,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:09:37,990 INFO L85 PathProgramCache]: Analyzing trace with hash -953160270, now seen corresponding path program 1 times [2023-11-25 00:09:37,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:09:37,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162164740] [2023-11-25 00:09:37,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:09:37,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:09:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:09:38,738 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:09:38,739 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:09:38,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162164740] [2023-11-25 00:09:38,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162164740] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:09:38,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035450162] [2023-11-25 00:09:38,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:09:38,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:09:38,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:09:38,747 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:09:38,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-25 00:09:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:09:38,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-25 00:09:39,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:09:39,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-25 00:09:39,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:39,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-25 00:09:39,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-25 00:09:39,439 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:09:39,439 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:09:39,523 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| Int) (v_ArrVal_172 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_172) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| 1)))) is different from false [2023-11-25 00:09:39,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035450162] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:09:39,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [43938177] [2023-11-25 00:09:39,547 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-25 00:09:39,547 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:09:39,551 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:09:39,556 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:09:39,557 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:09:41,617 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-25 00:09:41,633 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-25 00:09:52,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [43938177] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:09:52,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-25 00:09:52,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [13, 13] total 34 [2023-11-25 00:09:52,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419064645] [2023-11-25 00:09:52,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:09:52,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-25 00:09:52,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:09:52,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-25 00:09:52,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1082, Unknown=8, NotChecked=66, Total=1260 [2023-11-25 00:09:52,877 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-25 00:09:55,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-25 00:09:58,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-25 00:09:59,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:09:59,773 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2023-11-25 00:09:59,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-25 00:09:59,774 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 23 [2023-11-25 00:09:59,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:09:59,775 INFO L225 Difference]: With dead ends: 28 [2023-11-25 00:09:59,775 INFO L226 Difference]: Without dead ends: 26 [2023-11-25 00:09:59,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=104, Invalid=1082, Unknown=8, NotChecked=66, Total=1260 [2023-11-25 00:09:59,777 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2023-11-25 00:09:59,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 3 Unknown, 0 Unchecked, 6.9s Time] [2023-11-25 00:09:59,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-25 00:09:59,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-25 00:09:59,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-25 00:09:59,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2023-11-25 00:09:59,788 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 23 [2023-11-25 00:09:59,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:09:59,788 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-11-25 00:09:59,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-25 00:09:59,789 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2023-11-25 00:09:59,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-25 00:09:59,790 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:09:59,790 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:09:59,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-25 00:09:59,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:09:59,998 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:09:59,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:09:59,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1157107414, now seen corresponding path program 1 times [2023-11-25 00:09:59,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:09:59,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363744408] [2023-11-25 00:09:59,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:10:00,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:10:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:10:00,511 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:10:00,511 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:10:00,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363744408] [2023-11-25 00:10:00,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363744408] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:10:00,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871359159] [2023-11-25 00:10:00,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:10:00,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:10:00,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:10:00,513 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:10:00,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-25 00:10:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:10:00,676 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-25 00:10:00,680 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:10:00,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-25 00:10:00,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:10:00,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-25 00:10:00,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-25 00:10:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:10:00,918 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:10:01,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871359159] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:10:01,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [342628367] [2023-11-25 00:10:01,041 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-11-25 00:10:01,042 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:10:01,042 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:10:01,042 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:10:01,042 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:10:02,970 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-25 00:10:02,982 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-25 00:10:05,952 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~data#1| 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= 2 |c_ULTIMATE.start_sll_circular_create_#in~len#1|) (let ((.cse1 (exists ((|v_#length_27| (Array Int Int))) (and (= (select |v_#length_27| 2) 21) (= (select |v_#length_27| 1) 2)))) (.cse2 (<= (+ |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| 1) |c_#StackHeapBarrier|)) (.cse3 (exists ((|v_#length_28| (Array Int Int))) (= |c_#length| (store |v_#length_28| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| 8)))) (.cse4 (exists ((|v_#memory_int_39| (Array Int (Array Int Int))) (|v_#memory_int_82| (Array Int (Array Int Int)))) (let ((.cse12 (select |v_#memory_int_39| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|))) (and (= |c_#memory_int| (store |v_#memory_int_39| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| (store .cse12 4 1))) (= |v_#memory_int_39| (store |v_#memory_int_82| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| (store (select |v_#memory_int_82| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0 (select .cse12 0)))))))) (.cse5 (not (= |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| 0))) (.cse6 (exists ((|v_#valid_40| (Array Int Int))) (and (= (select |v_#valid_40| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (store |v_#valid_40| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| 1))))) (.cse7 (exists ((|v_#memory_$Pointer$.offset_65| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_65| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| (store (store (select |v_#memory_$Pointer$.offset_65| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0 0) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 4)))))) (.cse8 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse9 (exists ((|v_#valid_39| (Array Int Int))) (and (= (select |v_#valid_39| 0) 0) (= (select |v_#valid_39| 2) 1) (= (select |v_#valid_39| 1) 1) (= (select |v_#valid_39| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (.cse10 (exists ((|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_71| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| (store (store (select |v_#memory_$Pointer$.base_71| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0 0) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 4))) |c_#memory_$Pointer$.base|)))) (or (and (exists ((|v_#memory_int_BEFORE_CALL_27| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_#memory_int_BEFORE_CALL_27| 1))) (and (= (select .cse0 1) 0) (= (select .cse0 0) 48)))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 (exists ((|v_#memory_int_BEFORE_CALL_25| (Array Int (Array Int Int)))) (let ((.cse11 (select |v_#memory_int_BEFORE_CALL_25| 1))) (and (= (select .cse11 1) 0) (= 48 (select .cse11 0))))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (= |c_ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~len#1| 2) (= |c_ULTIMATE.start_main_~len~0#1| 2)) is different from true [2023-11-25 00:10:07,263 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#in~data#1| 1) (= 1 |c_ULTIMATE.start_sll_circular_append_~data#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |c_ULTIMATE.start_sll_circular_append_#t~mem10#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |c_ULTIMATE.start_sll_circular_append_#t~mem10#1.offset|) (<= 2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse2 (exists ((|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_71| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_71| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4)))))) (.cse3 (exists ((|v_#length_28| (Array Int Int))) (= (store |v_#length_28| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8) |c_#length|))) (.cse4 (exists ((|v_#memory_int_39| (Array Int (Array Int Int))) (|v_#memory_int_82| (Array Int (Array Int Int)))) (let ((.cse9 (select |v_#memory_int_39| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|))) (and (= (store |v_#memory_int_82| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_82| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select .cse9 0))) |v_#memory_int_39|) (= (store |v_#memory_int_39| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store .cse9 4 1)) |c_#memory_int|))))) (.cse5 (exists ((|v_#valid_40| (Array Int Int))) (and (= (select |v_#valid_40| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |c_#valid| (store |v_#valid_40| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1))))) (.cse6 (exists ((|v_#memory_$Pointer$.offset_65| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_65| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_65| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4)))))) (.cse7 (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0))) (.cse8 (<= (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |c_#StackHeapBarrier|))) (or (and .cse0 .cse1 (exists ((|v_#memory_$Pointer$.base_74| (Array Int (Array Int Int))) (|v_#memory_int_85| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_42| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (and (= 0 (select (select (store |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0)) |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (store |v_#memory_int_85| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_85| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 (select (select |v_#memory_int_BEFORE_CALL_42| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0))) |v_#memory_int_BEFORE_CALL_42|) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_74| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_74| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (exists ((|v_old(#memory_int)_AFTER_CALL_26| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_74| (Array Int (Array Int Int))) (|v_#memory_int_85| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (and (= 0 (select (select (store |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0)) |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |v_old(#memory_int)_AFTER_CALL_26| (store |v_#memory_int_85| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_85| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_26| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0)))) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_74| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_74| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) .cse7 .cse8))) (<= 2 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 2 |c_ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |c_ULTIMATE.start_main_~len~0#1| 2)) is different from true [2023-11-25 00:10:16,610 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '450#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~count~0#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (exists ((|v_#memory_$Pointer$.base_75| (Array Int (Array Int Int))) (|v_#memory_int_86| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_append_#in~head#1.base_10| Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_16| Int) (|v_#memory_int_15| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_69| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_15| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16| (store (select |v_#memory_int_15| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)))) (= |v_#memory_int_15| (store |v_#memory_int_86| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_int_86| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 (select (select |v_#memory_int_15| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0)))) (= 0 (select (select |v_#memory_$Pointer$.base_75| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) (= (store (store |v_#memory_$Pointer$.base_75| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.base_75| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0))) |v_ULTIMATE.start_sll_circular_append_~head#1.base_16| (store (select (store |v_#memory_$Pointer$.base_75| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.base_75| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0))) |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0))) |#memory_$Pointer$.base|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_69| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.offset_69| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 0)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_16| (store (select (store |v_#memory_$Pointer$.offset_69| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_$Pointer$.offset_69| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 0)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0 0))) (or (and (exists ((|v_#memory_int_39| (Array Int (Array Int Int))) (|v_#memory_int_82| (Array Int (Array Int Int)))) (and (= |v_#memory_int_39| (store |v_#memory_int_82| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_int_82| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 (select (select |v_#memory_int_39| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0)))) (= |v_#memory_int_86| (store |v_#memory_int_39| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_int_39| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 4 1))))) (exists ((|v_#valid_40| (Array Int Int))) (and (= (select |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0) (= (store |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 1) |#valid|))) (exists ((|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_71| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (store (select |v_#memory_$Pointer$.base_71| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.base_75| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 4))) |v_#memory_$Pointer$.base_75|)) (exists ((|v_#memory_$Pointer$.offset_65| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_65| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (store (select |v_#memory_$Pointer$.offset_65| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_69| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 4))) |v_#memory_$Pointer$.offset_69|)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 0)) (exists ((|v_old(#memory_int)_AFTER_CALL_26| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_74| (Array Int (Array Int Int))) (|v_#memory_int_85| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (and (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_74| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_74| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |v_old(#memory_int)_AFTER_CALL_26| (store |v_#memory_int_85| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_85| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_26| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0)))) (= (select (select (store |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (= |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_10| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_16| |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_10|) (exists ((|v_#length_28| (Array Int Int))) (= |#length| (store |v_#length_28| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 8)))) (and (exists ((|v_#memory_int_39| (Array Int (Array Int Int))) (|v_#memory_int_82| (Array Int (Array Int Int)))) (and (= |v_#memory_int_39| (store |v_#memory_int_82| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_int_82| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 (select (select |v_#memory_int_39| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0)))) (= |v_#memory_int_86| (store |v_#memory_int_39| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (select |v_#memory_int_39| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 4 1))))) (exists ((|v_#valid_40| (Array Int Int))) (and (= (select |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0) (= (store |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 1) |#valid|))) (exists ((|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_71| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (store (select |v_#memory_$Pointer$.base_71| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.base_75| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 4))) |v_#memory_$Pointer$.base_75|)) (exists ((|v_#memory_$Pointer$.offset_65| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_65| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) (store (store (select |v_#memory_$Pointer$.offset_65| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_69| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0)) 4))) |v_#memory_$Pointer$.offset_69|)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 0)) (= |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_10| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_74| (Array Int (Array Int Int))) (|v_#memory_int_85| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_42| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int)) (and (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_74| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_74| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (store |v_#memory_int_85| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_85| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 (select (select |v_#memory_int_BEFORE_CALL_42| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0))) |v_#memory_int_BEFORE_CALL_42|) (= (select (select (store |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_68| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_16| |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_10|) (exists ((|v_#length_28| (Array Int Int))) (= |#length| (store |v_#length_28| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 8))))) (= (select (select |v_#memory_$Pointer$.offset_69| |v_ULTIMATE.start_sll_circular_append_~head#1.base_16|) 0) 0))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-25 00:10:16,610 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-25 00:10:16,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-25 00:10:16,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2023-11-25 00:10:16,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920935969] [2023-11-25 00:10:16,611 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-25 00:10:16,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-25 00:10:16,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:10:16,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-25 00:10:16,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1151, Unknown=9, NotChecked=138, Total=1406 [2023-11-25 00:10:16,614 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-25 00:10:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:10:17,220 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2023-11-25 00:10:17,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-25 00:10:17,221 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 25 [2023-11-25 00:10:17,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:10:17,222 INFO L225 Difference]: With dead ends: 34 [2023-11-25 00:10:17,223 INFO L226 Difference]: Without dead ends: 25 [2023-11-25 00:10:17,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=160, Invalid=1560, Unknown=10, NotChecked=162, Total=1892 [2023-11-25 00:10:17,226 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:10:17,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 177 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:10:17,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-25 00:10:17,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-11-25 00:10:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-25 00:10:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2023-11-25 00:10:17,235 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 25 [2023-11-25 00:10:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:10:17,235 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-11-25 00:10:17,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-25 00:10:17,236 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2023-11-25 00:10:17,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-25 00:10:17,237 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:10:17,237 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:10:17,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-25 00:10:17,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:10:17,444 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:10:17,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:10:17,445 INFO L85 PathProgramCache]: Analyzing trace with hash 391020969, now seen corresponding path program 1 times [2023-11-25 00:10:17,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:10:17,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169104682] [2023-11-25 00:10:17,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:10:17,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:10:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:10:18,634 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:10:18,635 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:10:18,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169104682] [2023-11-25 00:10:18,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169104682] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:10:18,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560119805] [2023-11-25 00:10:18,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:10:18,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:10:18,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:10:18,636 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:10:18,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_51fbaf4d-9c1e-4673-beff-e804900b10db/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-25 00:10:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:10:18,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 92 conjunts are in the unsatisfiable core [2023-11-25 00:10:18,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:10:18,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-25 00:10:19,187 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-25 00:10:19,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-25 00:10:19,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-25 00:10:19,393 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-25 00:10:19,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 41 [2023-11-25 00:10:19,490 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-25 00:10:19,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 23 [2023-11-25 00:10:19,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-25 00:10:19,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-25 00:10:26,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:10:26,273 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-25 00:10:26,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 45 [2023-11-25 00:10:26,370 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-25 00:10:26,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-25 00:10:26,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:10:26,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-25 00:10:28,639 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:10:28,639 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:10:29,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560119805] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:10:29,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1711257672] [2023-11-25 00:10:29,567 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-11-25 00:10:29,567 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:10:29,568 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:10:29,568 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:10:29,569 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:10:31,094 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-25 00:10:31,110 INFO L180 IcfgInterpreter]: Interpretation finished