./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff 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_552a1543-bc95-436c-b3c2-78b38d11dcbd/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_552a1543-bc95-436c-b3c2-78b38d11dcbd/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_552a1543-bc95-436c-b3c2-78b38d11dcbd/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_552a1543-bc95-436c-b3c2-78b38d11dcbd/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_552a1543-bc95-436c-b3c2-78b38d11dcbd/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_552a1543-bc95-436c-b3c2-78b38d11dcbd/bin/utaipan-verify-t7M7D8N6sZ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a0a808cbaf75e35690b91e29e30a5a3e0888859a17f932e1ee324e5b23ddf983 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 04:17:09,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 04:17:09,739 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_552a1543-bc95-436c-b3c2-78b38d11dcbd/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-19 04:17:09,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 04:17:09,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 04:17:09,769 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 04:17:09,770 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 04:17:09,771 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 04:17:09,771 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 04:17:09,772 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 04:17:09,772 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 04:17:09,773 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 04:17:09,774 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 04:17:09,774 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 04:17:09,775 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 04:17:09,775 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 04:17:09,776 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 04:17:09,776 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 04:17:09,777 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 04:17:09,777 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 04:17:09,778 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 04:17:09,779 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 04:17:09,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 04:17:09,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 04:17:09,780 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 04:17:09,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 04:17:09,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 04:17:09,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 04:17:09,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 04:17:09,783 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 04:17:09,783 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 04:17:09,784 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 04:17:09,784 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 04:17:09,784 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 04:17:09,785 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 04:17:09,785 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 04:17:09,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:17:09,786 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 04:17:09,787 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 04:17:09,787 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 04:17:09,788 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 04:17:09,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 04:17:09,789 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 04:17:09,789 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 04:17:09,790 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 04:17:09,790 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_552a1543-bc95-436c-b3c2-78b38d11dcbd/bin/utaipan-verify-t7M7D8N6sZ/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_552a1543-bc95-436c-b3c2-78b38d11dcbd/bin/utaipan-verify-t7M7D8N6sZ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a0a808cbaf75e35690b91e29e30a5a3e0888859a17f932e1ee324e5b23ddf983 [2023-11-19 04:17:10,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 04:17:10,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 04:17:10,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 04:17:10,088 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 04:17:10,089 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 04:17:10,092 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_552a1543-bc95-436c-b3c2-78b38d11dcbd/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i [2023-11-19 04:17:13,127 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 04:17:13,438 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 04:17:13,440 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_552a1543-bc95-436c-b3c2-78b38d11dcbd/sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i [2023-11-19 04:17:13,465 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_552a1543-bc95-436c-b3c2-78b38d11dcbd/bin/utaipan-verify-t7M7D8N6sZ/data/010c479ec/fe3d511ded5e4b7fb83e167d5fba46a1/FLAG65e15ee01 [2023-11-19 04:17:13,480 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_552a1543-bc95-436c-b3c2-78b38d11dcbd/bin/utaipan-verify-t7M7D8N6sZ/data/010c479ec/fe3d511ded5e4b7fb83e167d5fba46a1 [2023-11-19 04:17:13,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 04:17:13,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 04:17:13,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 04:17:13,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 04:17:13,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 04:17:13,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:17:13" (1/1) ... [2023-11-19 04:17:13,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@695b9b02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:17:13, skipping insertion in model container [2023-11-19 04:17:13,498 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:17:13" (1/1) ... [2023-11-19 04:17:13,539 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 04:17:13,916 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_552a1543-bc95-436c-b3c2-78b38d11dcbd/sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i[24450,24463] [2023-11-19 04:17:13,924 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:17:13,937 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 04:17:13,999 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_552a1543-bc95-436c-b3c2-78b38d11dcbd/sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i[24450,24463] [2023-11-19 04:17:14,002 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:17:14,041 INFO L206 MainTranslator]: Completed translation [2023-11-19 04:17:14,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:17:14 WrapperNode [2023-11-19 04:17:14,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 04:17:14,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 04:17:14,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 04:17:14,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 04:17:14,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:17:14" (1/1) ... [2023-11-19 04:17:14,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:17:14" (1/1) ... [2023-11-19 04:17:14,117 INFO L138 Inliner]: procedures = 127, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 125 [2023-11-19 04:17:14,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 04:17:14,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 04:17:14,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 04:17:14,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 04:17:14,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:17:14" (1/1) ... [2023-11-19 04:17:14,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:17:14" (1/1) ... [2023-11-19 04:17:14,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:17:14" (1/1) ... [2023-11-19 04:17:14,148 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:17:14" (1/1) ... [2023-11-19 04:17:14,156 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:17:14" (1/1) ... [2023-11-19 04:17:14,174 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:17:14" (1/1) ... [2023-11-19 04:17:14,178 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:17:14" (1/1) ... [2023-11-19 04:17:14,179 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:17:14" (1/1) ... [2023-11-19 04:17:14,192 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 04:17:14,193 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 04:17:14,193 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 04:17:14,193 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 04:17:14,194 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:17:14" (1/1) ... [2023-11-19 04:17:14,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:17:14,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_552a1543-bc95-436c-b3c2-78b38d11dcbd/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:17:14,236 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_552a1543-bc95-436c-b3c2-78b38d11dcbd/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 04:17:14,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_552a1543-bc95-436c-b3c2-78b38d11dcbd/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 04:17:14,291 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-19 04:17:14,292 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-19 04:17:14,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 04:17:14,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 04:17:14,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 04:17:14,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 04:17:14,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 04:17:14,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 04:17:14,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 04:17:14,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 04:17:14,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 04:17:14,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 04:17:14,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 04:17:14,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 04:17:14,453 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 04:17:14,456 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 04:17:14,497 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-19 04:17:14,688 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 04:17:14,809 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 04:17:14,809 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-19 04:17:14,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:17:14 BoogieIcfgContainer [2023-11-19 04:17:14,825 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 04:17:14,828 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 04:17:14,828 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 04:17:14,831 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 04:17:14,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:17:13" (1/3) ... [2023-11-19 04:17:14,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e1579e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:17:14, skipping insertion in model container [2023-11-19 04:17:14,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:17:14" (2/3) ... [2023-11-19 04:17:14,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e1579e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:17:14, skipping insertion in model container [2023-11-19 04:17:14,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:17:14" (3/3) ... [2023-11-19 04:17:14,834 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_unequal.i [2023-11-19 04:17:14,854 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 04:17:14,854 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 04:17:14,910 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:17:14,917 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;@7dccee31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:17:14,917 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 04:17:14,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 15 states have (on average 1.6) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:17:14,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-19 04:17:14,930 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:17:14,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 04:17:14,931 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:17:14,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:17:14,936 INFO L85 PathProgramCache]: Analyzing trace with hash -181130984, now seen corresponding path program 1 times [2023-11-19 04:17:14,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:17:14,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602005577] [2023-11-19 04:17:14,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:17:14,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:17:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:17:15,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:17:15,448 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:17:15,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602005577] [2023-11-19 04:17:15,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602005577] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:17:15,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:17:15,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:17:15,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475521694] [2023-11-19 04:17:15,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:17:15,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:17:15,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:17:15,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:17:15,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:17:15,507 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.6) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:17:15,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:17:15,621 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2023-11-19 04:17:15,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:17:15,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-19 04:17:15,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:17:15,629 INFO L225 Difference]: With dead ends: 37 [2023-11-19 04:17:15,630 INFO L226 Difference]: Without dead ends: 15 [2023-11-19 04:17:15,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:17:15,638 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 34 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.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:17:15,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 34 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:17:15,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-11-19 04:17:15,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2023-11-19 04:17:15,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:17:15,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2023-11-19 04:17:15,672 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 6 [2023-11-19 04:17:15,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:17:15,673 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2023-11-19 04:17:15,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:17:15,673 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2023-11-19 04:17:15,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 04:17:15,674 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:17:15,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:17:15,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 04:17:15,674 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:17:15,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:17:15,675 INFO L85 PathProgramCache]: Analyzing trace with hash -171603972, now seen corresponding path program 1 times [2023-11-19 04:17:15,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:17:15,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751452247] [2023-11-19 04:17:15,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:17:15,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:17:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:17:15,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:17:15,897 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:17:15,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751452247] [2023-11-19 04:17:15,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751452247] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:17:15,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880031257] [2023-11-19 04:17:15,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:17:15,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:17:15,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_552a1543-bc95-436c-b3c2-78b38d11dcbd/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:17:15,900 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_552a1543-bc95-436c-b3c2-78b38d11dcbd/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:17:15,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_552a1543-bc95-436c-b3c2-78b38d11dcbd/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 04:17:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:17:16,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 04:17:16,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:17:16,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:17:16,204 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:17:16,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:17:16,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880031257] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:17:16,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [886890277] [2023-11-19 04:17:16,241 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2023-11-19 04:17:16,241 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:17:16,245 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:17:16,250 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:17:16,250 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:17:17,735 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:17:21,456 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '142#(and (<= (+ |ULTIMATE.start_node_create_#res#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (exists ((|v_#valid_36| (Array Int Int))) (and (= |#valid| (store |v_#valid_36| |ULTIMATE.start_node_create_#res#1.base| 1)) (= (select |v_#valid_36| |ULTIMATE.start_node_create_#res#1.base|) 0))) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (not (= 5 (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|))) (= |ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#length_26| (Array Int Int))) (= |#length| (store |v_#length_26| |ULTIMATE.start_node_create_#res#1.base| 12))) (exists ((|v_#memory_int_52| (Array Int (Array Int Int))) (|v_#memory_int_53| (Array Int (Array Int Int))) (|v_#memory_int_54| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| Int) (|v_#memory_$Pointer$.base_49| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_79| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_16| Int) (|v_#memory_$Pointer$.base_47| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_79| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.base_16| Int) (|v_#memory_$Pointer$.offset_47| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_prepend_#t~mem10#1.base_25| Int) (|v_#memory_$Pointer$.offset_49| (Array Int (Array Int Int))) (|v_#memory_int_50| (Array Int (Array Int Int))) (|v_#memory_int_94| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_49| (store |v_#memory_$Pointer$.offset_79| |ULTIMATE.start_node_create_#res#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_79| |ULTIMATE.start_node_create_#res#1.base|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base|) 0)))) (= (store |v_#memory_int_54| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_int_54| |ULTIMATE.start_node_create_#res#1.base|) 8 (select (select |v_#memory_int_53| |ULTIMATE.start_node_create_#res#1.base|) 8))) |v_#memory_int_53|) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_#memory_$Pointer$.base_79| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |v_#memory_int_54| (store |v_#memory_int_94| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_int_94| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_int_54| |ULTIMATE.start_node_create_#res#1.base|) 4)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_main_~#s~0#1.base| (store (select |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_main_~#s~0#1.base|) 0 0))) (= |v_#memory_int_52| (store |v_#memory_int_53| |ULTIMATE.start_node_create_#res#1.base| (store (store (select |v_#memory_int_53| |ULTIMATE.start_node_create_#res#1.base|) 0 5) 4 (select (select |v_#memory_int_52| |ULTIMATE.start_node_create_#res#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_50| |ULTIMATE.start_main_~#s~0#1.base| (store (select |v_#memory_int_50| |ULTIMATE.start_main_~#s~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= (select (select |v_#memory_$Pointer$.offset_79| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_47| |ULTIMATE.start_main_~#s~0#1.base| (store (select |v_#memory_$Pointer$.base_47| |ULTIMATE.start_main_~#s~0#1.base|) 0 |ULTIMATE.start_node_create_#res#1.base|))) (or (and (= (store (store |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select (store |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select (store |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select (store |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 8) 0)) |v_#memory_$Pointer$.offset_47|) (= (store (store |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select (store |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select (store |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (select (select (store |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select (store |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 8) |ULTIMATE.start_node_create_#res#1.base|)) |v_#memory_$Pointer$.base_47|) (or (not (= (select (select (store |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (not (= (select (select (store |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (= |v_#memory_int_50| (store |v_#memory_int_52| (select (select (store |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_52| (select (select (store |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select (store |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 8) (select (select |v_#memory_int_50| (select (select (store |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (+ (select (select (store |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 8)))))) (and (= |v_#memory_int_50| |v_#memory_int_52|) (= (select (select (store |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select (store |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_25| |v_ULTIMATE.start_dll_prepend_#t~mem10#1.offset_16|) (= |v_#memory_$Pointer$.base_47| (store |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= |v_ULTIMATE.start_dll_prepend_#t~mem10#1.base_25| |v_ULTIMATE.start_dll_prepend_#t~mem10#1.base_16|) (= (store |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_node_create_#res#1.base|) 4 (select (select |v_#memory_$Pointer$.offset_49| |ULTIMATE.start_main_~#s~0#1.base|) 0))) |v_#memory_$Pointer$.offset_47|))) (= (store |v_#memory_$Pointer$.base_79| |ULTIMATE.start_node_create_#res#1.base| (store (store (store (select |v_#memory_$Pointer$.base_79| |ULTIMATE.start_node_create_#res#1.base|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_49| |ULTIMATE.start_node_create_#res#1.base|) 0))) |v_#memory_$Pointer$.base_49|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-19 04:17:21,457 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:17:21,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:17:21,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-11-19 04:17:21,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822661194] [2023-11-19 04:17:21,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:17:21,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:17:21,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:17:21,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:17:21,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:17:21,461 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:17:21,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:17:21,568 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2023-11-19 04:17:21,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:17:21,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-19 04:17:21,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:17:21,569 INFO L225 Difference]: With dead ends: 24 [2023-11-19 04:17:21,569 INFO L226 Difference]: Without dead ends: 16 [2023-11-19 04:17:21,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:17:21,571 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:17:21,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 18 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:17:21,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-11-19 04:17:21,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-11-19 04:17:21,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:17:21,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2023-11-19 04:17:21,576 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 9 [2023-11-19 04:17:21,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:17:21,576 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-11-19 04:17:21,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:17:21,577 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2023-11-19 04:17:21,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 04:17:21,577 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:17:21,578 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-19 04:17:21,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_552a1543-bc95-436c-b3c2-78b38d11dcbd/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 04:17:21,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_552a1543-bc95-436c-b3c2-78b38d11dcbd/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:17:21,778 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:17:21,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:17:21,779 INFO L85 PathProgramCache]: Analyzing trace with hash 179768984, now seen corresponding path program 2 times [2023-11-19 04:17:21,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:17:21,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731243313] [2023-11-19 04:17:21,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:17:21,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:17:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:17:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 04:17:23,080 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:17:23,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731243313] [2023-11-19 04:17:23,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731243313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:17:23,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:17:23,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 04:17:23,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644865816] [2023-11-19 04:17:23,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:17:23,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:17:23,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:17:23,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:17:23,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:17:23,088 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:17:23,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:17:23,344 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2023-11-19 04:17:23,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 04:17:23,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-19 04:17:23,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:17:23,346 INFO L225 Difference]: With dead ends: 18 [2023-11-19 04:17:23,346 INFO L226 Difference]: Without dead ends: 16 [2023-11-19 04:17:23,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-19 04:17:23,351 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 11 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:17:23,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 24 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:17:23,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-11-19 04:17:23,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-11-19 04:17:23,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:17:23,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2023-11-19 04:17:23,356 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2023-11-19 04:17:23,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:17:23,356 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2023-11-19 04:17:23,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:17:23,357 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2023-11-19 04:17:23,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 04:17:23,357 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:17:23,357 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:17:23,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 04:17:23,358 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:17:23,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:17:23,358 INFO L85 PathProgramCache]: Analyzing trace with hash 959379351, now seen corresponding path program 1 times [2023-11-19 04:17:23,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:17:23,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797690722] [2023-11-19 04:17:23,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:17:23,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:17:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:17:24,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 04:17:24,466 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:17:24,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797690722] [2023-11-19 04:17:24,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797690722] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:17:24,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:17:24,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 04:17:24,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921259200] [2023-11-19 04:17:24,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:17:24,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 04:17:24,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:17:24,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 04:17:24,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-19 04:17:24,476 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:17:24,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:17:24,793 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2023-11-19 04:17:24,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 04:17:24,793 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-19 04:17:24,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:17:24,794 INFO L225 Difference]: With dead ends: 23 [2023-11-19 04:17:24,794 INFO L226 Difference]: Without dead ends: 20 [2023-11-19 04:17:24,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-19 04:17:24,796 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 18 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 04:17:24,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 22 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 04:17:24,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-19 04:17:24,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2023-11-19 04:17:24,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:17:24,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2023-11-19 04:17:24,800 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2023-11-19 04:17:24,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:17:24,800 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2023-11-19 04:17:24,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:17:24,801 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2023-11-19 04:17:24,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 04:17:24,801 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:17:24,802 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:17:24,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 04:17:24,802 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:17:24,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:17:24,803 INFO L85 PathProgramCache]: Analyzing trace with hash 959336819, now seen corresponding path program 1 times [2023-11-19 04:17:24,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:17:24,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159888035] [2023-11-19 04:17:24,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:17:24,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:17:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:17:26,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:17:26,472 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:17:26,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159888035] [2023-11-19 04:17:26,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159888035] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:17:26,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103427678] [2023-11-19 04:17:26,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:17:26,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:17:26,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_552a1543-bc95-436c-b3c2-78b38d11dcbd/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:17:26,475 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_552a1543-bc95-436c-b3c2-78b38d11dcbd/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:17:26,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_552a1543-bc95-436c-b3c2-78b38d11dcbd/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 04:17:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:17:26,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 100 conjunts are in the unsatisfiable core [2023-11-19 04:17:26,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:17:26,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 04:17:26,794 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-19 04:17:26,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-19 04:17:26,940 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-11-19 04:17:26,940 INFO L378 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-19 04:17:27,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2023-11-19 04:17:27,107 INFO L378 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 13 treesize of output 1 [2023-11-19 04:17:27,114 INFO L378 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 13 treesize of output 1 [2023-11-19 04:17:27,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 04:17:27,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:17:27,316 INFO L349 Elim1Store]: treesize reduction 16, result has 44.8 percent of original size [2023-11-19 04:17:27,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 25 [2023-11-19 04:17:27,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:17:27,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:17:27,565 INFO L349 Elim1Store]: treesize reduction 46, result has 30.3 percent of original size [2023-11-19 04:17:27,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 330 treesize of output 345 [2023-11-19 04:17:27,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:17:27,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:17:27,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 60 [2023-11-19 04:17:27,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:17:27,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:17:27,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:17:27,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 75 [2023-11-19 04:17:27,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2023-11-19 04:17:27,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:17:27,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 85 [2023-11-19 04:17:27,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 34 [2023-11-19 04:17:27,690 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 18 treesize of output 17 [2023-11-19 04:17:27,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2023-11-19 04:17:27,903 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 04:17:27,904 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 1403 treesize of output 1050 [2023-11-19 04:17:27,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:17:27,934 INFO L378 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 0 case distinctions, treesize of input 63 treesize of output 44 [2023-11-19 04:17:27,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2023-11-19 04:17:27,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 130 treesize of output 120 [2023-11-19 04:17:27,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 116 treesize of output 106 [2023-11-19 04:17:28,000 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-19 04:17:28,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2023-11-19 04:17:28,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2023-11-19 04:17:28,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:17:28,129 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:17:30,502 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_6 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_499 (Array Int Int))) (let ((.cse11 (+ v_ArrVal_507 4))) (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_504 .cse11 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_504) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse0 (select (select .cse10 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (or (= .cse0 0) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_499 .cse11 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse6 (let ((.cse9 (store .cse10 .cse2 v_DerPreprocessor_7))) (store .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| v_ArrVal_507)))) (.cse3 (let ((.cse7 (store .cse8 .cse2 v_DerPreprocessor_6))) (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ 4 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_501))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ .cse0 8) v_DerPreprocessor_8))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_513) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))))))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_499 (Array Int Int))) (let ((.cse22 (+ v_ArrVal_507 4))) (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_499 .cse22 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse13 (select (select .cse20 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_504 .cse22 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_504) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse18 (let ((.cse21 (store .cse14 .cse13 v_DerPreprocessor_10))) (store .cse21 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse21 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| v_ArrVal_507)))) (.cse15 (let ((.cse19 (store .cse20 .cse13 v_DerPreprocessor_9))) (store .cse19 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse19 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse17 (+ (select (select .cse18 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_501))) (store .cse12 .cse13 (store (select .cse12 .cse13) (+ (select (select .cse14 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8) v_DerPreprocessor_11))) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_513) (select (select .cse15 .cse16) .cse17)) (select (select .cse18 .cse16) .cse17)))))) (= .cse13 0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (v_ArrVal_507 Int) (v_ArrVal_499 (Array Int Int))) (let ((.cse31 (+ v_ArrVal_507 4))) (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_499 .cse31 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)))) (.cse30 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_504 .cse31 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_504) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse23 (select .cse30 |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse29 (select .cse28 |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (or (not (= (select .cse23 |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse27 (store .cse30 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse23 |c_ULTIMATE.start_dll_prepend_~head#1.offset| v_ArrVal_507))) (.cse24 (store .cse28 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse29 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|)))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse26 (+ 4 (select (select .cse27 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_dll_prepend_~head#1.base| v_ArrVal_513) (select (select .cse24 .cse25) .cse26)) (select (select .cse27 .cse25) .cse26))))) (not (= (select .cse29 |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 0)))))))) is different from false [2023-11-19 04:17:33,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:17:33,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 92 [2023-11-19 04:17:33,368 INFO L349 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2023-11-19 04:17:33,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 92 [2023-11-19 04:17:33,417 INFO L349 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2023-11-19 04:17:33,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 83