./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/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_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fabf091179f48b7141dc193b5040f4974c042bd8a2afb03b99137d693bf63ce7 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 04:16:17,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 04:16:18,063 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-19 04:16:18,071 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 04:16:18,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 04:16:18,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 04:16:18,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 04:16:18,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 04:16:18,119 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 04:16:18,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 04:16:18,125 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 04:16:18,127 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 04:16:18,127 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 04:16:18,129 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 04:16:18,129 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 04:16:18,130 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 04:16:18,130 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 04:16:18,132 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 04:16:18,133 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 04:16:18,133 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 04:16:18,134 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 04:16:18,134 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 04:16:18,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 04:16:18,136 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 04:16:18,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 04:16:18,137 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 04:16:18,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 04:16:18,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 04:16:18,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 04:16:18,139 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 04:16:18,140 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 04:16:18,141 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 04:16:18,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 04:16:18,141 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 04:16:18,142 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 04:16:18,142 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 04:16:18,142 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 04:16:18,142 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 04:16:18,143 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 04:16:18,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:16:18,143 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 04:16:18,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 04:16:18,144 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 04:16:18,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 04:16:18,145 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 04:16:18,145 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 04:16:18,146 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_452a55fa-83ad-43cf-819b-347747340294/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_452a55fa-83ad-43cf-819b-347747340294/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> fabf091179f48b7141dc193b5040f4974c042bd8a2afb03b99137d693bf63ce7 [2023-11-19 04:16:18,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 04:16:18,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 04:16:18,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 04:16:18,562 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 04:16:18,564 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 04:16:18,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2023-11-19 04:16:22,308 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 04:16:22,686 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 04:16:22,687 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2023-11-19 04:16:22,702 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/data/3fd0be27d/a413b2e548754f47ad28aeb9a216836c/FLAG465fbb48d [2023-11-19 04:16:22,914 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/data/3fd0be27d/a413b2e548754f47ad28aeb9a216836c [2023-11-19 04:16:22,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 04:16:22,922 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 04:16:22,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 04:16:22,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 04:16:22,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 04:16:22,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:16:22" (1/1) ... [2023-11-19 04:16:22,934 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57a9f461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:16:22, skipping insertion in model container [2023-11-19 04:16:22,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:16:22" (1/1) ... [2023-11-19 04:16:23,005 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 04:16:23,397 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:16:23,409 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 04:16:23,469 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:16:23,511 INFO L206 MainTranslator]: Completed translation [2023-11-19 04:16:23,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:16:23 WrapperNode [2023-11-19 04:16:23,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 04:16:23,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 04:16:23,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 04:16:23,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 04:16:23,523 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:16:23" (1/1) ... [2023-11-19 04:16:23,543 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:16:23" (1/1) ... [2023-11-19 04:16:23,582 INFO L138 Inliner]: procedures = 129, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 192 [2023-11-19 04:16:23,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 04:16:23,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 04:16:23,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 04:16:23,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 04:16:23,595 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:16:23" (1/1) ... [2023-11-19 04:16:23,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:16:23" (1/1) ... [2023-11-19 04:16:23,601 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:16:23" (1/1) ... [2023-11-19 04:16:23,602 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:16:23" (1/1) ... [2023-11-19 04:16:23,627 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:16:23" (1/1) ... [2023-11-19 04:16:23,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:16:23" (1/1) ... [2023-11-19 04:16:23,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:16:23" (1/1) ... [2023-11-19 04:16:23,650 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:16:23" (1/1) ... [2023-11-19 04:16:23,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 04:16:23,669 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 04:16:23,669 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 04:16:23,669 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 04:16:23,670 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:16:23" (1/1) ... [2023-11-19 04:16:23,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:16:23,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:16:23,722 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/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:16:23,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/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:16:23,768 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-19 04:16:23,768 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-19 04:16:23,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 04:16:23,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 04:16:23,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 04:16:23,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 04:16:23,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 04:16:23,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 04:16:23,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 04:16:23,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 04:16:23,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 04:16:23,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 04:16:23,923 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 04:16:23,926 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 04:16:24,073 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-19 04:16:24,697 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 04:16:24,809 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 04:16:24,809 INFO L302 CfgBuilder]: Removed 9 assume(true) statements. [2023-11-19 04:16:24,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:16:24 BoogieIcfgContainer [2023-11-19 04:16:24,816 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 04:16:24,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 04:16:24,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 04:16:24,823 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 04:16:24,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:16:22" (1/3) ... [2023-11-19 04:16:24,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40bf6ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:16:24, skipping insertion in model container [2023-11-19 04:16:24,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:16:23" (2/3) ... [2023-11-19 04:16:24,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40bf6ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:16:24, skipping insertion in model container [2023-11-19 04:16:24,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:16:24" (3/3) ... [2023-11-19 04:16:24,832 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-1.i [2023-11-19 04:16:24,852 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 04:16:24,853 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2023-11-19 04:16:24,907 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:16:24,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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@3b769349, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:16:24,917 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2023-11-19 04:16:24,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 52 states have (on average 2.173076923076923) internal successors, (113), 95 states have internal predecessors, (113), 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:16:24,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-19 04:16:24,931 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:16:24,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-19 04:16:24,932 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 04:16:24,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:16:24,940 INFO L85 PathProgramCache]: Analyzing trace with hash 306466, now seen corresponding path program 1 times [2023-11-19 04:16:24,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:16:24,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487450826] [2023-11-19 04:16:24,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:24,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:16:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:25,329 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:16:25,330 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:16:25,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487450826] [2023-11-19 04:16:25,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487450826] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:16:25,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:16:25,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:16:25,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081618944] [2023-11-19 04:16:25,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:16:25,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:16:25,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:16:25,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:16:25,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:16:25,389 INFO L87 Difference]: Start difference. First operand has 97 states, 52 states have (on average 2.173076923076923) internal successors, (113), 95 states have internal predecessors, (113), 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 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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:16:25,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:16:25,625 INFO L93 Difference]: Finished difference Result 136 states and 156 transitions. [2023-11-19 04:16:25,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:16:25,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2023-11-19 04:16:25,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:16:25,637 INFO L225 Difference]: With dead ends: 136 [2023-11-19 04:16:25,637 INFO L226 Difference]: Without dead ends: 129 [2023-11-19 04:16:25,639 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:16:25,644 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 43 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:16:25,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 157 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:16:25,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-19 04:16:25,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 92. [2023-11-19 04:16:25,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 50 states have (on average 2.08) internal successors, (104), 91 states have internal predecessors, (104), 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:16:25,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2023-11-19 04:16:25,696 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 3 [2023-11-19 04:16:25,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:16:25,696 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2023-11-19 04:16:25,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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:16:25,697 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2023-11-19 04:16:25,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-19 04:16:25,698 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:16:25,698 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:16:25,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 04:16:25,699 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 04:16:25,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:16:25,700 INFO L85 PathProgramCache]: Analyzing trace with hash 68182074, now seen corresponding path program 1 times [2023-11-19 04:16:25,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:16:25,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696134761] [2023-11-19 04:16:25,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:25,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:16:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:25,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 04:16:25,940 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:16:25,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696134761] [2023-11-19 04:16:25,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696134761] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:16:25,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:16:25,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:16:25,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133574665] [2023-11-19 04:16:25,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:16:25,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:16:25,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:16:25,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:16:25,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:16:25,946 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:16:26,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:16:26,159 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2023-11-19 04:16:26,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:16:26,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2023-11-19 04:16:26,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:16:26,162 INFO L225 Difference]: With dead ends: 113 [2023-11-19 04:16:26,162 INFO L226 Difference]: Without dead ends: 113 [2023-11-19 04:16:26,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:16:26,165 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 89 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:16:26,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 64 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:16:26,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-19 04:16:26,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 90. [2023-11-19 04:16:26,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 50 states have (on average 2.04) internal successors, (102), 89 states have internal predecessors, (102), 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:16:26,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2023-11-19 04:16:26,180 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 7 [2023-11-19 04:16:26,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:16:26,181 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2023-11-19 04:16:26,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:16:26,181 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2023-11-19 04:16:26,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-19 04:16:26,182 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:16:26,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:16:26,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 04:16:26,183 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 04:16:26,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:16:26,184 INFO L85 PathProgramCache]: Analyzing trace with hash 68182075, now seen corresponding path program 1 times [2023-11-19 04:16:26,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:16:26,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348406594] [2023-11-19 04:16:26,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:26,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:16:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:26,298 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:16:26,299 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:16:26,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348406594] [2023-11-19 04:16:26,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348406594] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:16:26,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356850103] [2023-11-19 04:16:26,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:26,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:16:26,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:16:26,303 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:16:26,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 04:16:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:26,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 04:16:26,416 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:16:26,512 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:16:26,512 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:16:26,542 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:16:26,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356850103] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:16:26,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [468840646] [2023-11-19 04:16:26,567 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-11-19 04:16:26,567 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:16:26,573 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:16:26,580 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:16:26,580 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:16:27,458 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:16:27,633 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '580#(and (<= 1 |#StackHeapBarrier|) (<= (select |#length| |ULTIMATE.start_main_~#head~1#1.base|) 3) (= 5 |ULTIMATE.start_main_~max~0#1|) (= |ULTIMATE.start_main_~#head~1#1.offset| 0) (= 3 |ULTIMATE.start_main_~min~0#1|) (<= 2 |ULTIMATE.start_main_~#head~1#1.base|) (<= 6 |ULTIMATE.start_main_~i~0#1|))' at error location [2023-11-19 04:16:27,634 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:16:27,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:16:27,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-11-19 04:16:27,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405074795] [2023-11-19 04:16:27,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:16:27,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:16:27,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:16:27,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:16:27,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-19 04:16:27,641 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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:16:27,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:16:27,846 INFO L93 Difference]: Finished difference Result 201 states and 222 transitions. [2023-11-19 04:16:27,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:16:27,847 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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) Word has length 7 [2023-11-19 04:16:27,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:16:27,854 INFO L225 Difference]: With dead ends: 201 [2023-11-19 04:16:27,855 INFO L226 Difference]: Without dead ends: 201 [2023-11-19 04:16:27,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-19 04:16:27,861 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 284 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:16:27,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 244 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:16:27,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-11-19 04:16:27,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 133. [2023-11-19 04:16:27,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 93 states have (on average 2.043010752688172) internal successors, (190), 132 states have internal predecessors, (190), 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:16:27,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 190 transitions. [2023-11-19 04:16:27,900 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 190 transitions. Word has length 7 [2023-11-19 04:16:27,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:16:27,901 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 190 transitions. [2023-11-19 04:16:27,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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:16:27,901 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 190 transitions. [2023-11-19 04:16:27,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 04:16:27,902 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:16:27,902 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:16:27,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 04:16:28,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:16:28,129 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 04:16:28,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:16:28,129 INFO L85 PathProgramCache]: Analyzing trace with hash 2112769602, now seen corresponding path program 1 times [2023-11-19 04:16:28,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:16:28,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995463766] [2023-11-19 04:16:28,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:28,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:16:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:28,415 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:16:28,415 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:16:28,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995463766] [2023-11-19 04:16:28,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995463766] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:16:28,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:16:28,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:16:28,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920621512] [2023-11-19 04:16:28,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:16:28,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:16:28,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:16:28,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:16:28,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:16:28,419 INFO L87 Difference]: Start difference. First operand 133 states and 190 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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:16:28,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:16:28,597 INFO L93 Difference]: Finished difference Result 156 states and 195 transitions. [2023-11-19 04:16:28,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:16:28,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2023-11-19 04:16:28,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:16:28,599 INFO L225 Difference]: With dead ends: 156 [2023-11-19 04:16:28,600 INFO L226 Difference]: Without dead ends: 156 [2023-11-19 04:16:28,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:16:28,602 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 65 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:16:28,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 286 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:16:28,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-11-19 04:16:28,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 134. [2023-11-19 04:16:28,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 94 states have (on average 2.0319148936170213) internal successors, (191), 133 states have internal predecessors, (191), 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:16:28,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 191 transitions. [2023-11-19 04:16:28,615 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 191 transitions. Word has length 8 [2023-11-19 04:16:28,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:16:28,615 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 191 transitions. [2023-11-19 04:16:28,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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:16:28,616 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 191 transitions. [2023-11-19 04:16:28,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 04:16:28,617 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:16:28,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:16:28,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 04:16:28,617 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 04:16:28,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:16:28,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1071102820, now seen corresponding path program 1 times [2023-11-19 04:16:28,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:16:28,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332297533] [2023-11-19 04:16:28,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:28,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:16:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:28,692 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:16:28,693 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:16:28,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332297533] [2023-11-19 04:16:28,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332297533] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:16:28,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:16:28,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:16:28,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778837824] [2023-11-19 04:16:28,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:16:28,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:16:28,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:16:28,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:16:28,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:16:28,696 INFO L87 Difference]: Start difference. First operand 134 states and 191 transitions. Second operand has 3 states, 2 states have (on average 4.5) 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:16:28,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:16:28,805 INFO L93 Difference]: Finished difference Result 133 states and 188 transitions. [2023-11-19 04:16:28,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:16:28,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) 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:16:28,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:16:28,808 INFO L225 Difference]: With dead ends: 133 [2023-11-19 04:16:28,808 INFO L226 Difference]: Without dead ends: 133 [2023-11-19 04:16:28,808 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:16:28,809 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:16:28,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 124 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:16:28,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-19 04:16:28,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2023-11-19 04:16:28,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 94 states have (on average 2.0) internal successors, (188), 132 states have internal predecessors, (188), 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:16:28,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 188 transitions. [2023-11-19 04:16:28,820 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 188 transitions. Word has length 9 [2023-11-19 04:16:28,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:16:28,820 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 188 transitions. [2023-11-19 04:16:28,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) 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:16:28,821 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 188 transitions. [2023-11-19 04:16:28,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 04:16:28,822 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:16:28,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:16:28,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 04:16:28,822 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 04:16:28,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:16:28,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1071102821, now seen corresponding path program 1 times [2023-11-19 04:16:28,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:16:28,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704951556] [2023-11-19 04:16:28,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:28,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:16:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:28,913 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:16:28,914 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:16:28,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704951556] [2023-11-19 04:16:28,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704951556] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:16:28,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:16:28,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:16:28,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626483950] [2023-11-19 04:16:28,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:16:28,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:16:28,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:16:28,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:16:28,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:16:28,917 INFO L87 Difference]: Start difference. First operand 133 states and 188 transitions. Second operand has 3 states, 2 states have (on average 4.5) 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:16:29,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:16:29,022 INFO L93 Difference]: Finished difference Result 132 states and 185 transitions. [2023-11-19 04:16:29,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:16:29,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) 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:16:29,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:16:29,025 INFO L225 Difference]: With dead ends: 132 [2023-11-19 04:16:29,025 INFO L226 Difference]: Without dead ends: 132 [2023-11-19 04:16:29,025 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:16:29,026 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:16:29,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:16:29,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-19 04:16:29,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2023-11-19 04:16:29,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 94 states have (on average 1.9680851063829787) internal successors, (185), 131 states have internal predecessors, (185), 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:16:29,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 185 transitions. [2023-11-19 04:16:29,035 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 185 transitions. Word has length 9 [2023-11-19 04:16:29,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:16:29,035 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 185 transitions. [2023-11-19 04:16:29,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) 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:16:29,036 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 185 transitions. [2023-11-19 04:16:29,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 04:16:29,036 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:16:29,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:16:29,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 04:16:29,037 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 04:16:29,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:16:29,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1462112484, now seen corresponding path program 1 times [2023-11-19 04:16:29,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:16:29,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921781885] [2023-11-19 04:16:29,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:29,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:16:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:29,184 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:16:29,185 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:16:29,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921781885] [2023-11-19 04:16:29,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921781885] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:16:29,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562354723] [2023-11-19 04:16:29,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:29,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:16:29,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:16:29,187 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:16:29,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 04:16:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:29,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-19 04:16:29,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:16:29,374 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:16:29,374 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:16:29,445 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:16:29,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562354723] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:16:29,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [704212126] [2023-11-19 04:16:29,454 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-11-19 04:16:29,455 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:16:29,455 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:16:29,455 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:16:29,455 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:16:31,659 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:16:33,124 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1824#(and (= 3 |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1|) (<= 1 |#StackHeapBarrier|) (= 3 |ULTIMATE.start_sll_append_#in~sublist_length#1|) (not (= (select |#valid| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 1)) (= |ULTIMATE.start_sll_append_~sublist_length#1| 3) (= 3 |ULTIMATE.start_main_~i~0#1|) (= 5 |ULTIMATE.start_main_~max~0#1|) (<= 2 |ULTIMATE.start_sll_append_#in~head#1.base|) (= |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_main_~#head~1#1.offset| 0) (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_node_create_with_sublist_~sublist_length#1| 3) (= |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= 3 |ULTIMATE.start_main_~min~0#1|) (<= 2 |ULTIMATE.start_sll_append_~head#1.base|) (<= 2 |ULTIMATE.start_main_~#head~1#1.base|) (= |ULTIMATE.start_main_~j~0#1| 0) (= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (= 0 |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|))' at error location [2023-11-19 04:16:33,124 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:16:33,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:16:33,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-11-19 04:16:33,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577651608] [2023-11-19 04:16:33,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:16:33,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-19 04:16:33,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:16:33,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-19 04:16:33,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2023-11-19 04:16:33,127 INFO L87 Difference]: Start difference. First operand 132 states and 185 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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:16:33,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:16:33,538 INFO L93 Difference]: Finished difference Result 219 states and 264 transitions. [2023-11-19 04:16:33,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 04:16:33,539 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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 11 [2023-11-19 04:16:33,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:16:33,540 INFO L225 Difference]: With dead ends: 219 [2023-11-19 04:16:33,540 INFO L226 Difference]: Without dead ends: 219 [2023-11-19 04:16:33,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2023-11-19 04:16:33,543 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 259 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:16:33,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 544 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:16:33,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-11-19 04:16:33,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 152. [2023-11-19 04:16:33,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 114 states have (on average 1.7982456140350878) internal successors, (205), 151 states have internal predecessors, (205), 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:16:33,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 205 transitions. [2023-11-19 04:16:33,558 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 205 transitions. Word has length 11 [2023-11-19 04:16:33,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:16:33,558 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 205 transitions. [2023-11-19 04:16:33,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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:16:33,559 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 205 transitions. [2023-11-19 04:16:33,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 04:16:33,561 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:16:33,561 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1] [2023-11-19 04:16:33,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 04:16:33,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:16:33,786 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 04:16:33,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:16:33,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1869603435, now seen corresponding path program 2 times [2023-11-19 04:16:33,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:16:33,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118876715] [2023-11-19 04:16:33,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:33,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:16:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-19 04:16:33,878 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:16:33,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118876715] [2023-11-19 04:16:33,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118876715] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:16:33,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:16:33,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:16:33,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450755112] [2023-11-19 04:16:33,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:16:33,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:16:33,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:16:33,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:16:33,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:16:33,882 INFO L87 Difference]: Start difference. First operand 152 states and 205 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:16:33,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:16:33,965 INFO L93 Difference]: Finished difference Result 150 states and 203 transitions. [2023-11-19 04:16:33,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:16:33,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 15 [2023-11-19 04:16:33,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:16:33,967 INFO L225 Difference]: With dead ends: 150 [2023-11-19 04:16:33,968 INFO L226 Difference]: Without dead ends: 150 [2023-11-19 04:16:33,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:16:33,976 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 87 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:16:33,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 55 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:16:33,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-11-19 04:16:33,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2023-11-19 04:16:33,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 114 states have (on average 1.780701754385965) internal successors, (203), 149 states have internal predecessors, (203), 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:16:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 203 transitions. [2023-11-19 04:16:33,984 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 203 transitions. Word has length 15 [2023-11-19 04:16:33,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:16:33,985 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 203 transitions. [2023-11-19 04:16:33,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:16:33,987 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 203 transitions. [2023-11-19 04:16:33,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-19 04:16:33,988 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:16:33,989 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:16:33,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 04:16:33,989 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 04:16:33,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:16:33,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1525644636, now seen corresponding path program 2 times [2023-11-19 04:16:33,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:16:33,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612313583] [2023-11-19 04:16:33,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:33,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:16:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:34,264 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-19 04:16:34,265 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:16:34,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612313583] [2023-11-19 04:16:34,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612313583] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:16:34,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571892843] [2023-11-19 04:16:34,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 04:16:34,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:16:34,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:16:34,267 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:16:34,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 04:16:34,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-19 04:16:34,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 04:16:34,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-19 04:16:34,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:16:34,445 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:16:34,480 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-19 04:16:34,481 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 19 treesize of output 16 [2023-11-19 04:16:34,506 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 04:16:34,506 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 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-19 04:16:34,549 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 04:16:34,550 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 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-19 04:16:34,576 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-19 04:16:34,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:16:34,683 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 04:16:34,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571892843] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:16:34,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [335592273] [2023-11-19 04:16:34,686 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-11-19 04:16:34,687 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:16:34,687 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:16:34,687 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:16:34,687 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:16:36,288 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:16:37,557 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2625#(and (= 3 |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1|) (<= 1 |#StackHeapBarrier|) (= 3 |ULTIMATE.start_sll_append_#in~sublist_length#1|) (not (= (select |#valid| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 1)) (= |ULTIMATE.start_sll_append_~sublist_length#1| 3) (= 3 |ULTIMATE.start_main_~i~0#1|) (= 5 |ULTIMATE.start_main_~max~0#1|) (<= 2 |ULTIMATE.start_sll_append_#in~head#1.base|) (= |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_main_~#head~1#1.offset| 0) (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_node_create_with_sublist_~sublist_length#1| 3) (= |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= 3 |ULTIMATE.start_main_~min~0#1|) (<= 2 |ULTIMATE.start_sll_append_~head#1.base|) (<= 2 |ULTIMATE.start_main_~#head~1#1.base|) (= |ULTIMATE.start_main_~j~0#1| 0) (= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (= 0 |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|))' at error location [2023-11-19 04:16:37,558 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:16:37,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:16:37,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2023-11-19 04:16:37,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931151242] [2023-11-19 04:16:37,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:16:37,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:16:37,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:16:37,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:16:37,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-11-19 04:16:37,562 INFO L87 Difference]: Start difference. First operand 150 states and 203 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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:16:37,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:16:37,702 INFO L93 Difference]: Finished difference Result 148 states and 197 transitions. [2023-11-19 04:16:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:16:37,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 17 [2023-11-19 04:16:37,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:16:37,705 INFO L225 Difference]: With dead ends: 148 [2023-11-19 04:16:37,705 INFO L226 Difference]: Without dead ends: 148 [2023-11-19 04:16:37,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-11-19 04:16:37,706 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 9 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:16:37,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 155 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:16:37,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-11-19 04:16:37,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2023-11-19 04:16:37,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 114 states have (on average 1.7280701754385965) internal successors, (197), 147 states have internal predecessors, (197), 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:16:37,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 197 transitions. [2023-11-19 04:16:37,712 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 197 transitions. Word has length 17 [2023-11-19 04:16:37,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:16:37,713 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 197 transitions. [2023-11-19 04:16:37,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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:16:37,713 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 197 transitions. [2023-11-19 04:16:37,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-19 04:16:37,714 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:16:37,715 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:16:37,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 04:16:37,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:16:37,940 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 04:16:37,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:16:37,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1525644637, now seen corresponding path program 1 times [2023-11-19 04:16:37,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:16:37,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205710333] [2023-11-19 04:16:37,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:37,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:16:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:38,322 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 04:16:38,322 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:16:38,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205710333] [2023-11-19 04:16:38,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205710333] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:16:38,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978158970] [2023-11-19 04:16:38,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:38,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:16:38,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:16:38,325 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:16:38,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 04:16:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:38,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-19 04:16:38,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:16:38,455 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 8 treesize of output 1 [2023-11-19 04:16:38,459 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:16:38,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:38,486 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 14 treesize of output 9 [2023-11-19 04:16:38,502 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-19 04:16:38,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-19 04:16:38,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:38,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-19 04:16:38,578 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-19 04:16:38,579 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 16 treesize of output 18 [2023-11-19 04:16:38,607 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 04:16:38,607 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 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-19 04:16:38,637 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 04:16:38,637 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:16:39,141 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:16:39,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978158970] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:16:39,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [770998249] [2023-11-19 04:16:39,145 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-11-19 04:16:39,145 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:16:39,145 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:16:39,146 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:16:39,146 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:16:40,183 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:16:41,321 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3036#(and (= 3 |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1|) (<= 1 |#StackHeapBarrier|) (= 3 |ULTIMATE.start_sll_append_#in~sublist_length#1|) (= |ULTIMATE.start_sll_append_~sublist_length#1| 3) (= 3 |ULTIMATE.start_main_~i~0#1|) (= 5 |ULTIMATE.start_main_~max~0#1|) (<= 2 |ULTIMATE.start_sll_append_#in~head#1.base|) (= |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_main_~#head~1#1.offset| 0) (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_node_create_with_sublist_~sublist_length#1| 3) (= |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= 3 |ULTIMATE.start_main_~min~0#1|) (<= 2 |ULTIMATE.start_sll_append_~head#1.base|) (<= 2 |ULTIMATE.start_main_~#head~1#1.base|) (= |ULTIMATE.start_main_~j~0#1| 0) (<= (select |#length| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 7) (= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (= 0 |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|))' at error location [2023-11-19 04:16:41,321 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:16:41,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:16:41,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 10 [2023-11-19 04:16:41,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134310873] [2023-11-19 04:16:41,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:16:41,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-19 04:16:41,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:16:41,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-19 04:16:41,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2023-11-19 04:16:41,324 INFO L87 Difference]: Start difference. First operand 148 states and 197 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 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:16:41,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:16:41,735 INFO L93 Difference]: Finished difference Result 146 states and 191 transitions. [2023-11-19 04:16:41,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:16:41,736 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 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 17 [2023-11-19 04:16:41,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:16:41,738 INFO L225 Difference]: With dead ends: 146 [2023-11-19 04:16:41,738 INFO L226 Difference]: Without dead ends: 146 [2023-11-19 04:16:41,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2023-11-19 04:16:41,739 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 5 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 04:16:41,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 230 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 04:16:41,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-19 04:16:41,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2023-11-19 04:16:41,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 114 states have (on average 1.6754385964912282) internal successors, (191), 145 states have internal predecessors, (191), 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:16:41,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 191 transitions. [2023-11-19 04:16:41,746 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 191 transitions. Word has length 17 [2023-11-19 04:16:41,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:16:41,746 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 191 transitions. [2023-11-19 04:16:41,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 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:16:41,747 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 191 transitions. [2023-11-19 04:16:41,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 04:16:41,752 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:16:41,753 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:16:41,784 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-19 04:16:41,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-19 04:16:41,972 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 04:16:41,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:16:41,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1620570738, now seen corresponding path program 1 times [2023-11-19 04:16:41,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:16:41,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265920522] [2023-11-19 04:16:41,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:41,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:16:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:42,095 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-19 04:16:42,095 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:16:42,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265920522] [2023-11-19 04:16:42,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265920522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:16:42,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:16:42,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:16:42,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428747827] [2023-11-19 04:16:42,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:16:42,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:16:42,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:16:42,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:16:42,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:16:42,098 INFO L87 Difference]: Start difference. First operand 146 states and 191 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:16:42,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:16:42,207 INFO L93 Difference]: Finished difference Result 201 states and 252 transitions. [2023-11-19 04:16:42,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:16:42,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 19 [2023-11-19 04:16:42,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:16:42,210 INFO L225 Difference]: With dead ends: 201 [2023-11-19 04:16:42,210 INFO L226 Difference]: Without dead ends: 201 [2023-11-19 04:16:42,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:16:42,211 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 87 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:16:42,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 176 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:16:42,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-11-19 04:16:42,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 161. [2023-11-19 04:16:42,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 129 states have (on average 1.627906976744186) internal successors, (210), 160 states have internal predecessors, (210), 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:16:42,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 210 transitions. [2023-11-19 04:16:42,218 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 210 transitions. Word has length 19 [2023-11-19 04:16:42,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:16:42,219 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 210 transitions. [2023-11-19 04:16:42,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:16:42,219 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 210 transitions. [2023-11-19 04:16:42,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 04:16:42,222 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:16:42,222 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:16:42,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 04:16:42,223 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 04:16:42,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:16:42,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1615547465, now seen corresponding path program 1 times [2023-11-19 04:16:42,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:16:42,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254268152] [2023-11-19 04:16:42,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:42,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:16:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:42,334 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-19 04:16:42,334 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:16:42,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254268152] [2023-11-19 04:16:42,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254268152] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:16:42,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:16:42,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:16:42,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339186483] [2023-11-19 04:16:42,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:16:42,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:16:42,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:16:42,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:16:42,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:16:42,340 INFO L87 Difference]: Start difference. First operand 161 states and 210 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:16:42,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:16:42,452 INFO L93 Difference]: Finished difference Result 179 states and 228 transitions. [2023-11-19 04:16:42,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:16:42,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 19 [2023-11-19 04:16:42,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:16:42,454 INFO L225 Difference]: With dead ends: 179 [2023-11-19 04:16:42,454 INFO L226 Difference]: Without dead ends: 179 [2023-11-19 04:16:42,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:16:42,456 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 6 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:16:42,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 192 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:16:42,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-11-19 04:16:42,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 164. [2023-11-19 04:16:42,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 132 states have (on average 1.6136363636363635) internal successors, (213), 163 states have internal predecessors, (213), 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:16:42,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 213 transitions. [2023-11-19 04:16:42,464 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 213 transitions. Word has length 19 [2023-11-19 04:16:42,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:16:42,466 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 213 transitions. [2023-11-19 04:16:42,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:16:42,466 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 213 transitions. [2023-11-19 04:16:42,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 04:16:42,467 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:16:42,468 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:16:42,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 04:16:42,468 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 04:16:42,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:16:42,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1615544872, now seen corresponding path program 1 times [2023-11-19 04:16:42,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:16:42,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592061265] [2023-11-19 04:16:42,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:42,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:16:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:42,591 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-19 04:16:42,591 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:16:42,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592061265] [2023-11-19 04:16:42,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592061265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:16:42,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:16:42,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:16:42,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966355732] [2023-11-19 04:16:42,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:16:42,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:16:42,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:16:42,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:16:42,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:16:42,596 INFO L87 Difference]: Start difference. First operand 164 states and 213 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:16:42,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:16:42,719 INFO L93 Difference]: Finished difference Result 165 states and 213 transitions. [2023-11-19 04:16:42,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:16:42,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 19 [2023-11-19 04:16:42,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:16:42,721 INFO L225 Difference]: With dead ends: 165 [2023-11-19 04:16:42,722 INFO L226 Difference]: Without dead ends: 160 [2023-11-19 04:16:42,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:16:42,724 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:16:42,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:16:42,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-11-19 04:16:42,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2023-11-19 04:16:42,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 126 states have (on average 1.6349206349206349) internal successors, (206), 157 states have internal predecessors, (206), 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:16:42,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 206 transitions. [2023-11-19 04:16:42,730 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 206 transitions. Word has length 19 [2023-11-19 04:16:42,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:16:42,730 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 206 transitions. [2023-11-19 04:16:42,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:16:42,731 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 206 transitions. [2023-11-19 04:16:42,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 04:16:42,731 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:16:42,732 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:16:42,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 04:16:42,732 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 04:16:42,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:16:42,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1560858105, now seen corresponding path program 1 times [2023-11-19 04:16:42,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:16:42,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471125002] [2023-11-19 04:16:42,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:42,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:16:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:42,824 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 04:16:42,824 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:16:42,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471125002] [2023-11-19 04:16:42,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471125002] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:16:42,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:16:42,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:16:42,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103263274] [2023-11-19 04:16:42,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:16:42,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:16:42,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:16:42,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:16:42,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:16:42,827 INFO L87 Difference]: Start difference. First operand 158 states and 206 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:16:42,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:16:42,920 INFO L93 Difference]: Finished difference Result 157 states and 203 transitions. [2023-11-19 04:16:42,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:16:42,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 19 [2023-11-19 04:16:42,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:16:42,922 INFO L225 Difference]: With dead ends: 157 [2023-11-19 04:16:42,922 INFO L226 Difference]: Without dead ends: 157 [2023-11-19 04:16:42,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:16:42,923 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 26 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:16:42,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 136 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:16:42,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-11-19 04:16:42,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2023-11-19 04:16:42,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 126 states have (on average 1.6111111111111112) internal successors, (203), 156 states have internal predecessors, (203), 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:16:42,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 203 transitions. [2023-11-19 04:16:42,929 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 203 transitions. Word has length 19 [2023-11-19 04:16:42,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:16:42,929 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 203 transitions. [2023-11-19 04:16:42,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:16:42,930 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 203 transitions. [2023-11-19 04:16:42,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 04:16:42,930 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:16:42,931 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:16:42,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 04:16:42,931 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 04:16:42,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:16:42,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1560858106, now seen corresponding path program 1 times [2023-11-19 04:16:42,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:16:42,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089074266] [2023-11-19 04:16:42,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:42,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:16:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:43,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 04:16:43,084 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:16:43,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089074266] [2023-11-19 04:16:43,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089074266] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:16:43,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:16:43,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:16:43,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246702642] [2023-11-19 04:16:43,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:16:43,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:16:43,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:16:43,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:16:43,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:16:43,086 INFO L87 Difference]: Start difference. First operand 157 states and 203 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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:16:43,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:16:43,195 INFO L93 Difference]: Finished difference Result 156 states and 200 transitions. [2023-11-19 04:16:43,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:16:43,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 19 [2023-11-19 04:16:43,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:16:43,198 INFO L225 Difference]: With dead ends: 156 [2023-11-19 04:16:43,198 INFO L226 Difference]: Without dead ends: 156 [2023-11-19 04:16:43,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:16:43,199 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 25 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:16:43,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 200 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:16:43,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-11-19 04:16:43,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2023-11-19 04:16:43,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 126 states have (on average 1.5873015873015872) internal successors, (200), 155 states have internal predecessors, (200), 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:16:43,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 200 transitions. [2023-11-19 04:16:43,205 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 200 transitions. Word has length 19 [2023-11-19 04:16:43,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:16:43,206 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 200 transitions. [2023-11-19 04:16:43,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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:16:43,206 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 200 transitions. [2023-11-19 04:16:43,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 04:16:43,207 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:16:43,207 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:16:43,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 04:16:43,208 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 04:16:43,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:16:43,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1141961048, now seen corresponding path program 1 times [2023-11-19 04:16:43,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:16:43,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533984966] [2023-11-19 04:16:43,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:43,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:16:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:43,843 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 04:16:43,844 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:16:43,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533984966] [2023-11-19 04:16:43,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533984966] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:16:43,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395035639] [2023-11-19 04:16:43,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:43,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:16:43,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:16:43,846 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:16:43,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-19 04:16:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:44,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-19 04:16:44,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:16:44,033 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 8 treesize of output 1 [2023-11-19 04:16:44,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:44,070 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 14 treesize of output 9 [2023-11-19 04:16:44,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:44,102 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 14 treesize of output 9 [2023-11-19 04:16:44,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:44,135 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 14 treesize of output 9 [2023-11-19 04:16:44,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:44,167 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 14 treesize of output 9 [2023-11-19 04:16:44,194 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 04:16:44,194 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:16:46,435 WARN L854 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_append_~head#1.offset|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_355 Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_45| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_create_~new_head~0#1.base_45| 1)) (forall ((v_ArrVal_356 Int)) (<= (+ |c_ULTIMATE.start_sll_append_~head#1.offset| 4) (select (store (store |c_#length| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_46| v_ArrVal_355) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_45| v_ArrVal_356) |c_ULTIMATE.start_sll_append_~head#1.base|))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_create_~new_head~0#1.base_46| 1))))) is different from false [2023-11-19 04:16:48,548 WARN L854 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_append_~head#1.offset|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_47| Int)) (or (forall ((v_ArrVal_354 Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_46| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_create_~new_head~0#1.base_46| 1)) (forall ((v_ArrVal_355 Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_45| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_create_~new_head~0#1.base_45| 1)) (forall ((v_ArrVal_356 Int)) (<= (+ |c_ULTIMATE.start_sll_append_~head#1.offset| 4) (select (store (store (store |c_#length| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_47| v_ArrVal_354) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_46| v_ArrVal_355) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_45| v_ArrVal_356) |c_ULTIMATE.start_sll_append_~head#1.base|))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_create_~new_head~0#1.base_47| 1))))) is different from false [2023-11-19 04:16:50,684 WARN L854 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#head~1#1.offset|) (forall ((|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_24| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_24| 1)) (forall ((v_ArrVal_353 Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_47| Int)) (or (forall ((v_ArrVal_354 Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_46| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_create_~new_head~0#1.base_46| 1)) (forall ((v_ArrVal_355 Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_45| Int)) (or (forall ((v_ArrVal_356 Int)) (<= (+ 4 |c_ULTIMATE.start_main_~#head~1#1.offset|) (select (store (store (store (store |c_#length| |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_24| v_ArrVal_353) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_47| v_ArrVal_354) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_46| v_ArrVal_355) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_45| v_ArrVal_356) |c_ULTIMATE.start_main_~#head~1#1.base|))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_create_~new_head~0#1.base_45| 1)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_create_~new_head~0#1.base_47| 1))))))) is different from false [2023-11-19 04:16:50,777 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-11-19 04:16:50,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395035639] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:16:50,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1895256904] [2023-11-19 04:16:50,780 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-19 04:16:50,780 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:16:50,781 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:16:50,781 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:16:50,781 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:16:51,977 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:16:53,760 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5144#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_#memory_int_57| (Array Int (Array Int Int))) (|v_#memory_int_58| (Array Int (Array Int Int))) (|v_#memory_int_59| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_58| |ULTIMATE.start_node_create_with_sublist_#res#1.base| (store (select |v_#memory_int_58| |ULTIMATE.start_node_create_with_sublist_#res#1.base|) 0 (select (select |v_#memory_int_59| |ULTIMATE.start_node_create_with_sublist_#res#1.base|) 0))) |v_#memory_int_59|) (= |v_#memory_int_58| (store |v_#memory_int_57| |ULTIMATE.start_node_create_with_sublist_#res#1.base| (store (select |v_#memory_int_57| |ULTIMATE.start_node_create_with_sublist_#res#1.base|) 4 (select (select |v_#memory_int_58| |ULTIMATE.start_node_create_with_sublist_#res#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_59| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_59| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))))) (= (select |#valid| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 1) (= 3 |ULTIMATE.start_sll_append_#in~sublist_length#1|) (exists ((|v_#memory_$Pointer$.base_90| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.base_90| |ULTIMATE.start_node_create_with_sublist_#res#1.base| (store (store (select |v_#memory_$Pointer$.base_90| |ULTIMATE.start_node_create_with_sublist_#res#1.base|) 4 |ULTIMATE.start_sll_create_#res#1.base|) 0 0)) |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select (store |v_#memory_$Pointer$.base_90| |ULTIMATE.start_node_create_with_sublist_#res#1.base| (store (store (select |v_#memory_$Pointer$.base_90| |ULTIMATE.start_node_create_with_sublist_#res#1.base|) 4 |ULTIMATE.start_sll_create_#res#1.base|) 0 0)) |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 0)) |#memory_$Pointer$.base|)) (= |ULTIMATE.start_node_create_with_sublist_#res#1.offset| 0) (= |ULTIMATE.start_sll_append_~sublist_length#1| 3) (= 3 |ULTIMATE.start_main_~i~0#1|) (= 5 |ULTIMATE.start_main_~max~0#1|) (<= 2 |ULTIMATE.start_sll_append_#in~head#1.base|) (= |ULTIMATE.start_main_~#head~1#1.offset| 0) (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= 3 |ULTIMATE.start_main_~min~0#1|) (<= 2 |ULTIMATE.start_sll_append_~head#1.base|) (<= 2 |ULTIMATE.start_main_~#head~1#1.base|) (exists ((|v_#memory_$Pointer$.offset_90| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_90| |ULTIMATE.start_node_create_with_sublist_#res#1.base| (store (store (select |v_#memory_$Pointer$.offset_90| |ULTIMATE.start_node_create_with_sublist_#res#1.base|) 4 0) 0 0)) |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select (store |v_#memory_$Pointer$.offset_90| |ULTIMATE.start_node_create_with_sublist_#res#1.base| (store (store (select |v_#memory_$Pointer$.offset_90| |ULTIMATE.start_node_create_with_sublist_#res#1.base|) 4 0) 0 0)) |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 0)))) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_sll_append_~head#1.base|) 3) (<= 8 (select |#length| |ULTIMATE.start_node_create_with_sublist_#res#1.base|)) (= |ULTIMATE.start_main_~j~0#1| 0) (= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (= |ULTIMATE.start_node_create_with_sublist_#res#1.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|))' at error location [2023-11-19 04:16:53,761 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:16:53,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:16:53,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 5] total 9 [2023-11-19 04:16:53,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860741696] [2023-11-19 04:16:53,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:16:53,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-19 04:16:53,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:16:53,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-19 04:16:53,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=253, Unknown=3, NotChecked=102, Total=420 [2023-11-19 04:16:53,763 INFO L87 Difference]: Start difference. First operand 156 states and 200 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 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:16:54,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:16:54,122 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2023-11-19 04:16:54,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:16:54,122 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 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 20 [2023-11-19 04:16:54,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:16:54,124 INFO L225 Difference]: With dead ends: 177 [2023-11-19 04:16:54,124 INFO L226 Difference]: Without dead ends: 177 [2023-11-19 04:16:54,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=71, Invalid=280, Unknown=3, NotChecked=108, Total=462 [2023-11-19 04:16:54,125 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 245 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 330 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:16:54,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 117 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 187 Invalid, 0 Unknown, 330 Unchecked, 0.2s Time] [2023-11-19 04:16:54,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-11-19 04:16:54,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 154. [2023-11-19 04:16:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 126 states have (on average 1.5396825396825398) internal successors, (194), 153 states have internal predecessors, (194), 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:16:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 194 transitions. [2023-11-19 04:16:54,130 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 194 transitions. Word has length 20 [2023-11-19 04:16:54,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:16:54,130 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 194 transitions. [2023-11-19 04:16:54,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 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:16:54,131 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 194 transitions. [2023-11-19 04:16:54,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 04:16:54,131 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:16:54,131 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:16:54,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-19 04:16:54,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-19 04:16:54,352 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 04:16:54,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:16:54,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1141961047, now seen corresponding path program 1 times [2023-11-19 04:16:54,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:16:54,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514758978] [2023-11-19 04:16:54,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:54,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:16:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:54,636 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 04:16:54,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:16:54,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514758978] [2023-11-19 04:16:54,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514758978] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:16:54,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083027757] [2023-11-19 04:16:54,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:54,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:16:54,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:16:54,638 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:16:54,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-19 04:16:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:54,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-19 04:16:54,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:16:54,782 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:16:54,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:54,800 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 14 treesize of output 9 [2023-11-19 04:16:54,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:54,827 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 14 treesize of output 9 [2023-11-19 04:16:54,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:54,844 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 14 treesize of output 9 [2023-11-19 04:16:54,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:54,859 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 14 treesize of output 9 [2023-11-19 04:16:54,869 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 04:16:54,869 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:16:55,067 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 04:16:55,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083027757] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:16:55,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2136880343] [2023-11-19 04:16:55,069 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-19 04:16:55,069 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:16:55,070 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:16:55,070 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:16:55,070 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:16:55,894 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:16:57,274 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5615#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_#memory_int_69| (Array Int (Array Int Int))) (|v_#memory_int_70| (Array Int (Array Int Int))) (|v_#memory_int_71| (Array Int (Array Int Int)))) (and (= |v_#memory_int_71| (store |v_#memory_int_70| |ULTIMATE.start_node_create_with_sublist_#res#1.base| (store (select |v_#memory_int_70| |ULTIMATE.start_node_create_with_sublist_#res#1.base|) 0 (select (select |v_#memory_int_71| |ULTIMATE.start_node_create_with_sublist_#res#1.base|) 0)))) (= |v_#memory_int_70| (store |v_#memory_int_69| |ULTIMATE.start_node_create_with_sublist_#res#1.base| (store (select |v_#memory_int_69| |ULTIMATE.start_node_create_with_sublist_#res#1.base|) 4 (select (select |v_#memory_int_70| |ULTIMATE.start_node_create_with_sublist_#res#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_71| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_71| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))))) (= 3 |ULTIMATE.start_sll_append_#in~sublist_length#1|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.offset| 0) (= |ULTIMATE.start_sll_append_~sublist_length#1| 3) (= 3 |ULTIMATE.start_main_~i~0#1|) (= 5 |ULTIMATE.start_main_~max~0#1|) (<= 2 |ULTIMATE.start_sll_append_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_102| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_102| |ULTIMATE.start_node_create_with_sublist_#res#1.base| (store (store (select |v_#memory_$Pointer$.offset_102| |ULTIMATE.start_node_create_with_sublist_#res#1.base|) 4 0) 0 0)) |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select (store |v_#memory_$Pointer$.offset_102| |ULTIMATE.start_node_create_with_sublist_#res#1.base| (store (store (select |v_#memory_$Pointer$.offset_102| |ULTIMATE.start_node_create_with_sublist_#res#1.base|) 4 0) 0 0)) |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 0)))) (= |ULTIMATE.start_main_~#head~1#1.offset| 0) (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= 3 |ULTIMATE.start_main_~min~0#1|) (= (select |#valid| |ULTIMATE.start_node_create_with_sublist_#res#1.base|) 1) (<= 2 |ULTIMATE.start_sll_append_~head#1.base|) (<= 2 |ULTIMATE.start_main_~#head~1#1.base|) (exists ((|v_#memory_$Pointer$.base_102| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_102| |ULTIMATE.start_node_create_with_sublist_#res#1.base| (store (store (select |v_#memory_$Pointer$.base_102| |ULTIMATE.start_node_create_with_sublist_#res#1.base|) 4 |ULTIMATE.start_sll_create_#res#1.base|) 0 0)) |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select (store |v_#memory_$Pointer$.base_102| |ULTIMATE.start_node_create_with_sublist_#res#1.base| (store (store (select |v_#memory_$Pointer$.base_102| |ULTIMATE.start_node_create_with_sublist_#res#1.base|) 4 |ULTIMATE.start_sll_create_#res#1.base|) 0 0)) |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 0)))) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_node_create_with_sublist_#res#1.base|)) (= |ULTIMATE.start_main_~j~0#1| 0) (not (= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1)) (= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (= |ULTIMATE.start_node_create_with_sublist_#res#1.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|))' at error location [2023-11-19 04:16:57,274 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:16:57,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:16:57,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 9 [2023-11-19 04:16:57,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439511008] [2023-11-19 04:16:57,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:16:57,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-19 04:16:57,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:16:57,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-19 04:16:57,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2023-11-19 04:16:57,277 INFO L87 Difference]: Start difference. First operand 154 states and 194 transitions. Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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:16:57,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:16:57,475 INFO L93 Difference]: Finished difference Result 175 states and 213 transitions. [2023-11-19 04:16:57,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:16:57,475 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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 20 [2023-11-19 04:16:57,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:16:57,476 INFO L225 Difference]: With dead ends: 175 [2023-11-19 04:16:57,477 INFO L226 Difference]: Without dead ends: 175 [2023-11-19 04:16:57,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2023-11-19 04:16:57,478 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 112 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:16:57,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 119 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:16:57,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-11-19 04:16:57,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 152. [2023-11-19 04:16:57,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 126 states have (on average 1.492063492063492) internal successors, (188), 151 states have internal predecessors, (188), 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:16:57,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 188 transitions. [2023-11-19 04:16:57,482 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 188 transitions. Word has length 20 [2023-11-19 04:16:57,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:16:57,482 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 188 transitions. [2023-11-19 04:16:57,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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:16:57,483 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 188 transitions. [2023-11-19 04:16:57,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-19 04:16:57,484 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:16:57,484 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:16:57,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-19 04:16:57,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-19 04:16:57,692 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 04:16:57,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:16:57,693 INFO L85 PathProgramCache]: Analyzing trace with hash -2086872481, now seen corresponding path program 1 times [2023-11-19 04:16:57,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:16:57,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610098124] [2023-11-19 04:16:57,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:57,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:16:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:58,399 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 04:16:58,399 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:16:58,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610098124] [2023-11-19 04:16:58,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610098124] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:16:58,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936701063] [2023-11-19 04:16:58,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:58,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:16:58,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:16:58,401 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:16:58,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_452a55fa-83ad-43cf-819b-347747340294/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-19 04:16:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:58,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-19 04:16:58,567 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:16:58,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:58,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 04:16:58,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:58,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 04:16:58,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:58,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 04:16:58,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:58,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 04:16:58,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:58,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 04:16:58,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:58,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 04:16:58,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:58,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 04:16:59,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:59,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 04:16:59,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:59,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 04:16:59,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:59,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 04:16:59,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:59,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 04:16:59,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:59,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 04:16:59,113 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 04:16:59,113 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:16:59,127 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_556 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| v_ArrVal_556) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_557 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| v_ArrVal_557) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) is different from false [2023-11-19 04:16:59,162 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_554) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_557) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|))) (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_555 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_555) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_556) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2023-11-19 04:17:01,217 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_550 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_555 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_555) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_556) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|))) (forall ((v_ArrVal_551 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_554) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_557) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2023-11-19 04:17:03,272 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_64| Int)) (or (forall ((v_ArrVal_550 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_555 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_64| v_ArrVal_550) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_555) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_556) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_create_~new_head~0#1.base_64| 1)))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_64| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_create_~new_head~0#1.base_64| 1)) (forall ((v_ArrVal_551 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_64| v_ArrVal_551) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_554) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_557) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))))) is different from false [2023-11-19 04:17:05,310 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_64| Int) (v_ArrVal_549 (Array Int Int))) (or (forall ((v_ArrVal_550 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_555 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_549) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_64| v_ArrVal_550) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_555) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_556) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_create_~new_head~0#1.base_64| 1)))) (forall ((v_ArrVal_548 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_64| Int)) (or (forall ((v_ArrVal_551 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_548) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_64| v_ArrVal_551) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_554) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_557) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_create_~new_head~0#1.base_64| 1))))) is different from false [2023-11-19 04:17:07,410 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_65| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_create_~new_head~0#1.base_65| 1)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_64| Int) (v_ArrVal_549 (Array Int Int))) (or (forall ((v_ArrVal_550 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_555 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_65| v_ArrVal_549) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_64| v_ArrVal_550) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_555) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_556) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_create_~new_head~0#1.base_64| 1)))))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_65| Int)) (or (forall ((v_ArrVal_548 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_64| Int)) (or (forall ((v_ArrVal_551 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_65| v_ArrVal_548) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_64| v_ArrVal_551) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_554) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_557) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_create_~new_head~0#1.base_64| 1)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_create_~new_head~0#1.base_65| 1))))) is different from false [2023-11-19 04:17:09,469 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_546 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_65| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_create_~new_head~0#1.base_65| 1)) (forall ((v_ArrVal_548 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_64| Int)) (or (forall ((v_ArrVal_551 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_546) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_65| v_ArrVal_548) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_64| v_ArrVal_551) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_554) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_557) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_create_~new_head~0#1.base_64| 1)))))) (forall ((v_ArrVal_547 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_65| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_create_~new_head~0#1.base_65| 1)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_64| Int) (v_ArrVal_549 (Array Int Int))) (or (forall ((v_ArrVal_550 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_555 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_547) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_65| v_ArrVal_549) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_64| v_ArrVal_550) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_555) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_556) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_create_~new_head~0#1.base_64| 1))))))) is different from false