./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX --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 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:53:22,580 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:53:22,650 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-12 00:53:22,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:53:22,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:53:22,706 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:53:22,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:53:22,707 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:53:22,708 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:53:22,709 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:53:22,709 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:53:22,710 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:53:22,710 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:53:22,711 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:53:22,711 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:53:22,712 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:53:22,712 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:53:22,713 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:53:22,713 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:53:22,714 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:53:22,714 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:53:22,736 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:53:22,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 00:53:22,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 00:53:22,737 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:53:22,738 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:53:22,738 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:53:22,739 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:53:22,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:53:22,740 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 00:53:22,740 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 00:53:22,741 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 00:53:22,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:53:22,742 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 00:53:22,742 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:53:22,743 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:53:22,743 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:53:22,743 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:53:22,744 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:53:22,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:53:22,744 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:53:22,745 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:53:22,745 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:53:22,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:53:22,746 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:53:22,746 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:53:22,746 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_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2023-11-12 00:53:22,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:53:23,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:53:23,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:53:23,027 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:53:23,029 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:53:23,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/list-simple/dll2n_append_equal.i [2023-11-12 00:53:26,176 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:53:26,455 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:53:26,471 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2023-11-12 00:53:26,488 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/data/1ac42e956/8de25d32e22649478b9cff60852b0ddc/FLAGd35ba7e7d [2023-11-12 00:53:26,501 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/data/1ac42e956/8de25d32e22649478b9cff60852b0ddc [2023-11-12 00:53:26,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:53:26,505 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:53:26,507 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:53:26,507 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:53:26,513 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:53:26,514 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:53:26" (1/1) ... [2023-11-12 00:53:26,515 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2da5f29c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:26, skipping insertion in model container [2023-11-12 00:53:26,515 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:53:26" (1/1) ... [2023-11-12 00:53:26,595 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:53:26,919 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:53:26,933 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:53:27,009 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:53:27,048 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:53:27,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:27 WrapperNode [2023-11-12 00:53:27,049 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:53:27,050 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:53:27,050 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:53:27,050 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:53:27,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:27" (1/1) ... [2023-11-12 00:53:27,071 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:27" (1/1) ... [2023-11-12 00:53:27,100 INFO L138 Inliner]: procedures = 127, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 130 [2023-11-12 00:53:27,101 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:53:27,102 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:53:27,102 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:53:27,102 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:53:27,112 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:27" (1/1) ... [2023-11-12 00:53:27,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:27" (1/1) ... [2023-11-12 00:53:27,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:27" (1/1) ... [2023-11-12 00:53:27,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:27" (1/1) ... [2023-11-12 00:53:27,128 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:27" (1/1) ... [2023-11-12 00:53:27,132 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:27" (1/1) ... [2023-11-12 00:53:27,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:27" (1/1) ... [2023-11-12 00:53:27,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:27" (1/1) ... [2023-11-12 00:53:27,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:53:27,141 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:53:27,141 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:53:27,142 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:53:27,143 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:27" (1/1) ... [2023-11-12 00:53:27,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:53:27,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:53:27,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:53:27,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:53:27,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:53:27,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:53:27,220 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-12 00:53:27,220 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-12 00:53:27,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:53:27,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:53:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:53:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:53:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:53:27,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:53:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 00:53:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:53:27,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:53:27,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:53:27,353 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:53:27,355 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:53:27,775 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:53:27,856 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:53:27,856 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-12 00:53:27,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:53:27 BoogieIcfgContainer [2023-11-12 00:53:27,859 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:53:27,862 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:53:27,862 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:53:27,865 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:53:27,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:53:26" (1/3) ... [2023-11-12 00:53:27,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6637c030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:53:27, skipping insertion in model container [2023-11-12 00:53:27,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:53:27" (2/3) ... [2023-11-12 00:53:27,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6637c030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:53:27, skipping insertion in model container [2023-11-12 00:53:27,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:53:27" (3/3) ... [2023-11-12 00:53:27,877 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2023-11-12 00:53:27,918 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:53:27,918 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-11-12 00:53:27,989 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:53:27,999 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;@5804a226, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:53:28,000 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-11-12 00:53:28,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 42 states have (on average 2.238095238095238) internal successors, (94), 83 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:53:28,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:53:28,014 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:28,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:53:28,015 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-12 00:53:28,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:28,023 INFO L85 PathProgramCache]: Analyzing trace with hash -2136453069, now seen corresponding path program 1 times [2023-11-12 00:53:28,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:28,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721101043] [2023-11-12 00:53:28,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:28,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:28,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:28,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:53:28,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721101043] [2023-11-12 00:53:28,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721101043] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:28,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:28,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:53:28,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519086234] [2023-11-12 00:53:28,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:28,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:53:28,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:53:28,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:53:28,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:53:28,340 INFO L87 Difference]: Start difference. First operand has 87 states, 42 states have (on average 2.238095238095238) internal successors, (94), 83 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:53:28,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:28,414 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2023-11-12 00:53:28,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:53:28,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-12 00:53:28,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:28,425 INFO L225 Difference]: With dead ends: 100 [2023-11-12 00:53:28,425 INFO L226 Difference]: Without dead ends: 98 [2023-11-12 00:53:28,427 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-12 00:53:28,431 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 13 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:28,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 158 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:53:28,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-12 00:53:28,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2023-11-12 00:53:28,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 41 states have (on average 2.1463414634146343) internal successors, (88), 81 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:53:28,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2023-11-12 00:53:28,475 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 6 [2023-11-12 00:53:28,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:28,476 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2023-11-12 00:53:28,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:53:28,476 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2023-11-12 00:53:28,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:53:28,477 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:28,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:53:28,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:53:28,478 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-12 00:53:28,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:28,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1990373823, now seen corresponding path program 1 times [2023-11-12 00:53:28,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:28,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640290193] [2023-11-12 00:53:28,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:28,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:28,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:28,549 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:53:28,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640290193] [2023-11-12 00:53:28,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640290193] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:28,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:28,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:53:28,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975263600] [2023-11-12 00:53:28,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:28,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:53:28,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:53:28,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:53:28,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:53:28,553 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:53:28,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:28,645 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2023-11-12 00:53:28,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:53:28,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-12 00:53:28,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:28,648 INFO L225 Difference]: With dead ends: 82 [2023-11-12 00:53:28,648 INFO L226 Difference]: Without dead ends: 82 [2023-11-12 00:53:28,648 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-12 00:53:28,650 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:28,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 111 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:53:28,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-12 00:53:28,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-12 00:53:28,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 41 states have (on average 2.073170731707317) internal successors, (85), 78 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:53:28,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2023-11-12 00:53:28,660 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 6 [2023-11-12 00:53:28,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:28,660 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2023-11-12 00:53:28,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:53:28,661 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2023-11-12 00:53:28,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:53:28,661 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:28,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:53:28,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:53:28,662 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-12 00:53:28,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:28,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1990373824, now seen corresponding path program 1 times [2023-11-12 00:53:28,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:28,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415011443] [2023-11-12 00:53:28,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:28,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:28,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:28,771 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:53:28,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415011443] [2023-11-12 00:53:28,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415011443] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:28,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:28,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:53:28,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638593870] [2023-11-12 00:53:28,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:28,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:53:28,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:53:28,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:53:28,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:53:28,775 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:53:28,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:28,859 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2023-11-12 00:53:28,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:53:28,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-12 00:53:28,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:28,861 INFO L225 Difference]: With dead ends: 79 [2023-11-12 00:53:28,861 INFO L226 Difference]: Without dead ends: 79 [2023-11-12 00:53:28,861 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-12 00:53:28,863 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 3 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:28,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 114 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:53:28,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-12 00:53:28,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-12 00:53:28,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 41 states have (on average 2.0) internal successors, (82), 75 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:53:28,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2023-11-12 00:53:28,872 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 6 [2023-11-12 00:53:28,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:28,873 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2023-11-12 00:53:28,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:53:28,873 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2023-11-12 00:53:28,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:53:28,874 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:28,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:28,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:53:28,875 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-12 00:53:28,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:28,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1239076541, now seen corresponding path program 1 times [2023-11-12 00:53:28,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:28,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128501633] [2023-11-12 00:53:28,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:28,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:29,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:29,249 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:53:29,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128501633] [2023-11-12 00:53:29,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128501633] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:29,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:29,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 00:53:29,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146534039] [2023-11-12 00:53:29,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:29,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:53:29,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:53:29,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:53:29,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:53:29,255 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 00:53:29,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:29,451 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2023-11-12 00:53:29,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:53:29,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-12 00:53:29,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:29,454 INFO L225 Difference]: With dead ends: 77 [2023-11-12 00:53:29,454 INFO L226 Difference]: Without dead ends: 77 [2023-11-12 00:53:29,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:53:29,456 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 13 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:29,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 236 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:53:29,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-12 00:53:29,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-12 00:53:29,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 41 states have (on average 1.951219512195122) internal successors, (80), 73 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:53:29,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2023-11-12 00:53:29,465 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 11 [2023-11-12 00:53:29,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:29,465 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2023-11-12 00:53:29,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 00:53:29,466 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2023-11-12 00:53:29,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:53:29,467 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:29,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:29,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:53:29,468 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-12 00:53:29,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:29,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1239076542, now seen corresponding path program 1 times [2023-11-12 00:53:29,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:29,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779170842] [2023-11-12 00:53:29,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:29,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:29,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:29,591 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:53:29,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779170842] [2023-11-12 00:53:29,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779170842] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:29,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:29,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:53:29,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599008236] [2023-11-12 00:53:29,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:29,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:53:29,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:53:29,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:53:29,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:53:29,598 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 00:53:29,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:29,759 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2023-11-12 00:53:29,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:53:29,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-12 00:53:29,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:29,761 INFO L225 Difference]: With dead ends: 75 [2023-11-12 00:53:29,761 INFO L226 Difference]: Without dead ends: 75 [2023-11-12 00:53:29,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:53:29,763 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 9 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:29,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 205 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:53:29,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-12 00:53:29,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-11-12 00:53:29,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 71 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:53:29,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2023-11-12 00:53:29,770 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 11 [2023-11-12 00:53:29,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:29,770 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2023-11-12 00:53:29,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 00:53:29,770 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2023-11-12 00:53:29,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-12 00:53:29,771 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:29,771 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:29,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:53:29,772 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-12 00:53:29,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:29,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1914633650, now seen corresponding path program 1 times [2023-11-12 00:53:29,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:29,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282737109] [2023-11-12 00:53:29,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:29,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:29,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:29,829 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:53:29,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282737109] [2023-11-12 00:53:29,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282737109] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:53:29,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:53:29,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:53:29,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484207487] [2023-11-12 00:53:29,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:53:29,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:53:29,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:53:29,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:53:29,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:53:29,832 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 00:53:29,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:29,872 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2023-11-12 00:53:29,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:53:29,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-11-12 00:53:29,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:29,874 INFO L225 Difference]: With dead ends: 81 [2023-11-12 00:53:29,874 INFO L226 Difference]: Without dead ends: 81 [2023-11-12 00:53:29,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:53:29,875 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:29,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 129 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:53:29,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-12 00:53:29,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2023-11-12 00:53:29,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 45 states have (on average 1.8222222222222222) internal successors, (82), 75 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:53:29,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2023-11-12 00:53:29,882 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 14 [2023-11-12 00:53:29,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:29,882 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2023-11-12 00:53:29,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 00:53:29,883 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2023-11-12 00:53:29,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-12 00:53:29,884 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:29,884 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:29,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 00:53:29,884 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-12 00:53:29,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:29,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1434822009, now seen corresponding path program 1 times [2023-11-12 00:53:29,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:29,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733502237] [2023-11-12 00:53:29,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:29,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:30,029 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:53:30,030 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:53:30,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733502237] [2023-11-12 00:53:30,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733502237] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:53:30,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581329764] [2023-11-12 00:53:30,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:30,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:53:30,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:53:30,035 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:53:30,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:53:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:30,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:53:30,213 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:30,302 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:30,302 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:53:30,337 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:53:30,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581329764] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:53:30,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1958192929] [2023-11-12 00:53:30,358 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-12 00:53:30,358 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:53:30,363 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:53:30,369 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:53:30,369 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:53:33,254 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 33 for LOIs [2023-11-12 00:53:33,353 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:53:41,537 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1233#(and (= |ULTIMATE.start_dll_append_~data#1| 1) (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_dll_append_#in~head#1.base|) (= |ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_dll_append_~head#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|) 1)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_dll_append_#in~data#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (or (and (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#length_75| (Array Int Int))) (= |#length| (store |v_#length_75| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12))) (exists ((|v_#valid_90| (Array Int Int))) (and (= (store |v_#valid_90| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_90| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |ULTIMATE.start_dll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 1) (<= (+ |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_70| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_70| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_70| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_49| (Array Int (Array Int Int))) (|v_#memory_int_50| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_51| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_51| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 1))) (= (store |v_#memory_int_50| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_50| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_51| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_51|) (= (store |v_#memory_int_49| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_49| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_50| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_50|))) (exists ((|v_#memory_$Pointer$.base_70| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_70| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_70| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (= |ULTIMATE.start_dll_append_~head#1.base| |ULTIMATE.start_dll_append_#in~head#1.base|) (<= 12 (select |#length| |ULTIMATE.start_dll_append_~new_last~0#1.base|))) (and (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_16| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_16| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#length_75| (Array Int Int))) (= |#length| (store |v_#length_75| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12))) (exists ((|v_#valid_90| (Array Int Int))) (and (= (store |v_#valid_90| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_90| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |ULTIMATE.start_dll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 1) (<= (+ |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_70| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_70| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_70| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_49| (Array Int (Array Int Int))) (|v_#memory_int_50| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_51| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_51| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 1))) (= (store |v_#memory_int_50| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_50| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_51| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_51|) (= (store |v_#memory_int_49| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_49| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_50| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_50|))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int)))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.base_70| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_70| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_70| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (= |ULTIMATE.start_dll_append_~head#1.base| |ULTIMATE.start_dll_append_#in~head#1.base|) (<= 12 (select |#length| |ULTIMATE.start_dll_append_~new_last~0#1.base|)))) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_dll_append_~head#1.base|) (= |ULTIMATE.start_dll_append_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-12 00:53:41,537 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:53:41,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:53:41,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2023-11-12 00:53:41,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451047382] [2023-11-12 00:53:41,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:53:41,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:53:41,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:53:41,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:53:41,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=315, Unknown=3, NotChecked=0, Total=380 [2023-11-12 00:53:41,540 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:53:41,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:41,578 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2023-11-12 00:53:41,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:53:41,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-11-12 00:53:41,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:41,580 INFO L225 Difference]: With dead ends: 82 [2023-11-12 00:53:41,580 INFO L226 Difference]: Without dead ends: 82 [2023-11-12 00:53:41,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=62, Invalid=315, Unknown=3, NotChecked=0, Total=380 [2023-11-12 00:53:41,581 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 9 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:41,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 133 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:53:41,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-12 00:53:41,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-12 00:53:41,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 77 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:53:41,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2023-11-12 00:53:41,588 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 24 [2023-11-12 00:53:41,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:41,589 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2023-11-12 00:53:41,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:53:41,589 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2023-11-12 00:53:41,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 00:53:41,590 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:41,591 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-12 00:53:41,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:53:41,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-12 00:53:41,797 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-12 00:53:41,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:41,797 INFO L85 PathProgramCache]: Analyzing trace with hash 253483419, now seen corresponding path program 1 times [2023-11-12 00:53:41,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:41,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584776102] [2023-11-12 00:53:41,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:41,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:42,170 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:42,170 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:53:42,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584776102] [2023-11-12 00:53:42,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584776102] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:53:42,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969353313] [2023-11-12 00:53:42,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:42,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:53:42,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:53:42,172 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:53:42,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:53:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:42,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-12 00:53:42,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:42,348 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 00:53:42,385 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-12 00:53:42,429 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-12 00:53:42,429 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-12 00:53:42,439 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-11-12 00:53:42,439 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:53:42,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969353313] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:53:42,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [187876234] [2023-11-12 00:53:42,500 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-12 00:53:42,500 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:53:42,501 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:53:42,501 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:53:42,503 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:53:44,102 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 122 for LOIs [2023-11-12 00:53:44,522 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:53:48,510 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1522#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= 1 |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (not (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_#memory_int_76| (Array Int (Array Int Int)))) (= (store |v_#memory_int_76| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |v_#memory_int_76| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 1) 4 (select (select |#memory_int| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) |#memory_int|)) (= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_create_~len#1| 2) (exists ((|v_#memory_$Pointer$.base_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_98| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_98| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_98| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4 |ULTIMATE.start_dll_create_~head~0#1.base|)) |#memory_$Pointer$.base|) (= (store |v_#memory_$Pointer$.base_97| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_97| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_98| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) |v_#memory_$Pointer$.base_98|))) (exists ((|v_#memory_$Pointer$.offset_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_98| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_98| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_98| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4 0))) (= (store |v_#memory_$Pointer$.offset_97| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_97| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_98| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) |v_#memory_$Pointer$.offset_98|))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_dll_create_#in~data#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_create_~data#1| 1))' at error location [2023-11-12 00:53:48,511 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:53:48,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:53:48,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2023-11-12 00:53:48,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685767418] [2023-11-12 00:53:48,512 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:53:48,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-12 00:53:48,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:53:48,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-12 00:53:48,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=557, Unknown=1, NotChecked=48, Total=702 [2023-11-12 00:53:48,518 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:53:49,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:49,027 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2023-11-12 00:53:49,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 00:53:49,028 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-11-12 00:53:49,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:49,029 INFO L225 Difference]: With dead ends: 81 [2023-11-12 00:53:49,029 INFO L226 Difference]: Without dead ends: 81 [2023-11-12 00:53:49,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=125, Invalid=748, Unknown=1, NotChecked=56, Total=930 [2023-11-12 00:53:49,030 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 10 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:49,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 304 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 359 Invalid, 0 Unknown, 83 Unchecked, 0.3s Time] [2023-11-12 00:53:49,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-12 00:53:49,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-11-12 00:53:49,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 47 states have (on average 1.7659574468085106) internal successors, (83), 76 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:53:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2023-11-12 00:53:49,038 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 27 [2023-11-12 00:53:49,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:49,038 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2023-11-12 00:53:49,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:53:49,038 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2023-11-12 00:53:49,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 00:53:49,039 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:49,040 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-12 00:53:49,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:53:49,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-12 00:53:49,240 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-12 00:53:49,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:49,241 INFO L85 PathProgramCache]: Analyzing trace with hash 253483420, now seen corresponding path program 1 times [2023-11-12 00:53:49,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:49,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676149956] [2023-11-12 00:53:49,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:49,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:49,660 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:49,660 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:53:49,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676149956] [2023-11-12 00:53:49,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676149956] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:53:49,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018188595] [2023-11-12 00:53:49,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:49,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:53:49,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:53:49,663 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:53:49,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:53:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:49,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-12 00:53:49,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:49,874 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 00:53:50,189 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:53:50,189 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-12 00:53:50,195 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-12 00:53:50,274 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:50,274 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:53:50,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018188595] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:53:50,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [4968427] [2023-11-12 00:53:50,458 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-12 00:53:50,458 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:53:50,458 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:53:50,459 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:53:50,459 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:53:52,075 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 122 for LOIs [2023-11-12 00:53:52,464 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:53:57,665 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1825#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= 1 |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_118| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_117| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_117| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_117| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_118| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) |v_#memory_$Pointer$.base_118|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_118| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_118| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4 |ULTIMATE.start_dll_create_~head~0#1.base|))))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (<= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 11) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_create_~len#1| 2) (exists ((|v_#memory_$Pointer$.offset_117| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_118| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_118| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_118| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4 0))) (= (store |v_#memory_$Pointer$.offset_117| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_117| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_118| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) |v_#memory_$Pointer$.offset_118|))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_dll_create_#in~data#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_96| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_96| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |v_#memory_int_96| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 1) 4 (select (select |#memory_int| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))))) (= |ULTIMATE.start_dll_create_~data#1| 1))' at error location [2023-11-12 00:53:57,665 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:53:57,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:53:57,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 20 [2023-11-12 00:53:57,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071279306] [2023-11-12 00:53:57,666 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:53:57,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-12 00:53:57,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:53:57,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-12 00:53:57,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1204, Unknown=0, NotChecked=0, Total=1332 [2023-11-12 00:53:57,668 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 21 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-12 00:53:58,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:53:58,696 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2023-11-12 00:53:58,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 00:53:58,697 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2023-11-12 00:53:58,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:53:58,698 INFO L225 Difference]: With dead ends: 81 [2023-11-12 00:53:58,698 INFO L226 Difference]: Without dead ends: 81 [2023-11-12 00:53:58,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=197, Invalid=1783, Unknown=0, NotChecked=0, Total=1980 [2023-11-12 00:53:58,701 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 12 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-12 00:53:58,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 590 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-12 00:53:58,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-12 00:53:58,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2023-11-12 00:53:58,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 47 states have (on average 1.7446808510638299) internal successors, (82), 75 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:53:58,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2023-11-12 00:53:58,707 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 27 [2023-11-12 00:53:58,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:53:58,707 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2023-11-12 00:53:58,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-12 00:53:58,708 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2023-11-12 00:53:58,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-12 00:53:58,709 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:53:58,709 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-12 00:53:58,719 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 00:53:58,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:53:58,910 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-12 00:53:58,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:53:58,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1703421744, now seen corresponding path program 2 times [2023-11-12 00:53:58,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:53:58,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293832403] [2023-11-12 00:53:58,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:53:58,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:53:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:53:59,091 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-12 00:53:59,092 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:53:59,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293832403] [2023-11-12 00:53:59,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293832403] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:53:59,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998388705] [2023-11-12 00:53:59,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 00:53:59,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:53:59,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:53:59,094 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:53:59,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:53:59,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-12 00:53:59,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:53:59,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-12 00:53:59,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:53:59,543 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-12 00:53:59,573 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2023-11-12 00:53:59,606 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-12 00:53:59,618 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:53:59,618 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-12 00:53:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 7 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:53:59,633 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:53:59,768 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:53:59,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998388705] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:53:59,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [734872819] [2023-11-12 00:53:59,771 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-12 00:53:59,772 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:53:59,772 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:53:59,772 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:53:59,772 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:54:01,467 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 165 for LOIs [2023-11-12 00:54:02,217 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:54:02,233 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_append_#in~data#1| 1) (<= 2 |c_ULTIMATE.start_dll_append_~head#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 2 |c_ULTIMATE.start_dll_append_#in~head#1.base|) (= |c_ULTIMATE.start_dll_append_#in~head#1.offset| 0) (<= 2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~data#1| 1) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~head#1.base|) 1)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (let ((.cse0 (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0))) (.cse1 (exists ((|v_#memory_$Pointer$.base_147| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_147| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_147| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)))))) (.cse2 (<= 12 (select |c_#length| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) (.cse3 (exists ((|v_#memory_$Pointer$.offset_147| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_147| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_147| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0)))))) (.cse4 (exists ((|v_#memory_$Pointer$.offset_154| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_155| (Array Int (Array Int Int)))) (let ((.cse16 (select |v_#memory_$Pointer$.offset_155| |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_154| |c_ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_154| |c_ULTIMATE.start_dll_create_#res#1.base|) 0 (select .cse16 0))) |v_#memory_$Pointer$.offset_155|) (= (select (select (store |v_#memory_$Pointer$.offset_155| |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse16 4 0)) |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) (.cse5 (= |c_ULTIMATE.start_dll_append_#in~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (= |c_ULTIMATE.start_dll_append_#in~head#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse7 (exists ((|v_#memory_int_126| (Array Int (Array Int Int))) (|v_#memory_int_127| (Array Int (Array Int Int))) (|v_#memory_int_128| (Array Int (Array Int Int)))) (let ((.cse14 (select |v_#memory_int_128| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (.cse15 (select |v_#memory_int_127| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|))) (and (= |c_#memory_int| (store |v_#memory_int_128| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store .cse14 0 1))) (= |v_#memory_int_128| (store |v_#memory_int_127| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store .cse15 8 (select .cse14 8)))) (= |v_#memory_int_127| (store |v_#memory_int_126| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_126| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select .cse15 4)))))))) (.cse8 (exists ((|v_#length_108| (Array Int Int))) (= (store |v_#length_108| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 12) |c_#length|))) (.cse9 (exists ((|v_#memory_$Pointer$.base_155| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_154| (Array Int (Array Int Int)))) (let ((.cse13 (select |v_#memory_$Pointer$.base_155| |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (= (store |v_#memory_$Pointer$.base_154| |c_ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_154| |c_ULTIMATE.start_dll_create_#res#1.base|) 0 (select .cse13 0))) |v_#memory_$Pointer$.base_155|) (= (select (select (store |v_#memory_$Pointer$.base_155| |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse13 4 0)) |c_ULTIMATE.start_main_~#s~0#1.base|) 0) |c_ULTIMATE.start_dll_create_#res#1.base|))))) (.cse10 (<= (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse11 (exists ((|v_#valid_131| (Array Int Int))) (and (= (select |v_#valid_131| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |c_#valid| (store |v_#valid_131| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 1))))) (.cse12 (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 1))) (or (and .cse0 .cse1 .cse2 .cse3 (exists ((|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_37| |c_ULTIMATE.start_dll_create_#res#1.base|) 1)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((|v_old(#memory_int)_AFTER_CALL_37| (Array Int (Array Int Int))) (|v_#memory_int_133| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_37| (store |v_#memory_int_133| |c_ULTIMATE.start_dll_create_#res#1.base| (store (store (select |v_#memory_int_133| |c_ULTIMATE.start_dll_create_#res#1.base|) 0 1) 4 (select (select |v_old(#memory_int)_AFTER_CALL_37| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))))) .cse11 (exists ((|v_#length_BEFORE_CALL_62| (Array Int Int))) (<= 8 (select |v_#length_BEFORE_CALL_62| |c_ULTIMATE.start_dll_create_#res#1.base|))) .cse12) (and (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_36| |c_ULTIMATE.start_dll_create_#res#1.base|) 1)) (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_133| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_36| (store |v_#memory_int_133| |c_ULTIMATE.start_dll_create_#res#1.base| (store (store (select |v_#memory_int_133| |c_ULTIMATE.start_dll_create_#res#1.base|) 0 1) 4 (select (select |v_old(#memory_int)_AFTER_CALL_36| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((|v_#length_BEFORE_CALL_60| (Array Int Int))) (<= 8 (select |v_#length_BEFORE_CALL_60| |c_ULTIMATE.start_dll_create_#res#1.base|))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) (= |c_ULTIMATE.start_main_~len~0#1| 2)) is different from true [2023-11-12 00:54:17,728 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2245#(and (= |ULTIMATE.start_dll_append_~data#1| 1) (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_dll_append_#in~head#1.base|) (= |ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_dll_append_~head#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|) 1)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_dll_append_#in~data#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_dll_append_~head#1.base|) (= |ULTIMATE.start_dll_append_#in~head#1.offset| 0) (or (and (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_36| |ULTIMATE.start_dll_create_#res#1.base|) 1)) (exists ((|v_#length_108| (Array Int Int))) (= (store |v_#length_108| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12) |#length|)) (exists ((|v_#memory_int_126| (Array Int (Array Int Int))) (|v_#memory_int_127| (Array Int (Array Int Int))) (|v_#memory_int_128| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_126| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_126| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_127| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_127|) (= (store |v_#memory_int_127| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_127| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_128| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_128|) (= |#memory_int| (store |v_#memory_int_128| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_128| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 1))))) (= |ULTIMATE.start_dll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 1) (<= (+ |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (exists ((|v_#valid_131| (Array Int Int))) (and (= (select |v_#valid_131| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_131| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_#memory_$Pointer$.offset_154| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_155| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_155| (store |v_#memory_$Pointer$.offset_154| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_154| |ULTIMATE.start_dll_create_#res#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_155| |ULTIMATE.start_dll_create_#res#1.base|) 0)))) (= (select (select (store |v_#memory_$Pointer$.offset_155| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_155| |ULTIMATE.start_dll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_133| (Array Int (Array Int Int)))) (= (store |v_#memory_int_133| |ULTIMATE.start_dll_create_#res#1.base| (store (store (select |v_#memory_int_133| |ULTIMATE.start_dll_create_#res#1.base|) 0 1) 4 (select (select |v_old(#memory_int)_AFTER_CALL_36| |ULTIMATE.start_dll_create_#res#1.base|) 4))) |v_old(#memory_int)_AFTER_CALL_36|)) (exists ((|v_#memory_$Pointer$.offset_147| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_147| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_147| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#length_BEFORE_CALL_60| (Array Int Int))) (<= 8 (select |v_#length_BEFORE_CALL_60| |ULTIMATE.start_dll_create_#res#1.base|))) (exists ((|v_#memory_$Pointer$.base_155| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_154| (Array Int (Array Int Int)))) (and (= |ULTIMATE.start_dll_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_155| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_155| |ULTIMATE.start_dll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (store |v_#memory_$Pointer$.base_154| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_154| |ULTIMATE.start_dll_create_#res#1.base|) 0 (select (select |v_#memory_$Pointer$.base_155| |ULTIMATE.start_dll_create_#res#1.base|) 0))) |v_#memory_$Pointer$.base_155|))) (exists ((|v_#memory_$Pointer$.base_147| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_147| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_147| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (= |ULTIMATE.start_dll_append_~head#1.base| |ULTIMATE.start_dll_append_#in~head#1.base|) (<= 12 (select |#length| |ULTIMATE.start_dll_append_~new_last~0#1.base|))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_37| (Array Int (Array Int Int))) (|v_#memory_int_133| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_37| (store |v_#memory_int_133| |ULTIMATE.start_dll_create_#res#1.base| (store (store (select |v_#memory_int_133| |ULTIMATE.start_dll_create_#res#1.base|) 0 1) 4 (select (select |v_old(#memory_int)_AFTER_CALL_37| |ULTIMATE.start_dll_create_#res#1.base|) 4))))) (exists ((|v_#length_BEFORE_CALL_62| (Array Int Int))) (<= 8 (select |v_#length_BEFORE_CALL_62| |ULTIMATE.start_dll_create_#res#1.base|))) (exists ((|v_#length_108| (Array Int Int))) (= (store |v_#length_108| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12) |#length|)) (exists ((|v_#memory_int_126| (Array Int (Array Int Int))) (|v_#memory_int_127| (Array Int (Array Int Int))) (|v_#memory_int_128| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_126| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_126| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_127| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_127|) (= (store |v_#memory_int_127| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_127| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_128| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_128|) (= |#memory_int| (store |v_#memory_int_128| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_128| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 1))))) (= |ULTIMATE.start_dll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 1) (<= (+ |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (exists ((|v_#valid_131| (Array Int Int))) (and (= (select |v_#valid_131| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_131| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_#memory_$Pointer$.offset_154| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_155| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_155| (store |v_#memory_$Pointer$.offset_154| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_154| |ULTIMATE.start_dll_create_#res#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_155| |ULTIMATE.start_dll_create_#res#1.base|) 0)))) (= (select (select (store |v_#memory_$Pointer$.offset_155| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_155| |ULTIMATE.start_dll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (exists ((|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_37| |ULTIMATE.start_dll_create_#res#1.base|) 1)) (exists ((|v_#memory_$Pointer$.offset_147| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_147| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_147| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.base_155| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_154| (Array Int (Array Int Int)))) (and (= |ULTIMATE.start_dll_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_155| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_155| |ULTIMATE.start_dll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (store |v_#memory_$Pointer$.base_154| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_154| |ULTIMATE.start_dll_create_#res#1.base|) 0 (select (select |v_#memory_$Pointer$.base_155| |ULTIMATE.start_dll_create_#res#1.base|) 0))) |v_#memory_$Pointer$.base_155|))) (exists ((|v_#memory_$Pointer$.base_147| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_147| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_147| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (= |ULTIMATE.start_dll_append_~head#1.base| |ULTIMATE.start_dll_append_#in~head#1.base|) (<= 12 (select |#length| |ULTIMATE.start_dll_append_~new_last~0#1.base|)))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-12 00:54:17,729 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:54:17,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:54:17,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 12 [2023-11-12 00:54:17,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522870638] [2023-11-12 00:54:17,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:54:17,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-12 00:54:17,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:54:17,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-12 00:54:17,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=577, Unknown=6, NotChecked=98, Total=756 [2023-11-12 00:54:17,734 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-12 00:54:18,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:54:18,319 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2023-11-12 00:54:18,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 00:54:18,320 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2023-11-12 00:54:18,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:54:18,322 INFO L225 Difference]: With dead ends: 80 [2023-11-12 00:54:18,322 INFO L226 Difference]: Without dead ends: 80 [2023-11-12 00:54:18,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=131, Invalid=993, Unknown=6, NotChecked=130, Total=1260 [2023-11-12 00:54:18,324 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 145 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:54:18,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 253 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 320 Invalid, 0 Unknown, 81 Unchecked, 0.3s Time] [2023-11-12 00:54:18,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-12 00:54:18,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-12 00:54:18,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 47 states have (on average 1.7234042553191489) internal successors, (81), 75 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:54:18,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2023-11-12 00:54:18,331 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 37 [2023-11-12 00:54:18,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:54:18,332 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2023-11-12 00:54:18,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-12 00:54:18,333 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2023-11-12 00:54:18,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-12 00:54:18,334 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:54:18,334 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:54:18,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 00:54:18,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:54:18,549 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-12 00:54:18,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:54:18,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1094180024, now seen corresponding path program 1 times [2023-11-12 00:54:18,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:54:18,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737046691] [2023-11-12 00:54:18,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:18,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:54:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:19,300 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 00:54:19,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:54:19,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737046691] [2023-11-12 00:54:19,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737046691] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:54:19,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684375535] [2023-11-12 00:54:19,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:54:19,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:54:19,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:54:19,303 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:54:19,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_816f96bd-8a5c-4c14-9e64-b0520395582e/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 00:54:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:54:19,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-12 00:54:19,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:54:19,546 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 00:54:19,565 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-12 00:54:19,613 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 00:54:19,613 INFO L351 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-12 00:54:19,765 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-12 00:54:19,774 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-11-12 00:54:19,814 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-11-12 00:54:19,814 INFO L351 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 16 treesize of output 22 [2023-11-12 00:54:19,990 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-12 00:54:20,002 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2023-11-12 00:54:20,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:54:20,092 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-12 00:54:20,098 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 15 not checked. [2023-11-12 00:54:20,098 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:54:20,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684375535] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:54:20,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [670254945] [2023-11-12 00:54:20,211 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-11-12 00:54:20,212 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:54:20,212 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:54:20,212 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:54:20,212 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs