./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc 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_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh --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 e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 08:34:04,103 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 08:34:04,163 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 08:34:04,168 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 08:34:04,169 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 08:34:04,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 08:34:04,191 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 08:34:04,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 08:34:04,192 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 08:34:04,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 08:34:04,193 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 08:34:04,194 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 08:34:04,194 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 08:34:04,195 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 08:34:04,195 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 08:34:04,196 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 08:34:04,196 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 08:34:04,197 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 08:34:04,197 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 08:34:04,198 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 08:34:04,198 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 08:34:04,199 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 08:34:04,200 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 08:34:04,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 08:34:04,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 08:34:04,201 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 08:34:04,201 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 08:34:04,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 08:34:04,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 08:34:04,202 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 08:34:04,203 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 08:34:04,203 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 08:34:04,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 08:34:04,203 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 08:34:04,204 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 08:34:04,204 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 08:34:04,204 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 08:34:04,204 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 08:34:04,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 08:34:04,205 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 08:34:04,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:34:04,205 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 08:34:04,205 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 08:34:04,205 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 08:34:04,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 08:34:04,206 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 08:34:04,206 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 08:34:04,206 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 08:34:04,206 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_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/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_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh 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 -> e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 [2023-12-02 08:34:04,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 08:34:04,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 08:34:04,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 08:34:04,427 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 08:34:04,428 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 08:34:04,429 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2023-12-02 08:34:07,200 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 08:34:07,420 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 08:34:07,421 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2023-12-02 08:34:07,435 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/data/cc258df71/df6e528b96f5424aa90bb544847c57d4/FLAGcab80dbe9 [2023-12-02 08:34:07,449 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/data/cc258df71/df6e528b96f5424aa90bb544847c57d4 [2023-12-02 08:34:07,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 08:34:07,453 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 08:34:07,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 08:34:07,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 08:34:07,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 08:34:07,461 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:34:07" (1/1) ... [2023-12-02 08:34:07,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d1e44c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:34:07, skipping insertion in model container [2023-12-02 08:34:07,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:34:07" (1/1) ... [2023-12-02 08:34:07,504 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 08:34:07,786 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:34:07,795 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 08:34:07,840 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:34:07,865 INFO L206 MainTranslator]: Completed translation [2023-12-02 08:34:07,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:34:07 WrapperNode [2023-12-02 08:34:07,865 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 08:34:07,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 08:34:07,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 08:34:07,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 08:34:07,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:34:07" (1/1) ... [2023-12-02 08:34:07,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:34:07" (1/1) ... [2023-12-02 08:34:07,907 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 146 [2023-12-02 08:34:07,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 08:34:07,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 08:34:07,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 08:34:07,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 08:34:07,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:34:07" (1/1) ... [2023-12-02 08:34:07,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:34:07" (1/1) ... [2023-12-02 08:34:07,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:34:07" (1/1) ... [2023-12-02 08:34:07,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:34:07" (1/1) ... [2023-12-02 08:34:07,930 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:34:07" (1/1) ... [2023-12-02 08:34:07,932 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:34:07" (1/1) ... [2023-12-02 08:34:07,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:34:07" (1/1) ... [2023-12-02 08:34:07,936 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:34:07" (1/1) ... [2023-12-02 08:34:07,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 08:34:07,941 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 08:34:07,941 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 08:34:07,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 08:34:07,942 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:34:07" (1/1) ... [2023-12-02 08:34:07,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:34:07,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:34:07,969 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 08:34:07,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 08:34:07,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 08:34:07,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 08:34:07,997 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-02 08:34:07,997 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-02 08:34:07,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 08:34:07,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 08:34:07,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 08:34:07,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 08:34:07,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 08:34:07,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 08:34:07,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-12-02 08:34:07,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 08:34:07,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 08:34:07,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 08:34:08,108 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 08:34:08,110 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 08:34:08,453 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 08:34:08,508 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 08:34:08,508 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-02 08:34:08,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:34:08 BoogieIcfgContainer [2023-12-02 08:34:08,510 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 08:34:08,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 08:34:08,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 08:34:08,534 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 08:34:08,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:34:07" (1/3) ... [2023-12-02 08:34:08,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13fcd4e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:34:08, skipping insertion in model container [2023-12-02 08:34:08,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:34:07" (2/3) ... [2023-12-02 08:34:08,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13fcd4e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:34:08, skipping insertion in model container [2023-12-02 08:34:08,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:34:08" (3/3) ... [2023-12-02 08:34:08,538 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_equal.i [2023-12-02 08:34:08,552 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 08:34:08,553 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2023-12-02 08:34:08,594 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 08:34:08,599 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;@250d2224, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 08:34:08,600 INFO L358 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2023-12-02 08:34:08,603 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 55 states have (on average 2.290909090909091) internal successors, (126), 115 states have internal predecessors, (126), 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-12-02 08:34:08,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 08:34:08,608 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:34:08,609 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 08:34:08,609 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-12-02 08:34:08,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:34:08,613 INFO L85 PathProgramCache]: Analyzing trace with hash 234339174, now seen corresponding path program 1 times [2023-12-02 08:34:08,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:34:08,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858065480] [2023-12-02 08:34:08,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:34:08,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:34:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:34:08,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:34:08,852 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:34:08,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858065480] [2023-12-02 08:34:08,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858065480] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:34:08,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:34:08,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 08:34:08,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845008823] [2023-12-02 08:34:08,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:34:08,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 08:34:08,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:34:08,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 08:34:08,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:34:08,893 INFO L87 Difference]: Start difference. First operand has 120 states, 55 states have (on average 2.290909090909091) internal successors, (126), 115 states have internal predecessors, (126), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-12-02 08:34:09,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:34:09,044 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2023-12-02 08:34:09,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 08:34:09,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2023-12-02 08:34:09,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:34:09,055 INFO L225 Difference]: With dead ends: 116 [2023-12-02 08:34:09,055 INFO L226 Difference]: Without dead ends: 114 [2023-12-02 08:34:09,057 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-12-02 08:34:09,061 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 8 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:34:09,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 160 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:34:09,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-02 08:34:09,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2023-12-02 08:34:09,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 53 states have (on average 2.188679245283019) internal successors, (116), 109 states have internal predecessors, (116), 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-12-02 08:34:09,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2023-12-02 08:34:09,105 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 5 [2023-12-02 08:34:09,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:34:09,106 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2023-12-02 08:34:09,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-12-02 08:34:09,106 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2023-12-02 08:34:09,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 08:34:09,107 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:34:09,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 08:34:09,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 08:34:09,108 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-12-02 08:34:09,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:34:09,108 INFO L85 PathProgramCache]: Analyzing trace with hash 234339175, now seen corresponding path program 1 times [2023-12-02 08:34:09,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:34:09,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499890042] [2023-12-02 08:34:09,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:34:09,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:34:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:34:09,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:34:09,218 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:34:09,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499890042] [2023-12-02 08:34:09,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499890042] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:34:09,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:34:09,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 08:34:09,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066745844] [2023-12-02 08:34:09,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:34:09,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 08:34:09,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:34:09,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 08:34:09,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:34:09,222 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-12-02 08:34:09,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:34:09,331 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2023-12-02 08:34:09,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 08:34:09,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2023-12-02 08:34:09,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:34:09,333 INFO L225 Difference]: With dead ends: 111 [2023-12-02 08:34:09,333 INFO L226 Difference]: Without dead ends: 111 [2023-12-02 08:34:09,334 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-12-02 08:34:09,335 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 3 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:34:09,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 165 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:34:09,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-02 08:34:09,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-12-02 08:34:09,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 53 states have (on average 2.1320754716981134) internal successors, (113), 106 states have internal predecessors, (113), 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-12-02 08:34:09,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2023-12-02 08:34:09,346 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 5 [2023-12-02 08:34:09,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:34:09,347 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2023-12-02 08:34:09,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-12-02 08:34:09,347 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2023-12-02 08:34:09,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 08:34:09,348 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:34:09,348 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:34:09,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 08:34:09,348 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-12-02 08:34:09,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:34:09,349 INFO L85 PathProgramCache]: Analyzing trace with hash -596227078, now seen corresponding path program 1 times [2023-12-02 08:34:09,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:34:09,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305935086] [2023-12-02 08:34:09,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:34:09,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:34:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:34:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:34:09,481 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:34:09,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305935086] [2023-12-02 08:34:09,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305935086] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:34:09,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:34:09,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 08:34:09,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183874855] [2023-12-02 08:34:09,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:34:09,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:34:09,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:34:09,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:34:09,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:34:09,484 INFO L87 Difference]: Start difference. First operand 111 states and 119 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-12-02 08:34:09,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:34:09,717 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2023-12-02 08:34:09,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:34:09,718 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-12-02 08:34:09,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:34:09,720 INFO L225 Difference]: With dead ends: 115 [2023-12-02 08:34:09,721 INFO L226 Difference]: Without dead ends: 115 [2023-12-02 08:34:09,721 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-12-02 08:34:09,722 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 7 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:34:09,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 310 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:34:09,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-02 08:34:09,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2023-12-02 08:34:09,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 55 states have (on average 2.1272727272727274) internal successors, (117), 108 states have internal predecessors, (117), 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-12-02 08:34:09,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2023-12-02 08:34:09,734 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 11 [2023-12-02 08:34:09,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:34:09,734 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2023-12-02 08:34:09,734 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-12-02 08:34:09,734 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2023-12-02 08:34:09,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 08:34:09,735 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:34:09,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:34:09,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 08:34:09,735 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-12-02 08:34:09,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:34:09,736 INFO L85 PathProgramCache]: Analyzing trace with hash -596227077, now seen corresponding path program 1 times [2023-12-02 08:34:09,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:34:09,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969974230] [2023-12-02 08:34:09,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:34:09,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:34:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:34:09,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:34:09,805 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:34:09,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969974230] [2023-12-02 08:34:09,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969974230] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:34:09,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:34:09,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 08:34:09,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328666828] [2023-12-02 08:34:09,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:34:09,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 08:34:09,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:34:09,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 08:34:09,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:34:09,808 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-12-02 08:34:09,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:34:09,840 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2023-12-02 08:34:09,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 08:34:09,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-12-02 08:34:09,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:34:09,842 INFO L225 Difference]: With dead ends: 112 [2023-12-02 08:34:09,842 INFO L226 Difference]: Without dead ends: 112 [2023-12-02 08:34:09,842 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-12-02 08:34:09,844 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 10 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 08:34:09,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 196 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 08:34:09,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-02 08:34:09,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-12-02 08:34:09,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 54 states have (on average 2.111111111111111) internal successors, (114), 107 states have internal predecessors, (114), 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-12-02 08:34:09,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2023-12-02 08:34:09,853 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 11 [2023-12-02 08:34:09,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:34:09,853 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2023-12-02 08:34:09,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-12-02 08:34:09,853 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2023-12-02 08:34:09,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 08:34:09,854 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:34:09,854 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:34:09,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 08:34:09,855 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-12-02 08:34:09,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:34:09,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1003078540, now seen corresponding path program 1 times [2023-12-02 08:34:09,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:34:09,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752300188] [2023-12-02 08:34:09,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:34:09,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:34:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:34:09,981 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 08:34:09,981 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:34:09,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752300188] [2023-12-02 08:34:09,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752300188] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:34:09,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:34:09,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 08:34:09,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574708354] [2023-12-02 08:34:09,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:34:09,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:34:09,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:34:09,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:34:09,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:34:09,984 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 08:34:10,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:34:10,177 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2023-12-02 08:34:10,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:34:10,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-12-02 08:34:10,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:34:10,179 INFO L225 Difference]: With dead ends: 111 [2023-12-02 08:34:10,179 INFO L226 Difference]: Without dead ends: 111 [2023-12-02 08:34:10,179 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-12-02 08:34:10,181 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 9 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:34:10,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 305 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:34:10,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-02 08:34:10,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-12-02 08:34:10,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 106 states have internal predecessors, (113), 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-12-02 08:34:10,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2023-12-02 08:34:10,189 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 19 [2023-12-02 08:34:10,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:34:10,189 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2023-12-02 08:34:10,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 08:34:10,190 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2023-12-02 08:34:10,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 08:34:10,190 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:34:10,191 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:34:10,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 08:34:10,191 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-12-02 08:34:10,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:34:10,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1003078539, now seen corresponding path program 1 times [2023-12-02 08:34:10,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:34:10,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441509758] [2023-12-02 08:34:10,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:34:10,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:34:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:34:10,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 08:34:10,388 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:34:10,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441509758] [2023-12-02 08:34:10,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441509758] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:34:10,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:34:10,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 08:34:10,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745186568] [2023-12-02 08:34:10,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:34:10,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:34:10,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:34:10,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:34:10,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:34:10,391 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 08:34:10,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:34:10,572 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2023-12-02 08:34:10,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:34:10,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-12-02 08:34:10,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:34:10,574 INFO L225 Difference]: With dead ends: 110 [2023-12-02 08:34:10,574 INFO L226 Difference]: Without dead ends: 110 [2023-12-02 08:34:10,574 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-12-02 08:34:10,575 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 7 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:34:10,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 365 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:34:10,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-12-02 08:34:10,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-12-02 08:34:10,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 54 states have (on average 2.074074074074074) internal successors, (112), 105 states have internal predecessors, (112), 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-12-02 08:34:10,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2023-12-02 08:34:10,582 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 19 [2023-12-02 08:34:10,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:34:10,583 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2023-12-02 08:34:10,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 08:34:10,583 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2023-12-02 08:34:10,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 08:34:10,584 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:34:10,584 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:34:10,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 08:34:10,585 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-12-02 08:34:10,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:34:10,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1885802923, now seen corresponding path program 1 times [2023-12-02 08:34:10,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:34:10,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688942224] [2023-12-02 08:34:10,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:34:10,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:34:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:34:10,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:34:10,863 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:34:10,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688942224] [2023-12-02 08:34:10,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688942224] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:34:10,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116502548] [2023-12-02 08:34:10,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:34:10,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:34:10,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:34:10,868 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:34:10,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 08:34:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:34:11,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-02 08:34:11,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:34:11,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 08:34:11,122 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 08:34:11,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-12-02 08:34:11,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:34:11,181 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:34:11,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:34:11,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116502548] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:34:11,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1344438348] [2023-12-02 08:34:11,495 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 08:34:11,495 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:34:11,499 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:34:11,503 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:34:11,503 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:34:12,626 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2023-12-02 08:34:13,304 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:34:29,333 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1640#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.base_100| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_100| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_100| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |#memory_$Pointer$.base|)) (= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (exists ((|v_#memory_$Pointer$.offset_100| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_100| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_100| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 0)))) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (exists ((|v_#memory_int_79| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_79| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_int_79| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))))) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2023-12-02 08:34:29,334 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 08:34:29,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:34:29,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2023-12-02 08:34:29,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606109551] [2023-12-02 08:34:29,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:34:29,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 08:34:29,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:34:29,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 08:34:29,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=793, Unknown=4, NotChecked=0, Total=930 [2023-12-02 08:34:29,336 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 08:34:29,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:34:29,752 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2023-12-02 08:34:29,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 08:34:29,752 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 21 [2023-12-02 08:34:29,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:34:29,753 INFO L225 Difference]: With dead ends: 117 [2023-12-02 08:34:29,754 INFO L226 Difference]: Without dead ends: 117 [2023-12-02 08:34:29,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=145, Invalid=843, Unknown=4, NotChecked=0, Total=992 [2023-12-02 08:34:29,755 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 13 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 08:34:29,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 528 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 08:34:29,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-12-02 08:34:29,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2023-12-02 08:34:29,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 58 states have (on average 2.0344827586206895) internal successors, (118), 109 states have internal predecessors, (118), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-02 08:34:29,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2023-12-02 08:34:29,763 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 21 [2023-12-02 08:34:29,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:34:29,763 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2023-12-02 08:34:29,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 08:34:29,764 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2023-12-02 08:34:29,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 08:34:29,764 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:34:29,765 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:34:29,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 08:34:29,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-02 08:34:29,971 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-12-02 08:34:29,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:34:29,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1885802922, now seen corresponding path program 1 times [2023-12-02 08:34:29,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:34:29,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109416223] [2023-12-02 08:34:29,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:34:29,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:34:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:34:30,337 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:34:30,337 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:34:30,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109416223] [2023-12-02 08:34:30,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109416223] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:34:30,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249451821] [2023-12-02 08:34:30,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:34:30,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:34:30,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:34:30,339 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:34:30,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 08:34:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:34:30,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 08:34:30,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:34:30,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 08:34:30,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 08:34:30,539 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-12-02 08:34:30,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:34:30,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 08:34:30,576 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 08:34:30,576 INFO L378 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-12-02 08:34:30,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-12-02 08:34:30,591 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:34:30,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249451821] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:34:30,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [861672593] [2023-12-02 08:34:30,692 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 08:34:30,692 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:34:30,693 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:34:30,693 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:34:30,693 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:34:31,284 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2023-12-02 08:34:31,724 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:34:47,340 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1976#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.offset_114| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_114| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_114| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 0)))) (<= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 7) (= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.base_114| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_114| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_114| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (exists ((|v_#memory_int_93| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_93| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_int_93| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))))) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2023-12-02 08:34:47,340 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 08:34:47,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 08:34:47,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2023-12-02 08:34:47,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882486051] [2023-12-02 08:34:47,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 08:34:47,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 08:34:47,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:34:47,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 08:34:47,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=561, Unknown=5, NotChecked=48, Total=702 [2023-12-02 08:34:47,342 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand has 12 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 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-12-02 08:34:47,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:34:47,782 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2023-12-02 08:34:47,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 08:34:47,783 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 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 21 [2023-12-02 08:34:47,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:34:47,783 INFO L225 Difference]: With dead ends: 117 [2023-12-02 08:34:47,784 INFO L226 Difference]: Without dead ends: 117 [2023-12-02 08:34:47,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=107, Invalid=648, Unknown=5, NotChecked=52, Total=812 [2023-12-02 08:34:47,785 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 5 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 08:34:47,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 408 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 517 Invalid, 0 Unknown, 122 Unchecked, 0.3s Time] [2023-12-02 08:34:47,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-12-02 08:34:47,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2023-12-02 08:34:47,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 58 states have (on average 2.0172413793103448) internal successors, (117), 109 states have internal predecessors, (117), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-02 08:34:47,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2023-12-02 08:34:47,789 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 21 [2023-12-02 08:34:47,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:34:47,789 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2023-12-02 08:34:47,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 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-12-02 08:34:47,789 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2023-12-02 08:34:47,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 08:34:47,790 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:34:47,790 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:34:47,794 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 08:34:47,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:34:47,990 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-12-02 08:34:47,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:34:47,991 INFO L85 PathProgramCache]: Analyzing trace with hash 219750646, now seen corresponding path program 1 times [2023-12-02 08:34:47,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:34:47,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857223331] [2023-12-02 08:34:47,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:34:47,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:34:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:34:48,083 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 08:34:48,083 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:34:48,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857223331] [2023-12-02 08:34:48,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857223331] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:34:48,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214483209] [2023-12-02 08:34:48,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:34:48,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:34:48,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:34:48,085 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:34:48,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 08:34:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:34:48,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 08:34:48,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:34:48,219 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 08:34:48,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:34:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 08:34:48,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214483209] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:34:48,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [926834733] [2023-12-02 08:34:48,254 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-12-02 08:34:48,254 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:34:48,254 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:34:48,254 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:34:48,255 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:34:48,909 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-12-02 08:34:49,015 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:34:58,975 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2363#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (not (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2023-12-02 08:34:58,976 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 08:34:58,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:34:58,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2023-12-02 08:34:58,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962334157] [2023-12-02 08:34:58,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:34:58,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:34:58,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:34:58,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:34:58,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=358, Unknown=4, NotChecked=0, Total=420 [2023-12-02 08:34:58,978 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 08:34:59,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:34:59,059 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2023-12-02 08:34:59,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:34:59,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2023-12-02 08:34:59,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:34:59,060 INFO L225 Difference]: With dead ends: 116 [2023-12-02 08:34:59,060 INFO L226 Difference]: Without dead ends: 116 [2023-12-02 08:34:59,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=63, Invalid=395, Unknown=4, NotChecked=0, Total=462 [2023-12-02 08:34:59,061 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 3 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:34:59,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 476 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:34:59,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-02 08:34:59,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2023-12-02 08:34:59,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 58 states have (on average 2.0) internal successors, (116), 109 states have internal predecessors, (116), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-02 08:34:59,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2023-12-02 08:34:59,065 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 23 [2023-12-02 08:34:59,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:34:59,066 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2023-12-02 08:34:59,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 08:34:59,066 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2023-12-02 08:34:59,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 08:34:59,067 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:34:59,067 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-12-02 08:34:59,072 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 08:34:59,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:34:59,268 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-12-02 08:34:59,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:34:59,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1782643319, now seen corresponding path program 1 times [2023-12-02 08:34:59,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:34:59,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765067353] [2023-12-02 08:34:59,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:34:59,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:34:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:34:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 08:34:59,335 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:34:59,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765067353] [2023-12-02 08:34:59,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765067353] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:34:59,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007113292] [2023-12-02 08:34:59,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:34:59,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:34:59,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:34:59,336 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:34:59,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 08:34:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:34:59,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 08:34:59,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:34:59,519 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 08:34:59,519 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:34:59,536 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 08:34:59,536 INFO L378 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 12 treesize of output 11 [2023-12-02 08:34:59,556 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 08:34:59,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007113292] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:34:59,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2048695506] [2023-12-02 08:34:59,559 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 08:34:59,559 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:34:59,559 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:34:59,560 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:34:59,560 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:35:00,451 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2023-12-02 08:35:00,861 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:35:16,792 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2754#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (not (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) (= |ULTIMATE.start_dll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2023-12-02 08:35:16,792 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 08:35:16,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:35:16,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2023-12-02 08:35:16,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699094007] [2023-12-02 08:35:16,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:35:16,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 08:35:16,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:35:16,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 08:35:16,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=357, Unknown=5, NotChecked=0, Total=420 [2023-12-02 08:35:16,794 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 08:35:16,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:35:16,941 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2023-12-02 08:35:16,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 08:35:16,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-12-02 08:35:16,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:35:16,943 INFO L225 Difference]: With dead ends: 120 [2023-12-02 08:35:16,943 INFO L226 Difference]: Without dead ends: 120 [2023-12-02 08:35:16,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=64, Invalid=393, Unknown=5, NotChecked=0, Total=462 [2023-12-02 08:35:16,944 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 7 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:35:16,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 206 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:35:16,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-02 08:35:16,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2023-12-02 08:35:16,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 112 states have internal predecessors, (121), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-02 08:35:16,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2023-12-02 08:35:16,949 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 24 [2023-12-02 08:35:16,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:35:16,949 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2023-12-02 08:35:16,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 08:35:16,949 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2023-12-02 08:35:16,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 08:35:16,950 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:35:16,950 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-12-02 08:35:16,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-02 08:35:17,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:35:17,151 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-12-02 08:35:17,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:35:17,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1782643318, now seen corresponding path program 1 times [2023-12-02 08:35:17,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:35:17,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993580768] [2023-12-02 08:35:17,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:35:17,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:35:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:35:17,326 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 08:35:17,327 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:35:17,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993580768] [2023-12-02 08:35:17,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993580768] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:35:17,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824168570] [2023-12-02 08:35:17,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:35:17,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:35:17,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:35:17,328 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:35:17,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 08:35:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:35:17,456 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 08:35:17,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:35:17,546 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 08:35:17,546 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:35:17,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:35:17,573 INFO L378 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 19 treesize of output 23 [2023-12-02 08:35:17,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 08:35:17,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824168570] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:35:17,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2030593678] [2023-12-02 08:35:17,679 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 08:35:17,680 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:35:17,680 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:35:17,680 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:35:17,680 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:35:18,478 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2023-12-02 08:35:18,915 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:35:35,223 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3163#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (= |ULTIMATE.start_dll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (<= (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 3) (= |ULTIMATE.start_dll_circular_create_~data#1| 1))' at error location [2023-12-02 08:35:35,223 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 08:35:35,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:35:35,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2023-12-02 08:35:35,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106512507] [2023-12-02 08:35:35,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:35:35,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 08:35:35,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:35:35,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 08:35:35,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=823, Unknown=4, NotChecked=0, Total=930 [2023-12-02 08:35:35,225 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand has 15 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-02 08:35:35,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:35:35,479 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2023-12-02 08:35:35,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 08:35:35,479 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 24 [2023-12-02 08:35:35,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:35:35,480 INFO L225 Difference]: With dead ends: 122 [2023-12-02 08:35:35,480 INFO L226 Difference]: Without dead ends: 122 [2023-12-02 08:35:35,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=120, Invalid=932, Unknown=4, NotChecked=0, Total=1056 [2023-12-02 08:35:35,481 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 16 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:35:35,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 839 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:35:35,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-02 08:35:35,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2023-12-02 08:35:35,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 61 states have (on average 1.9672131147540983) internal successors, (120), 112 states have internal predecessors, (120), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-02 08:35:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2023-12-02 08:35:35,484 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 24 [2023-12-02 08:35:35,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:35:35,485 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2023-12-02 08:35:35,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-02 08:35:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2023-12-02 08:35:35,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 08:35:35,485 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:35:35,485 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:35:35,490 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 08:35:35,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:35:35,686 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-12-02 08:35:35,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:35:35,686 INFO L85 PathProgramCache]: Analyzing trace with hash 572631964, now seen corresponding path program 1 times [2023-12-02 08:35:35,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:35:35,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390476556] [2023-12-02 08:35:35,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:35:35,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:35:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:35:35,795 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 08:35:35,795 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:35:35,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390476556] [2023-12-02 08:35:35,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390476556] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:35:35,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:35:35,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 08:35:35,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104794761] [2023-12-02 08:35:35,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:35:35,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 08:35:35,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:35:35,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 08:35:35,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-02 08:35:35,798 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 08:35:36,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:35:36,018 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2023-12-02 08:35:36,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 08:35:36,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-12-02 08:35:36,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:35:36,021 INFO L225 Difference]: With dead ends: 118 [2023-12-02 08:35:36,021 INFO L226 Difference]: Without dead ends: 118 [2023-12-02 08:35:36,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:35:36,021 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 9 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:35:36,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 351 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:35:36,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-02 08:35:36,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2023-12-02 08:35:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 61 states have (on average 1.9508196721311475) internal successors, (119), 111 states have internal predecessors, (119), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-02 08:35:36,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2023-12-02 08:35:36,026 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 25 [2023-12-02 08:35:36,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:35:36,026 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2023-12-02 08:35:36,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 08:35:36,026 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2023-12-02 08:35:36,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 08:35:36,027 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:35:36,027 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:35:36,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 08:35:36,028 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-12-02 08:35:36,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:35:36,028 INFO L85 PathProgramCache]: Analyzing trace with hash 572631965, now seen corresponding path program 1 times [2023-12-02 08:35:36,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:35:36,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682353492] [2023-12-02 08:35:36,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:35:36,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:35:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:35:36,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 08:35:36,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:35:36,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682353492] [2023-12-02 08:35:36,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682353492] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:35:36,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:35:36,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 08:35:36,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526674834] [2023-12-02 08:35:36,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:35:36,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 08:35:36,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:35:36,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 08:35:36,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-02 08:35:36,229 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 08:35:36,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:35:36,458 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2023-12-02 08:35:36,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 08:35:36,458 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-12-02 08:35:36,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:35:36,459 INFO L225 Difference]: With dead ends: 116 [2023-12-02 08:35:36,459 INFO L226 Difference]: Without dead ends: 116 [2023-12-02 08:35:36,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-02 08:35:36,460 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 7 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:35:36,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 381 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:35:36,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-02 08:35:36,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2023-12-02 08:35:36,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 61 states have (on average 1.9344262295081966) internal successors, (118), 110 states have internal predecessors, (118), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-02 08:35:36,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2023-12-02 08:35:36,465 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 25 [2023-12-02 08:35:36,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:35:36,465 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2023-12-02 08:35:36,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 08:35:36,465 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2023-12-02 08:35:36,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 08:35:36,466 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:35:36,466 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:35:36,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 08:35:36,467 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-12-02 08:35:36,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:35:36,467 INFO L85 PathProgramCache]: Analyzing trace with hash -235684963, now seen corresponding path program 1 times [2023-12-02 08:35:36,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:35:36,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53083381] [2023-12-02 08:35:36,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:35:36,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:35:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:35:36,917 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 08:35:36,917 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:35:36,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53083381] [2023-12-02 08:35:36,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53083381] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:35:36,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320558671] [2023-12-02 08:35:36,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:35:36,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:35:36,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:35:36,918 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:35:36,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 08:35:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:35:37,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-02 08:35:37,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:35:37,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 08:35:37,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 08:35:37,109 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 08:35:37,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-12-02 08:35:37,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-12-02 08:35:37,172 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-12-02 08:35:37,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:35:37,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 08:35:37,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 08:35:37,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:35:37,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 08:35:37,290 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 10 not checked. [2023-12-02 08:35:37,290 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:35:37,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320558671] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:35:37,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1815858115] [2023-12-02 08:35:37,350 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-12-02 08:35:37,350 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:35:37,350 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:35:37,350 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:35:37,350 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:35:38,377 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 08:35:38,401 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:35:41,726 WARN L876 $PredicateComparison]: unable to prove that (and (= 2 |c_ULTIMATE.start_dll_circular_create_#in~len#1|) (let ((.cse0 (exists ((|v_#memory_$Pointer$.base_199| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_199| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_199| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0 0) 4 0) 8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8)))))) (.cse2 (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse4 (= (select |c_ULTIMATE.start_main_old_#valid#1| 2) 1)) (.cse5 (exists ((|v_#valid_178| (Array Int Int))) (and (= (select |v_#valid_178| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_178| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1))))) (.cse6 (<= 12 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (.cse7 (exists ((|v_#memory_$Pointer$.offset_199| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_199| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_199| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0 0) 4 0) 8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) |c_#memory_$Pointer$.offset|))) (.cse8 (exists ((|v_#length_153| (Array Int Int))) (= (store |v_#length_153| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 12) |c_#length|))) (.cse9 (<= (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse10 (= (select |c_ULTIMATE.start_main_old_#valid#1| 1) 1)) (.cse11 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (.cse12 (exists ((|v_#memory_int_180| (Array Int (Array Int Int))) (|v_#memory_int_178| (Array Int (Array Int Int))) (|v_#memory_int_179| (Array Int (Array Int Int)))) (let ((.cse17 (select |v_#memory_int_179| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse18 (select |v_#memory_int_180| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= (store |v_#memory_int_178| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |v_#memory_int_178| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0 (select .cse17 0))) |v_#memory_int_179|) (= (store |v_#memory_int_180| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse18 8 1)) |c_#memory_int|) (= |v_#memory_int_180| (store |v_#memory_int_179| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse17 4 (select .cse18 4)))))))) (.cse13 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse14 (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))) (.cse15 (exists ((|v_#length_152| (Array Int Int))) (and (= (select |v_#length_152| 2) 22) (= 2 (select |v_#length_152| 1)))))) (or (and .cse0 (exists ((|v_#memory_int_BEFORE_CALL_68| (Array Int (Array Int Int)))) (let ((.cse1 (select |v_#memory_int_BEFORE_CALL_68| 1))) (and (= (select .cse1 1) 0) (= 48 (select .cse1 0))))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (exists ((|v_#memory_int_BEFORE_CALL_70| (Array Int (Array Int Int)))) (let ((.cse16 (select |v_#memory_int_BEFORE_CALL_70| 1))) (and (= (select .cse16 0) 48) (= (select .cse16 1) 0)))) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_#in~data#1| 1) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_~len#1| 2) (<= 2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~data#1| 1) (= |c_ULTIMATE.start_main_~len~0#1| 2)) is different from true [2023-12-02 08:35:54,764 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4037#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 0) (or (and (exists ((|v_#memory_$Pointer$.offset_199| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_199| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_199| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8))))) (= |ULTIMATE.start_dll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_153| (Array Int Int))) (= |#length| (store |v_#length_153| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 12))) (exists ((|v_#memory_int_180| (Array Int (Array Int Int))) (|v_#memory_int_178| (Array Int (Array Int Int))) (|v_#memory_int_179| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_178| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_178| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_179| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_179|) (= |#memory_int| (store |v_#memory_int_180| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_180| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8 1))) (= (store |v_#memory_int_179| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_179| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_180| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4))) |v_#memory_int_180|))) (exists ((|v_#valid_178| (Array Int Int))) (and (= (store |v_#valid_178| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_178| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_205| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_205| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_old(#length)_AFTER_CALL_46| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (Array Int (Array Int Int))) (|v_#memory_int_184| (Array Int (Array Int Int))) (|v_#memory_int_185| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_76| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (store (store |v_#memory_$Pointer$.base_205| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.base_205| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 |ULTIMATE.start_dll_circular_create_#res#1.base|)) |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select (store |v_#memory_$Pointer$.base_205| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.base_205| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 |ULTIMATE.start_dll_circular_create_#res#1.base|)) |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)))) (= (select |v_old(#valid)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 1) (= (store |v_#memory_int_185| |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |v_#memory_int_185| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |v_#memory_int_BEFORE_CALL_76| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) |v_#memory_int_BEFORE_CALL_76|) (= (select |v_old(#valid)_AFTER_CALL_46| |ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (<= 4 (select |v_old(#length)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (= (store |v_#memory_int_184| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_int_184| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 (select (select |v_#memory_int_185| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0))) |v_#memory_int_185|) (= (select (select (store (store |v_#memory_$Pointer$.offset_205| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_205| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 0)) |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select (store |v_#memory_$Pointer$.offset_205| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_205| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 0)) |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_dll_circular_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (<= 8 (select |v_old(#length)_AFTER_CALL_46| |ULTIMATE.start_dll_circular_create_#res#1.base|)))) (not (= |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 0)) (<= (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_199| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_199| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.base_199| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8))) |#memory_$Pointer$.base|)) (= |ULTIMATE.start_dll_circular_prepend_~head#1.base| |ULTIMATE.start_dll_circular_prepend_#in~head#1.base|)) (and (exists ((|v_#memory_$Pointer$.offset_199| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_199| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_199| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8))))) (= |ULTIMATE.start_dll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_153| (Array Int Int))) (= |#length| (store |v_#length_153| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 12))) (exists ((|v_#memory_int_180| (Array Int (Array Int Int))) (|v_#memory_int_178| (Array Int (Array Int Int))) (|v_#memory_int_179| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_178| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_178| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_179| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_179|) (= |#memory_int| (store |v_#memory_int_180| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_180| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8 1))) (= (store |v_#memory_int_179| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_179| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_180| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4))) |v_#memory_int_180|))) (exists ((|v_#valid_178| (Array Int Int))) (and (= (store |v_#valid_178| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_178| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0))) (not (= |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 0)) (<= (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_199| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_199| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.base_199| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8))) |#memory_$Pointer$.base|)) (exists ((|v_old(#length)_AFTER_CALL_47| (Array Int Int)) (|v_#memory_$Pointer$.offset_205| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_47| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_205| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_47| (Array Int Int)) (|v_#memory_int_184| (Array Int (Array Int Int))) (|v_#memory_int_185| (Array Int (Array Int Int)))) (and (= |v_#memory_int_185| (store |v_#memory_int_184| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_int_184| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 (select (select |v_#memory_int_185| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_dll_circular_create_#res#1.base|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (store (store |v_#memory_$Pointer$.base_205| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.base_205| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 |ULTIMATE.start_dll_circular_create_#res#1.base|)) |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select (store |v_#memory_$Pointer$.base_205| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.base_205| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 |ULTIMATE.start_dll_circular_create_#res#1.base|)) |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)))) (= (select (select (store (store |v_#memory_$Pointer$.offset_205| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_205| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 0)) |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select (store |v_#memory_$Pointer$.offset_205| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_205| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 0)) |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 8 (select |v_old(#length)_AFTER_CALL_47| |ULTIMATE.start_dll_circular_create_#res#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 1) (<= 4 (select |v_old(#length)_AFTER_CALL_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (= (select |v_old(#valid)_AFTER_CALL_47| |ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |v_old(#memory_int)_AFTER_CALL_47| (store |v_#memory_int_185| |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |v_#memory_int_185| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_47| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)))))) (= |ULTIMATE.start_dll_circular_prepend_~head#1.base| |ULTIMATE.start_dll_circular_prepend_#in~head#1.base|))) (= |ULTIMATE.start_dll_circular_prepend_#in~data#1| 1) (= |ULTIMATE.start_dll_circular_prepend_~head#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 1)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_prepend_~data#1| 1) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_prepend_#in~head#1.offset| 0))' at error location [2023-12-02 08:35:54,764 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 08:35:54,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 08:35:54,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2023-12-02 08:35:54,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063664776] [2023-12-02 08:35:54,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 08:35:54,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 08:35:54,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:35:54,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 08:35:54,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1212, Unknown=11, NotChecked=142, Total=1482 [2023-12-02 08:35:54,766 INFO L87 Difference]: Start difference. First operand 116 states and 126 transitions. Second operand has 18 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 15 states have internal predecessors, (46), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 08:35:55,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:35:55,344 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2023-12-02 08:35:55,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 08:35:55,344 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 15 states have internal predecessors, (46), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2023-12-02 08:35:55,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:35:55,345 INFO L225 Difference]: With dead ends: 125 [2023-12-02 08:35:55,345 INFO L226 Difference]: Without dead ends: 125 [2023-12-02 08:35:55,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=146, Invalid=1408, Unknown=14, NotChecked=154, Total=1722 [2023-12-02 08:35:55,347 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 324 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 08:35:55,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 288 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 484 Invalid, 0 Unknown, 120 Unchecked, 0.3s Time] [2023-12-02 08:35:55,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-12-02 08:35:55,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 108. [2023-12-02 08:35:55,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 61 states have (on average 1.8032786885245902) internal successors, (110), 102 states have internal predecessors, (110), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-02 08:35:55,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2023-12-02 08:35:55,351 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 34 [2023-12-02 08:35:55,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:35:55,351 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2023-12-02 08:35:55,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 15 states have internal predecessors, (46), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 08:35:55,351 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2023-12-02 08:35:55,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 08:35:55,352 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:35:55,352 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:35:55,356 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 08:35:55,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-02 08:35:55,552 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-12-02 08:35:55,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:35:55,553 INFO L85 PathProgramCache]: Analyzing trace with hash -235684962, now seen corresponding path program 1 times [2023-12-02 08:35:55,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:35:55,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142080549] [2023-12-02 08:35:55,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:35:55,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:35:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:35:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 08:35:56,020 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:35:56,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142080549] [2023-12-02 08:35:56,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142080549] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:35:56,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977984306] [2023-12-02 08:35:56,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:35:56,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:35:56,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:35:56,021 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:35:56,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 08:35:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:35:56,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 08:35:56,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:35:56,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 08:35:56,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 08:35:56,245 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|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2023-12-02 08:35:56,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:35:56,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 08:35:56,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 08:35:56,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:35:56,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 08:35:56,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 08:35:56,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:35:56,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 08:35:56,457 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-02 08:35:56,457 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:35:56,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977984306] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:35:56,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 08:35:56,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2023-12-02 08:35:56,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939573874] [2023-12-02 08:35:56,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:35:56,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 08:35:56,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:35:56,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 08:35:56,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=169, Unknown=1, NotChecked=26, Total=240 [2023-12-02 08:35:56,458 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 08:35:56,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:35:56,625 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2023-12-02 08:35:56,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 08:35:56,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2023-12-02 08:35:56,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:35:56,626 INFO L225 Difference]: With dead ends: 103 [2023-12-02 08:35:56,626 INFO L226 Difference]: Without dead ends: 103 [2023-12-02 08:35:56,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=194, Unknown=1, NotChecked=28, Total=272 [2023-12-02 08:35:56,627 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 34 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:35:56,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 229 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 197 Invalid, 0 Unknown, 128 Unchecked, 0.1s Time] [2023-12-02 08:35:56,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-02 08:35:56,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-12-02 08:35:56,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 61 states have (on average 1.721311475409836) internal successors, (105), 97 states have internal predecessors, (105), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-02 08:35:56,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2023-12-02 08:35:56,631 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 34 [2023-12-02 08:35:56,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:35:56,632 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2023-12-02 08:35:56,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 08:35:56,632 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2023-12-02 08:35:56,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 08:35:56,633 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:35:56,633 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:35:56,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-02 08:35:56,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-02 08:35:56,834 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-12-02 08:35:56,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:35:56,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1077001948, now seen corresponding path program 1 times [2023-12-02 08:35:56,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:35:56,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835009964] [2023-12-02 08:35:56,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:35:56,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:35:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:35:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-02 08:35:56,901 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:35:56,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835009964] [2023-12-02 08:35:56,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835009964] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:35:56,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:35:56,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 08:35:56,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144355713] [2023-12-02 08:35:56,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:35:56,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 08:35:56,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:35:56,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 08:35:56,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:35:56,902 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 08:35:56,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:35:56,935 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2023-12-02 08:35:56,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 08:35:56,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2023-12-02 08:35:56,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:35:56,936 INFO L225 Difference]: With dead ends: 91 [2023-12-02 08:35:56,936 INFO L226 Difference]: Without dead ends: 91 [2023-12-02 08:35:56,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:35:56,937 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 4 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 08:35:56,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 161 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 08:35:56,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-02 08:35:56,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-12-02 08:35:56,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 86 states have internal predecessors, (91), 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-12-02 08:35:56,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2023-12-02 08:35:56,940 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 34 [2023-12-02 08:35:56,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:35:56,940 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2023-12-02 08:35:56,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 08:35:56,941 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2023-12-02 08:35:56,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 08:35:56,942 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:35:56,942 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:35:56,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 08:35:56,942 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-12-02 08:35:56,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:35:56,942 INFO L85 PathProgramCache]: Analyzing trace with hash 980814136, now seen corresponding path program 1 times [2023-12-02 08:35:56,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:35:56,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931230985] [2023-12-02 08:35:56,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:35:56,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:35:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:35:57,034 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 08:35:57,034 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:35:57,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931230985] [2023-12-02 08:35:57,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931230985] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:35:57,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:35:57,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 08:35:57,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324587923] [2023-12-02 08:35:57,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:35:57,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:35:57,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:35:57,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:35:57,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:35:57,036 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 6 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 08:35:57,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:35:57,190 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2023-12-02 08:35:57,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:35:57,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2023-12-02 08:35:57,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:35:57,191 INFO L225 Difference]: With dead ends: 87 [2023-12-02 08:35:57,191 INFO L226 Difference]: Without dead ends: 87 [2023-12-02 08:35:57,192 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-12-02 08:35:57,192 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 23 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:35:57,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 217 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:35:57,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-02 08:35:57,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-12-02 08:35:57,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 82 states have internal predecessors, (87), 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-12-02 08:35:57,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2023-12-02 08:35:57,196 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 37 [2023-12-02 08:35:57,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:35:57,196 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2023-12-02 08:35:57,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 08:35:57,196 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2023-12-02 08:35:57,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 08:35:57,197 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:35:57,197 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:35:57,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-02 08:35:57,197 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-12-02 08:35:57,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:35:57,197 INFO L85 PathProgramCache]: Analyzing trace with hash 980814137, now seen corresponding path program 1 times [2023-12-02 08:35:57,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:35:57,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160291945] [2023-12-02 08:35:57,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:35:57,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:35:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:35:57,380 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-02 08:35:57,380 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:35:57,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160291945] [2023-12-02 08:35:57,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160291945] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:35:57,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:35:57,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 08:35:57,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798074362] [2023-12-02 08:35:57,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:35:57,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:35:57,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:35:57,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:35:57,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:35:57,382 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 08:35:57,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:35:57,536 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2023-12-02 08:35:57,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:35:57,537 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2023-12-02 08:35:57,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:35:57,538 INFO L225 Difference]: With dead ends: 83 [2023-12-02 08:35:57,538 INFO L226 Difference]: Without dead ends: 83 [2023-12-02 08:35:57,538 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-12-02 08:35:57,538 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 18 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:35:57,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 229 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:35:57,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-02 08:35:57,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-12-02 08:35:57,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.537037037037037) internal successors, (83), 78 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-12-02 08:35:57,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2023-12-02 08:35:57,542 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 37 [2023-12-02 08:35:57,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:35:57,542 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2023-12-02 08:35:57,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 08:35:57,542 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2023-12-02 08:35:57,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 08:35:57,543 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:35:57,543 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:35:57,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-02 08:35:57,544 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-12-02 08:35:57,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:35:57,544 INFO L85 PathProgramCache]: Analyzing trace with hash 980825059, now seen corresponding path program 1 times [2023-12-02 08:35:57,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:35:57,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200849459] [2023-12-02 08:35:57,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:35:57,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:35:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:35:58,071 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 08:35:58,071 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:35:58,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200849459] [2023-12-02 08:35:58,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200849459] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:35:58,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026069222] [2023-12-02 08:35:58,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:35:58,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:35:58,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:35:58,073 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:35:58,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 08:35:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:35:58,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-02 08:35:58,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:35:58,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-12-02 08:35:58,533 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|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-12-02 08:35:58,563 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-12-02 08:35:58,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2023-12-02 08:35:58,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:35:58,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-12-02 08:35:58,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 08:35:58,601 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 08:35:58,602 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:35:58,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026069222] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:35:58,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 08:35:58,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 22 [2023-12-02 08:35:58,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883569667] [2023-12-02 08:35:58,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:35:58,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 08:35:58,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:35:58,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 08:35:58,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=402, Unknown=1, NotChecked=40, Total=506 [2023-12-02 08:35:58,604 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 12 states, 9 states have (on average 2.888888888888889) internal successors, (26), 11 states have internal predecessors, (26), 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-12-02 08:35:58,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:35:58,958 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2023-12-02 08:35:58,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 08:35:58,958 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.888888888888889) internal successors, (26), 11 states have internal predecessors, (26), 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 37 [2023-12-02 08:35:58,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:35:58,959 INFO L225 Difference]: With dead ends: 82 [2023-12-02 08:35:58,959 INFO L226 Difference]: Without dead ends: 82 [2023-12-02 08:35:58,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=514, Unknown=1, NotChecked=46, Total=650 [2023-12-02 08:35:58,960 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 74 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 08:35:58,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 283 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 470 Invalid, 0 Unknown, 87 Unchecked, 0.3s Time] [2023-12-02 08:35:58,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-02 08:35:58,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-12-02 08:35:58,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 77 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-12-02 08:35:58,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2023-12-02 08:35:58,962 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 37 [2023-12-02 08:35:58,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:35:58,962 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2023-12-02 08:35:58,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.888888888888889) internal successors, (26), 11 states have internal predecessors, (26), 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-12-02 08:35:58,963 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2023-12-02 08:35:58,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 08:35:58,963 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:35:58,963 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:35:58,968 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 08:35:59,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:35:59,164 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-12-02 08:35:59,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:35:59,164 INFO L85 PathProgramCache]: Analyzing trace with hash 980825060, now seen corresponding path program 1 times [2023-12-02 08:35:59,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:35:59,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122575214] [2023-12-02 08:35:59,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:35:59,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:35:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:36:00,511 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 08:36:00,511 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:36:00,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122575214] [2023-12-02 08:36:00,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122575214] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:36:00,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216024247] [2023-12-02 08:36:00,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:36:00,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:36:00,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:36:00,512 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:36:00,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 08:36:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:36:00,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 59 conjunts are in the unsatisfiable core [2023-12-02 08:36:00,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:36:00,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 08:36:00,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-12-02 08:36:00,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-02 08:36:01,013 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|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-12-02 08:36:01,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:36:01,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-12-02 08:36:01,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:36:01,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-12-02 08:36:01,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:36:01,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-12-02 08:36:01,058 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-02 08:36:01,059 INFO L378 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 15 treesize of output 15 [2023-12-02 08:36:01,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-12-02 08:36:01,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-12-02 08:36:01,142 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-12-02 08:36:01,142 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:36:01,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216024247] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:36:01,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [32181007] [2023-12-02 08:36:01,422 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-12-02 08:36:01,422 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:36:01,422 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:36:01,422 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:36:01,423 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:36:02,543 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 08:36:02,561 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:36:45,186 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5618#(and (<= 2 |ULTIMATE.start_dll_circular_prepend_#in~head#1.base|) (= |ULTIMATE.start_dll_circular_prepend_#t~mem11#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0)) (<= 1 |#StackHeapBarrier|) (or (< (+ |ULTIMATE.start_dll_circular_prepend_#t~mem11#1.offset| 4) 0) (< (select |#length| |ULTIMATE.start_dll_circular_prepend_#t~mem11#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_#t~mem11#1.offset| 8))) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_prepend_~head#1.base|)) (= |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 0) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0) 0))) (= |ULTIMATE.start_dll_circular_prepend_#in~data#1| 1) (= |ULTIMATE.start_dll_circular_prepend_~head#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_dll_circular_prepend_#t~mem11#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_prepend_~data#1| 1) (= (select |#valid| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_circular_prepend_#in~head#1.offset| 0) (or (and (= |ULTIMATE.start_dll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_222| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_222| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_222| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8))))) (not (= |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 0)) (exists ((|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_#memory_$Pointer$.offset_228| (Array Int (Array Int Int))) (|v_#memory_int_202| (Array Int (Array Int Int))) (|v_#memory_int_203| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_63| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_63| (Array Int Int)) (|v_#memory_int_BEFORE_CALL_95| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_231| (Array Int (Array Int Int)))) (and (= (select |v_old(#valid)_AFTER_CALL_63| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 1) (= |ULTIMATE.start_dll_circular_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (select |v_old(#valid)_AFTER_CALL_63| |ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (<= 8 (select |v_old(#length)_AFTER_CALL_63| |ULTIMATE.start_dll_circular_create_#res#1.base|)) (= (store |v_#memory_int_202| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_int_202| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 (select (select |v_#memory_int_203| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0))) |v_#memory_int_203|) (<= 4 (select |v_old(#length)_AFTER_CALL_63| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (= (store |v_#memory_int_203| |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |v_#memory_int_203| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |v_#memory_int_BEFORE_CALL_95| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) |v_#memory_int_BEFORE_CALL_95|) (= (store (store |v_#memory_$Pointer$.base_231| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.base_231| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 |ULTIMATE.start_dll_circular_create_#res#1.base|)) |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select (store |v_#memory_$Pointer$.base_231| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.base_231| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 |ULTIMATE.start_dll_circular_create_#res#1.base|)) |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_63|) (= (select (select (store (store |v_#memory_$Pointer$.offset_228| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_228| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 0)) |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select (store |v_#memory_$Pointer$.offset_228| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_228| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 0)) |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (<= (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_167| (Array Int Int))) (= (store |v_#length_167| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 12) |#length|)) (exists ((|v_#memory_$Pointer$.base_225| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_225| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.base_225| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8))))) (exists ((|v_#valid_189| (Array Int Int))) (and (= |#valid| (store |v_#valid_189| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1)) (= (select |v_#valid_189| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0))) (= |ULTIMATE.start_dll_circular_prepend_~head#1.base| |ULTIMATE.start_dll_circular_prepend_#in~head#1.base|) (exists ((|v_#memory_int_198| (Array Int (Array Int Int))) (|v_#memory_int_196| (Array Int (Array Int Int))) (|v_#memory_int_197| (Array Int (Array Int Int)))) (and (= |v_#memory_int_198| (store |v_#memory_int_197| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_197| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_198| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4)))) (= (store |v_#memory_int_196| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_196| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_197| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_197|) (= |#memory_int| (store |v_#memory_int_198| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_198| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8 1)))))) (and (= |ULTIMATE.start_dll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_222| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_222| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_222| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8))))) (not (= |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 0)) (<= (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#memory_$Pointer$.offset_228| (Array Int (Array Int Int))) (|v_#memory_int_202| (Array Int (Array Int Int))) (|v_#memory_int_203| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_97| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_231| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_107| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_64| |ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= (store |v_#memory_int_202| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_int_202| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 (select (select |v_#memory_int_203| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0))) |v_#memory_int_203|) (= (select |v_old(#valid)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 1) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_dll_circular_create_#res#1.base|) (<= 4 (select |v_#length_BEFORE_CALL_107| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (= (store (store |v_#memory_$Pointer$.base_231| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.base_231| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 |ULTIMATE.start_dll_circular_create_#res#1.base|)) |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select (store |v_#memory_$Pointer$.base_231| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.base_231| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 |ULTIMATE.start_dll_circular_create_#res#1.base|)) |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_64|) (= (store |v_#memory_int_203| |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |v_#memory_int_203| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |v_#memory_int_BEFORE_CALL_97| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) |v_#memory_int_BEFORE_CALL_97|) (<= 8 (select |v_#length_BEFORE_CALL_107| |ULTIMATE.start_dll_circular_create_#res#1.base|)) (= (select (select (store (store |v_#memory_$Pointer$.offset_228| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_228| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 0)) |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select (store |v_#memory_$Pointer$.offset_228| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_228| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 0)) |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (exists ((|v_#length_167| (Array Int Int))) (= (store |v_#length_167| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 12) |#length|)) (exists ((|v_#memory_$Pointer$.base_225| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_225| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.base_225| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 0) 4 0) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8))))) (exists ((|v_#valid_189| (Array Int Int))) (and (= |#valid| (store |v_#valid_189| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1)) (= (select |v_#valid_189| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0))) (= |ULTIMATE.start_dll_circular_prepend_~head#1.base| |ULTIMATE.start_dll_circular_prepend_#in~head#1.base|) (exists ((|v_#memory_int_198| (Array Int (Array Int Int))) (|v_#memory_int_196| (Array Int (Array Int Int))) (|v_#memory_int_197| (Array Int (Array Int Int)))) (and (= |v_#memory_int_198| (store |v_#memory_int_197| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_197| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_198| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4)))) (= (store |v_#memory_int_196| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_196| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_197| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_197|) (= |#memory_int| (store |v_#memory_int_198| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_198| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8 1))))))))' at error location [2023-12-02 08:36:45,186 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 08:36:45,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 08:36:45,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2023-12-02 08:36:45,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896540378] [2023-12-02 08:36:45,187 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 08:36:45,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-02 08:36:45,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:36:45,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-02 08:36:45,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2355, Unknown=23, NotChecked=98, Total=2652 [2023-12-02 08:36:45,188 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 26 states, 19 states have (on average 2.789473684210526) internal successors, (53), 23 states have internal predecessors, (53), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 08:36:46,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:36:46,709 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2023-12-02 08:36:46,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 08:36:46,710 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 19 states have (on average 2.789473684210526) internal successors, (53), 23 states have internal predecessors, (53), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2023-12-02 08:36:46,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:36:46,710 INFO L225 Difference]: With dead ends: 81 [2023-12-02 08:36:46,710 INFO L226 Difference]: Without dead ends: 81 [2023-12-02 08:36:46,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 44.2s TimeCoverageRelationStatistics Valid=250, Invalid=3265, Unknown=29, NotChecked=116, Total=3660 [2023-12-02 08:36:46,712 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 138 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 08:36:46,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 535 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 934 Invalid, 0 Unknown, 86 Unchecked, 0.8s Time] [2023-12-02 08:36:46,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-02 08:36:46,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-12-02 08:36:46,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.5) internal successors, (81), 76 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-12-02 08:36:46,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2023-12-02 08:36:46,715 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 37 [2023-12-02 08:36:46,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:36:46,715 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2023-12-02 08:36:46,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 19 states have (on average 2.789473684210526) internal successors, (53), 23 states have internal predecessors, (53), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 08:36:46,715 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2023-12-02 08:36:46,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 08:36:46,715 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:36:46,715 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:36:46,721 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 08:36:46,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:36:46,916 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-12-02 08:36:46,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:36:46,917 INFO L85 PathProgramCache]: Analyzing trace with hash 771436771, now seen corresponding path program 1 times [2023-12-02 08:36:46,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:36:46,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106155783] [2023-12-02 08:36:46,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:36:46,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:36:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:36:47,137 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-02 08:36:47,137 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:36:47,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106155783] [2023-12-02 08:36:47,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106155783] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:36:47,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:36:47,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 08:36:47,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562825488] [2023-12-02 08:36:47,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:36:47,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 08:36:47,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:36:47,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 08:36:47,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-02 08:36:47,139 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 08:36:47,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:36:47,238 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2023-12-02 08:36:47,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:36:47,238 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2023-12-02 08:36:47,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:36:47,239 INFO L225 Difference]: With dead ends: 78 [2023-12-02 08:36:47,239 INFO L226 Difference]: Without dead ends: 78 [2023-12-02 08:36:47,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-12-02 08:36:47,240 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 88 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:36:47,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 176 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:36:47,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-02 08:36:47,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-12-02 08:36:47,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 73 states have internal predecessors, (78), 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-12-02 08:36:47,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2023-12-02 08:36:47,244 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 40 [2023-12-02 08:36:47,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:36:47,244 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2023-12-02 08:36:47,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 08:36:47,244 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2023-12-02 08:36:47,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 08:36:47,245 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:36:47,245 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:36:47,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-02 08:36:47,245 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-12-02 08:36:47,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:36:47,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1855259996, now seen corresponding path program 1 times [2023-12-02 08:36:47,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:36:47,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027055462] [2023-12-02 08:36:47,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:36:47,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:36:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:36:47,761 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 08:36:47,761 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:36:47,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027055462] [2023-12-02 08:36:47,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027055462] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:36:47,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357917387] [2023-12-02 08:36:47,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:36:47,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:36:47,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:36:47,763 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:36:47,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 08:36:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:36:47,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-02 08:36:47,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:36:48,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 08:36:48,119 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))))) is different from true [2023-12-02 08:36:48,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:36:48,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-12-02 08:36:48,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-02 08:36:48,171 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-12-02 08:36:48,172 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:36:48,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357917387] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:36:48,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [681592438] [2023-12-02 08:36:48,257 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2023-12-02 08:36:48,257 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:36:48,257 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:36:48,257 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:36:48,257 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:36:50,411 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 08:36:50,429 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:37:46,222 WARN L293 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 241 DAG size of output: 234 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:38:12,150 WARN L293 SmtUtils]: Spent 10.44s on a formula simplification. DAG size of input: 249 DAG size of output: 242 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:38:29,991 WARN L293 SmtUtils]: Spent 10.55s on a formula simplification. DAG size of input: 239 DAG size of output: 232 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:38:50,006 WARN L293 SmtUtils]: Spent 10.79s on a formula simplification. DAG size of input: 253 DAG size of output: 242 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:38:50,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [681592438] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:38:50,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-02 08:38:50,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [15, 15] total 49 [2023-12-02 08:38:50,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164290282] [2023-12-02 08:38:50,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:38:50,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 08:38:50,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:38:50,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 08:38:50,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2246, Unknown=37, NotChecked=96, Total=2550 [2023-12-02 08:38:50,010 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 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-12-02 08:38:55,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:38:57,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:00,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:04,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:06,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:08,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:10,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:13,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:15,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:18,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:20,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:22,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:24,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:27,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:29,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:32,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:34,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:39,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:43,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:45,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:50,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:54,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:39:56,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:40:01,203 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (exists ((|v_old(#valid)_AFTER_CALL_74| (Array Int Int)) (|v_#memory_$Pointer$.offset_249| (Array Int (Array Int Int))) (|v_#memory_int_224| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_124| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_74| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_74| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_257| (Array Int (Array Int Int))) (|v_#memory_int_223| (Array Int (Array Int Int)))) (let ((.cse38 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_74| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_74| (let ((.cse37 (store |v_#memory_$Pointer$.base_257| .cse38 (store (select |v_#memory_$Pointer$.base_257| .cse38) 0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)))) (store .cse37 |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store (select .cse37 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4 .cse38)))) (<= 8 (select |v_#length_BEFORE_CALL_124| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= (store |v_#memory_int_223| .cse38 (store (select |v_#memory_int_223| .cse38) 0 (select (select |v_#memory_int_224| .cse38) 0))) |v_#memory_int_224|) (= |v_old(#memory_int)_AFTER_CALL_74| (store |v_#memory_int_224| |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |v_#memory_int_224| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_74| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4)))) (= (select |v_old(#valid)_AFTER_CALL_74| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= (select (select (let ((.cse39 (store |v_#memory_$Pointer$.offset_249| .cse38 (store (select |v_#memory_$Pointer$.offset_249| .cse38) 0 0)))) (store .cse39 |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store (select .cse39 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4 0))) |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_74| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (= (select |v_old(#valid)_AFTER_CALL_74| .cse38) 1) (<= 4 (select |v_#length_BEFORE_CALL_124| .cse38)))))) (.cse11 (exists ((|v_#memory_$Pointer$.offset_249| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_#memory_int_224| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_75| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_257| (Array Int (Array Int Int))) (|v_#memory_int_223| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_75| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_75| (Array Int (Array Int Int)))) (let ((.cse35 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_75| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (and (= (let ((.cse34 (store |v_#memory_$Pointer$.base_257| .cse35 (store (select |v_#memory_$Pointer$.base_257| .cse35) 0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)))) (store .cse34 |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store (select .cse34 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4 .cse35))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_75|) (= |v_old(#memory_int)_AFTER_CALL_75| (store |v_#memory_int_224| |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |v_#memory_int_224| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_75| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4)))) (<= 4 (select |v_old(#length)_AFTER_CALL_75| .cse35)) (= (select |v_old(#valid)_AFTER_CALL_75| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (<= 8 (select |v_old(#length)_AFTER_CALL_75| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= (select (select (let ((.cse36 (store |v_#memory_$Pointer$.offset_249| .cse35 (store (select |v_#memory_$Pointer$.offset_249| .cse35) 0 0)))) (store .cse36 |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store (select .cse36 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4 0))) |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_75| .cse35) 1) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_75| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (= (store |v_#memory_int_223| .cse35 (store (select |v_#memory_int_223| .cse35) 0 (select (select |v_#memory_int_224| .cse35) 0))) |v_#memory_int_224|)))))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~count~0#1| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_24| Int) (|v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| Int) (|v_ULTIMATE.start_dll_circular_prepend_#in~head#1.base_6| Int) (|v_#memory_int_225| (Array Int (Array Int Int))) (|v_#memory_int_226| (Array Int (Array Int Int))) (|v_#memory_int_227| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_259| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_251| (Array Int (Array Int Int)))) (let ((.cse14 (select |v_#memory_$Pointer$.offset_251| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_24|)) (.cse15 (select |v_#memory_$Pointer$.base_259| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_24|)) (.cse0 (select |v_#memory_int_227| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|))) (and (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_24|) 1) (= |c_#memory_int| (store |v_#memory_int_227| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| (store .cse0 4 (select (select |c_#memory_int| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|) 4)))) (= (store |v_#memory_int_225| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_24| (store (select |v_#memory_int_225| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_24|) 0 (select (select |v_#memory_int_226| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_24|) 0))) |v_#memory_int_226|) (let ((.cse1 (= |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_24| |v_ULTIMATE.start_dll_circular_prepend_#in~head#1.base_6|)) (.cse2 (not (= |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| 0))) (.cse3 (exists ((|v_#memory_$Pointer$.offset_243| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_251| (store |v_#memory_$Pointer$.offset_243| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| (store (store (store (select |v_#memory_$Pointer$.offset_243| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|) 0 0) 4 0) 8 (select (select |v_#memory_$Pointer$.offset_251| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|) 8)))))) (.cse4 (exists ((|v_#memory_$Pointer$.base_251| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.base_259| (store |v_#memory_$Pointer$.base_251| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| (store (store (store (select |v_#memory_$Pointer$.base_251| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|) 0 0) 4 0) 8 (select (select |v_#memory_$Pointer$.base_259| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|) 8)))))) (.cse5 (= |v_ULTIMATE.start_dll_circular_prepend_#in~head#1.base_6| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (exists ((|v_#memory_int_217| (Array Int (Array Int Int))) (|v_#memory_int_218| (Array Int (Array Int Int))) (|v_#memory_int_219| (Array Int (Array Int Int)))) (let ((.cse12 (select |v_#memory_int_218| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|)) (.cse13 (select |v_#memory_int_219| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|))) (and (= (store |v_#memory_int_218| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| (store .cse12 4 (select .cse13 4))) |v_#memory_int_219|) (= (store |v_#memory_int_217| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| (store (select |v_#memory_int_217| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|) 0 (select .cse12 0))) |v_#memory_int_218|) (= (store |v_#memory_int_219| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| (store .cse13 8 1)) |v_#memory_int_225|))))) (.cse8 (<= (+ |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| 1) |c_#StackHeapBarrier|)) (.cse9 (exists ((|v_#length_174| (Array Int Int))) (= (store |v_#length_174| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| 12) |c_#length|))) (.cse10 (exists ((|v_#valid_196| (Array Int Int))) (and (= (select |v_#valid_196| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|) 0) (= |c_#valid| (store |v_#valid_196| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| 1)))))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6 .cse8 .cse9 .cse10))) (<= 4 (select |c_#length| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_24|)) (= (select .cse14 0) 0) (= (select .cse15 0) 0) (= (let ((.cse16 (store |v_#memory_$Pointer$.offset_251| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_24| (store .cse14 0 0)))) (store .cse16 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| (store (store (select .cse16 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|) 0 0) 4 0))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (let ((.cse17 (store |v_#memory_$Pointer$.base_259| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_24| (store .cse15 0 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|)))) (store .cse17 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| (store (store (select .cse17 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|) 0 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|) 4 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|)))) (= (store |v_#memory_int_226| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| (store (select |v_#memory_int_226| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|) 0 (select .cse0 0))) |v_#memory_int_227|)))) (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_24| Int) (|v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| Int) (|v_ULTIMATE.start_dll_circular_prepend_#in~head#1.base_6| Int) (|v_#memory_int_225| (Array Int (Array Int Int))) (|v_#memory_int_226| (Array Int (Array Int Int))) (|v_#memory_int_227| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_259| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_251| (Array Int (Array Int Int)))) (let ((.cse30 (select |v_#memory_$Pointer$.offset_251| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_24|)) (.cse31 (select |v_#memory_$Pointer$.base_259| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_24|)) (.cse18 (select |v_#memory_int_227| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|))) (and (= |c_#memory_int| (store |v_#memory_int_227| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| (store .cse18 4 (select (select |c_#memory_int| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|) 4)))) (= (store |v_#memory_int_225| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_24| (store (select |v_#memory_int_225| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_24|) 0 (select (select |v_#memory_int_226| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_24|) 0))) |v_#memory_int_226|) (let ((.cse19 (= |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_24| |v_ULTIMATE.start_dll_circular_prepend_#in~head#1.base_6|)) (.cse20 (not (= |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| 0))) (.cse21 (exists ((|v_#memory_$Pointer$.offset_243| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_251| (store |v_#memory_$Pointer$.offset_243| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| (store (store (store (select |v_#memory_$Pointer$.offset_243| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|) 0 0) 4 0) 8 (select (select |v_#memory_$Pointer$.offset_251| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|) 8)))))) (.cse22 (exists ((|v_#memory_$Pointer$.base_251| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.base_259| (store |v_#memory_$Pointer$.base_251| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| (store (store (store (select |v_#memory_$Pointer$.base_251| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|) 0 0) 4 0) 8 (select (select |v_#memory_$Pointer$.base_259| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|) 8)))))) (.cse23 (= |v_ULTIMATE.start_dll_circular_prepend_#in~head#1.base_6| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse24 (exists ((|v_#memory_int_217| (Array Int (Array Int Int))) (|v_#memory_int_218| (Array Int (Array Int Int))) (|v_#memory_int_219| (Array Int (Array Int Int)))) (let ((.cse28 (select |v_#memory_int_218| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|)) (.cse29 (select |v_#memory_int_219| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|))) (and (= (store |v_#memory_int_218| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| (store .cse28 4 (select .cse29 4))) |v_#memory_int_219|) (= (store |v_#memory_int_217| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| (store (select |v_#memory_int_217| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|) 0 (select .cse28 0))) |v_#memory_int_218|) (= (store |v_#memory_int_219| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| (store .cse29 8 1)) |v_#memory_int_225|))))) (.cse25 (<= (+ |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| 1) |c_#StackHeapBarrier|)) (.cse26 (exists ((|v_#length_174| (Array Int Int))) (= (store |v_#length_174| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| 12) |c_#length|))) (.cse27 (exists ((|v_#valid_196| (Array Int Int))) (and (= (select |v_#valid_196| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|) 0) (= |c_#valid| (store |v_#valid_196| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| 1)))))) (or (and .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse7 .cse25 .cse26 .cse27) (and .cse19 .cse20 .cse21 .cse22 .cse23 .cse11 .cse24 .cse25 .cse26 .cse27))) (= (select .cse30 0) 0) (= (select .cse31 0) 0) (= (let ((.cse32 (store |v_#memory_$Pointer$.offset_251| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_24| (store .cse30 0 0)))) (store .cse32 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| (store (store (select .cse32 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|) 0 0) 4 0))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (let ((.cse33 (store |v_#memory_$Pointer$.base_259| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_24| (store .cse31 0 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|)))) (store .cse33 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| (store (store (select .cse33 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|) 0 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|) 4 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|)))) (= (store |v_#memory_int_226| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28| (store (select |v_#memory_int_226| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_28|) 0 (select .cse18 0))) |v_#memory_int_227|)))) (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= 2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~len~0#1| 2))) is different from false [2023-12-02 08:40:03,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:40:03,165 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2023-12-02 08:40:03,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-02 08:40:03,166 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 41 [2023-12-02 08:40:03,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:40:03,166 INFO L225 Difference]: With dead ends: 81 [2023-12-02 08:40:03,166 INFO L226 Difference]: Without dead ends: 81 [2023-12-02 08:40:03,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 122.2s TimeCoverageRelationStatistics Valid=180, Invalid=2339, Unknown=39, NotChecked=198, Total=2756 [2023-12-02 08:40:03,168 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 4 mSolverCounterUnsat, 40 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 69.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 40 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 70.8s IncrementalHoareTripleChecker+Time [2023-12-02 08:40:03,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 303 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1109 Invalid, 40 Unknown, 54 Unchecked, 70.8s Time] [2023-12-02 08:40:03,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-02 08:40:03,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-12-02 08:40:03,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 76 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-12-02 08:40:03,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2023-12-02 08:40:03,170 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 41 [2023-12-02 08:40:03,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:40:03,170 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2023-12-02 08:40:03,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 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-12-02 08:40:03,171 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2023-12-02 08:40:03,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 08:40:03,171 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:40:03,171 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:40:03,176 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 08:40:03,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:40:03,372 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-12-02 08:40:03,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:40:03,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1855259995, now seen corresponding path program 1 times [2023-12-02 08:40:03,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:40:03,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850653308] [2023-12-02 08:40:03,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:40:03,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:40:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:40:03,808 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 08:40:03,808 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:40:03,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850653308] [2023-12-02 08:40:03,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850653308] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:40:03,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489686422] [2023-12-02 08:40:03,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:40:03,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:40:03,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:40:03,809 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:40:03,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 08:40:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:40:04,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-02 08:40:04,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:40:04,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 08:40:04,232 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))))) is different from true [2023-12-02 08:40:04,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:40:04,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-12-02 08:40:04,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-02 08:40:04,286 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-12-02 08:40:04,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:40:04,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489686422] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:40:04,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2023343352] [2023-12-02 08:40:04,374 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2023-12-02 08:40:04,374 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:40:04,375 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:40:04,375 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:40:04,375 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:40:06,202 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 08:40:06,220 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:40:55,989 WARN L293 SmtUtils]: Spent 6.02s on a formula simplification. DAG size of input: 241 DAG size of output: 234 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:41:25,938 WARN L293 SmtUtils]: Spent 10.95s on a formula simplification. DAG size of input: 249 DAG size of output: 242 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:42:01,399 WARN L293 SmtUtils]: Spent 10.96s on a formula simplification. DAG size of input: 239 DAG size of output: 232 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:42:24,010 WARN L293 SmtUtils]: Spent 11.12s on a formula simplification. DAG size of input: 253 DAG size of output: 242 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:42:24,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [2023343352] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:42:24,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-02 08:42:24,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [15, 15] total 49 [2023-12-02 08:42:24,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019808328] [2023-12-02 08:42:24,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:42:24,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 08:42:24,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:42:24,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 08:42:24,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2235, Unknown=48, NotChecked=96, Total=2550 [2023-12-02 08:42:24,014 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 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-12-02 08:42:28,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:42:30,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:42:32,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:42:34,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:42:38,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:42:40,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:42:42,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:42:44,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:42:47,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:42:49,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:42:51,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:42:53,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:42:55,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:42:57,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:42:59,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:43:01,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:43:04,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:43:06,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:43:09,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:43:11,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:43:13,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:43:15,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:43:18,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:43:20,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:43:22,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:43:24,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:43:26,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:43:29,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:43:32,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:43:35,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:43:39,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:43:41,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:43:44,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:43:47,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:43:50,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 08:43:58,464 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (exists ((|v_old(#valid)_AFTER_CALL_85| (Array Int Int)) (|v_#memory_int_247| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_85| (Array Int (Array Int Int))) (|v_#memory_int_248| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_273| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_85| (Array Int Int)) (|v_#memory_$Pointer$.base_286| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_133| (Array Int (Array Int Int)))) (let ((.cse38 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_85| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (and (<= 8 (select |v_old(#length)_AFTER_CALL_85| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= (select (select (let ((.cse37 (store |v_#memory_$Pointer$.offset_273| .cse38 (store (select |v_#memory_$Pointer$.offset_273| .cse38) 0 0)))) (store .cse37 |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store (select .cse37 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4 0))) |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_85| .cse38) 1) (= (select |v_old(#valid)_AFTER_CALL_85| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_85| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (<= 4 (select |v_old(#length)_AFTER_CALL_85| .cse38)) (= (store |v_#memory_int_247| .cse38 (store (select |v_#memory_int_247| .cse38) 0 (select (select |v_#memory_int_248| .cse38) 0))) |v_#memory_int_248|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_85| (let ((.cse39 (store |v_#memory_$Pointer$.base_286| .cse38 (store (select |v_#memory_$Pointer$.base_286| .cse38) 0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)))) (store .cse39 |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store (select .cse39 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4 .cse38)))) (= |v_#memory_int_BEFORE_CALL_133| (store |v_#memory_int_248| |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |v_#memory_int_248| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |v_#memory_int_BEFORE_CALL_133| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4)))))))) (.cse10 (exists ((|v_old(#valid)_AFTER_CALL_86| (Array Int Int)) (|v_#memory_int_247| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_145| (Array Int Int)) (|v_#memory_int_248| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_86| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_273| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_86| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_286| (Array Int (Array Int Int)))) (let ((.cse34 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_86| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (and (= |v_#memory_int_248| (store |v_#memory_int_247| .cse34 (store (select |v_#memory_int_247| .cse34) 0 (select (select |v_#memory_int_248| .cse34) 0)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_86| (let ((.cse35 (store |v_#memory_$Pointer$.base_286| .cse34 (store (select |v_#memory_$Pointer$.base_286| .cse34) 0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)))) (store .cse35 |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store (select .cse35 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4 .cse34)))) (<= 4 (select |v_#length_BEFORE_CALL_145| .cse34)) (= (select (select (let ((.cse36 (store |v_#memory_$Pointer$.offset_273| .cse34 (store (select |v_#memory_$Pointer$.offset_273| .cse34) 0 0)))) (store .cse36 |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store (select .cse36 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4 0))) |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_86| .cse34) 1) (= |v_old(#memory_int)_AFTER_CALL_86| (store |v_#memory_int_248| |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |v_#memory_int_248| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_86| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4)))) (= (select |v_old(#valid)_AFTER_CALL_86| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (<= 8 (select |v_#length_BEFORE_CALL_145| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_86| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))))))) (and (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_26| Int) (|v_ULTIMATE.start_dll_circular_prepend_#in~head#1.base_8| Int) (|v_#memory_int_249| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| Int) (|v_#memory_$Pointer$.offset_275| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_288| (Array Int (Array Int Int))) (|v_#memory_int_250| (Array Int (Array Int Int))) (|v_#memory_int_251| (Array Int (Array Int Int)))) (let ((.cse13 (select |v_#memory_int_251| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|)) (.cse15 (select |v_#memory_$Pointer$.offset_275| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_26|)) (.cse17 (select |v_#memory_$Pointer$.base_288| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_26|))) (and (let ((.cse0 (= |v_ULTIMATE.start_dll_circular_prepend_#in~head#1.base_8| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (= |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_26| |v_ULTIMATE.start_dll_circular_prepend_#in~head#1.base_8|)) (.cse3 (exists ((|v_#length_181| (Array Int Int))) (= (store |v_#length_181| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| 12) |c_#length|))) (.cse4 (not (= |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| 0))) (.cse5 (<= (+ |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| 1) |c_#StackHeapBarrier|)) (.cse6 (exists ((|v_#memory_$Pointer$.offset_267| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_267| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| (store (store (store (select |v_#memory_$Pointer$.offset_267| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|) 0 0) 4 0) 8 (select (select |v_#memory_$Pointer$.offset_275| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|) 8))) |v_#memory_$Pointer$.offset_275|))) (.cse7 (exists ((|v_#valid_203| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_203| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| 1)) (= (select |v_#valid_203| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|) 0)))) (.cse8 (exists ((|v_#memory_int_242| (Array Int (Array Int Int))) (|v_#memory_int_243| (Array Int (Array Int Int))) (|v_#memory_int_241| (Array Int (Array Int Int)))) (let ((.cse12 (select |v_#memory_int_243| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|)) (.cse11 (select |v_#memory_int_242| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|))) (and (= (store |v_#memory_int_242| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| (store .cse11 4 (select .cse12 4))) |v_#memory_int_243|) (= (store |v_#memory_int_243| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| (store .cse12 8 1)) |v_#memory_int_249|) (= (store |v_#memory_int_241| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| (store (select |v_#memory_int_241| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|) 0 (select .cse11 0))) |v_#memory_int_242|))))) (.cse9 (exists ((|v_#memory_$Pointer$.base_280| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_280| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| (store (store (store (select |v_#memory_$Pointer$.base_280| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|) 0 0) 4 0) 8 (select (select |v_#memory_$Pointer$.base_288| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|) 8))) |v_#memory_$Pointer$.base_288|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (= (store |v_#memory_int_251| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| (store .cse13 4 (select (select |c_#memory_int| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|) 4))) |c_#memory_int|) (= |c_#memory_$Pointer$.offset| (let ((.cse14 (store |v_#memory_$Pointer$.offset_275| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_26| (store .cse15 0 0)))) (store .cse14 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| (store (store (select .cse14 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|) 0 0) 4 0)))) (= (store |v_#memory_int_250| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| (store (select |v_#memory_int_250| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|) 0 (select .cse13 0))) |v_#memory_int_251|) (= (select .cse15 0) 0) (= |c_#memory_$Pointer$.base| (let ((.cse16 (store |v_#memory_$Pointer$.base_288| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_26| (store .cse17 0 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|)))) (store .cse16 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| (store (store (select .cse16 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|) 0 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|) 4 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|)))) (= 1 (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_26|)) (= (store |v_#memory_int_249| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_26| (store (select |v_#memory_int_249| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_26|) 0 (select (select |v_#memory_int_250| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_26|) 0))) |v_#memory_int_250|) (= (select .cse17 0) 0) (<= 4 (select |c_#length| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_26|))))) (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_26| Int) (|v_ULTIMATE.start_dll_circular_prepend_#in~head#1.base_8| Int) (|v_#memory_int_249| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| Int) (|v_#memory_$Pointer$.offset_275| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_288| (Array Int (Array Int Int))) (|v_#memory_int_250| (Array Int (Array Int Int))) (|v_#memory_int_251| (Array Int (Array Int Int)))) (let ((.cse29 (select |v_#memory_int_251| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|)) (.cse31 (select |v_#memory_$Pointer$.offset_275| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_26|)) (.cse33 (select |v_#memory_$Pointer$.base_288| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_26|))) (and (let ((.cse18 (= |v_ULTIMATE.start_dll_circular_prepend_#in~head#1.base_8| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse19 (= |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_26| |v_ULTIMATE.start_dll_circular_prepend_#in~head#1.base_8|)) (.cse20 (exists ((|v_#length_181| (Array Int Int))) (= (store |v_#length_181| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| 12) |c_#length|))) (.cse21 (not (= |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| 0))) (.cse22 (<= (+ |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| 1) |c_#StackHeapBarrier|)) (.cse23 (exists ((|v_#memory_$Pointer$.offset_267| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_267| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| (store (store (store (select |v_#memory_$Pointer$.offset_267| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|) 0 0) 4 0) 8 (select (select |v_#memory_$Pointer$.offset_275| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|) 8))) |v_#memory_$Pointer$.offset_275|))) (.cse24 (exists ((|v_#valid_203| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_203| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| 1)) (= (select |v_#valid_203| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|) 0)))) (.cse25 (exists ((|v_#memory_int_242| (Array Int (Array Int Int))) (|v_#memory_int_243| (Array Int (Array Int Int))) (|v_#memory_int_241| (Array Int (Array Int Int)))) (let ((.cse28 (select |v_#memory_int_243| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|)) (.cse27 (select |v_#memory_int_242| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|))) (and (= (store |v_#memory_int_242| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| (store .cse27 4 (select .cse28 4))) |v_#memory_int_243|) (= (store |v_#memory_int_243| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| (store .cse28 8 1)) |v_#memory_int_249|) (= (store |v_#memory_int_241| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| (store (select |v_#memory_int_241| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|) 0 (select .cse27 0))) |v_#memory_int_242|))))) (.cse26 (exists ((|v_#memory_$Pointer$.base_280| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_280| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| (store (store (store (select |v_#memory_$Pointer$.base_280| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|) 0 0) 4 0) 8 (select (select |v_#memory_$Pointer$.base_288| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|) 8))) |v_#memory_$Pointer$.base_288|)))) (or (and .cse18 .cse19 .cse2 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse18 .cse10 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26))) (= (store |v_#memory_int_251| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| (store .cse29 4 (select (select |c_#memory_int| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|) 4))) |c_#memory_int|) (= |c_#memory_$Pointer$.offset| (let ((.cse30 (store |v_#memory_$Pointer$.offset_275| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_26| (store .cse31 0 0)))) (store .cse30 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| (store (store (select .cse30 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|) 0 0) 4 0)))) (= (store |v_#memory_int_250| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| (store (select |v_#memory_int_250| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|) 0 (select .cse29 0))) |v_#memory_int_251|) (= (select .cse31 0) 0) (= |c_#memory_$Pointer$.base| (let ((.cse32 (store |v_#memory_$Pointer$.base_288| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_26| (store .cse33 0 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|)))) (store .cse32 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31| (store (store (select .cse32 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|) 0 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|) 4 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_31|)))) (= (store |v_#memory_int_249| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_26| (store (select |v_#memory_int_249| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_26|) 0 (select (select |v_#memory_int_250| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_26|) 0))) |v_#memory_int_250|) (= (select .cse33 0) 0)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~count~0#1| 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= 2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~len~0#1| 2))) is different from false [2023-12-02 08:44:00,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:44:00,600 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2023-12-02 08:44:00,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-02 08:44:00,601 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 41 [2023-12-02 08:44:00,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:44:00,601 INFO L225 Difference]: With dead ends: 81 [2023-12-02 08:44:00,601 INFO L226 Difference]: Without dead ends: 81 [2023-12-02 08:44:00,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 140.5s TimeCoverageRelationStatistics Valid=180, Invalid=2328, Unknown=50, NotChecked=198, Total=2756 [2023-12-02 08:44:00,602 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 4 mSolverCounterUnsat, 46 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 92.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 46 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 94.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:44:00,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 358 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1109 Invalid, 46 Unknown, 27 Unchecked, 94.2s Time] [2023-12-02 08:44:00,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-02 08:44:00,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-12-02 08:44:00,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 76 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-12-02 08:44:00,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2023-12-02 08:44:00,605 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 41 [2023-12-02 08:44:00,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:44:00,605 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2023-12-02 08:44:00,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 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-12-02 08:44:00,605 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2023-12-02 08:44:00,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 08:44:00,606 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:44:00,606 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:44:00,612 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 08:44:00,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:44:00,806 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-12-02 08:44:00,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:44:00,807 INFO L85 PathProgramCache]: Analyzing trace with hash -210487412, now seen corresponding path program 1 times [2023-12-02 08:44:00,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:44:00,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620532114] [2023-12-02 08:44:00,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:44:00,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:44:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:44:00,892 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-02 08:44:00,892 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:44:00,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620532114] [2023-12-02 08:44:00,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620532114] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:44:00,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:44:00,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 08:44:00,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958577721] [2023-12-02 08:44:00,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:44:00,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 08:44:00,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:44:00,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 08:44:00,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 08:44:00,893 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 08:44:01,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:44:01,018 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2023-12-02 08:44:01,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:44:01,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2023-12-02 08:44:01,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:44:01,019 INFO L225 Difference]: With dead ends: 80 [2023-12-02 08:44:01,020 INFO L226 Difference]: Without dead ends: 80 [2023-12-02 08:44:01,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:44:01,020 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 6 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:44:01,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 190 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:44:01,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-02 08:44:01,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-12-02 08:44:01,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 75 states have internal predecessors, (80), 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-12-02 08:44:01,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2023-12-02 08:44:01,024 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 41 [2023-12-02 08:44:01,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:44:01,024 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2023-12-02 08:44:01,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 08:44:01,025 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2023-12-02 08:44:01,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 08:44:01,025 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:44:01,025 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:44:01,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-02 08:44:01,025 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-12-02 08:44:01,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:44:01,026 INFO L85 PathProgramCache]: Analyzing trace with hash -210487411, now seen corresponding path program 1 times [2023-12-02 08:44:01,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:44:01,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120201834] [2023-12-02 08:44:01,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:44:01,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:44:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:44:01,197 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-02 08:44:01,197 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:44:01,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120201834] [2023-12-02 08:44:01,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120201834] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:44:01,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:44:01,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 08:44:01,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136319107] [2023-12-02 08:44:01,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:44:01,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 08:44:01,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:44:01,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 08:44:01,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 08:44:01,199 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 08:44:01,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:44:01,356 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2023-12-02 08:44:01,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:44:01,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2023-12-02 08:44:01,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:44:01,357 INFO L225 Difference]: With dead ends: 79 [2023-12-02 08:44:01,357 INFO L226 Difference]: Without dead ends: 79 [2023-12-02 08:44:01,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:44:01,358 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 5 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:44:01,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 202 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:44:01,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-12-02 08:44:01,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-12-02 08:44:01,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 74 states have internal predecessors, (79), 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-12-02 08:44:01,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2023-12-02 08:44:01,362 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 41 [2023-12-02 08:44:01,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:44:01,362 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2023-12-02 08:44:01,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 08:44:01,362 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2023-12-02 08:44:01,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 08:44:01,363 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:44:01,363 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:44:01,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-02 08:44:01,363 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-12-02 08:44:01,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:44:01,364 INFO L85 PathProgramCache]: Analyzing trace with hash 2064824870, now seen corresponding path program 1 times [2023-12-02 08:44:01,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:44:01,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741918947] [2023-12-02 08:44:01,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:44:01,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:44:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:44:03,215 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 08:44:03,215 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:44:03,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741918947] [2023-12-02 08:44:03,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741918947] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:44:03,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950807950] [2023-12-02 08:44:03,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:44:03,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:44:03,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:44:03,216 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:44:03,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 08:44:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:44:03,427 INFO L262 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 83 conjunts are in the unsatisfiable core [2023-12-02 08:44:03,430 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:44:03,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2023-12-02 08:44:03,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:44:03,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 14 [2023-12-02 08:44:03,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 08:44:04,047 INFO L349 Elim1Store]: treesize reduction 96, result has 30.9 percent of original size [2023-12-02 08:44:04,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 52 [2023-12-02 08:44:04,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:44:04,062 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 08:44:04,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 42 [2023-12-02 08:44:04,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:44:04,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 08:44:04,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 08:44:04,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:44:04,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 25 [2023-12-02 08:44:04,495 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 08:44:04,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:44:04,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950807950] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:44:04,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [781989103] [2023-12-02 08:44:04,911 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2023-12-02 08:44:04,911 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:44:04,911 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:44:04,911 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:44:04,911 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:44:07,106 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 08:44:07,130 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:44:31,959 WARN L293 SmtUtils]: Spent 19.29s on a formula simplification. DAG size of input: 286 DAG size of output: 273 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:46:17,804 WARN L293 SmtUtils]: Spent 9.01s on a formula simplification. DAG size of input: 249 DAG size of output: 243 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:46:58,990 WARN L293 SmtUtils]: Spent 14.54s on a formula simplification. DAG size of input: 263 DAG size of output: 256 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:47:48,345 WARN L293 SmtUtils]: Spent 22.15s on a formula simplification. DAG size of input: 283 DAG size of output: 270 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:47:48,347 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7250#(and (<= 1 |#StackHeapBarrier|) (<= 0 (+ 4 |ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset|)) (<= 4 (select |#length| |ULTIMATE.start_dll_circular_prepend_~head#1.base|)) (= |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|) 1) (not (= (select |#valid| |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) 1)) (= |ULTIMATE.start_dll_circular_prepend_#in~data#1| 1) (= |ULTIMATE.start_dll_circular_prepend_~head#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_prepend_~data#1| 1) (= (select |#valid| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_prepend_#in~head#1.offset| 0) (<= (+ 8 |ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset|) (select |#length| |ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|)) (exists ((|v_#memory_$Pointer$.offset_304| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_318| (Array Int (Array Int Int))) (|v_#memory_int_275| (Array Int (Array Int Int))) (|v_#memory_int_273| (Array Int (Array Int Int))) (|v_#memory_int_274| (Array Int (Array Int Int)))) (and (or (not (= (select (select |v_#memory_$Pointer$.base_318| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0) 0)) (not (= (select (select |v_#memory_$Pointer$.offset_304| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0) 0))) (= (store (store (store |v_#memory_$Pointer$.base_318| |ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |v_#memory_$Pointer$.base_318| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store |v_#memory_$Pointer$.base_318| |ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |v_#memory_$Pointer$.base_318| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 |ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|)) |ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| (store (select (store (store |v_#memory_$Pointer$.base_318| |ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |v_#memory_$Pointer$.base_318| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store |v_#memory_$Pointer$.base_318| |ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |v_#memory_$Pointer$.base_318| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 |ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|)) |ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|) (+ 4 |ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |#memory_$Pointer$.base|) (= (select (select |v_#memory_$Pointer$.base_318| (select (select |v_#memory_$Pointer$.base_318| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_304| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0) 4)) |ULTIMATE.start_dll_circular_prepend_~last~1#1.base|) (= |#memory_int| (store |v_#memory_int_275| |ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| (store (select |v_#memory_int_275| |ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|) (+ 4 |ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|) (+ 4 |ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset|))))) (= (select (select |v_#memory_$Pointer$.base_318| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0) |ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|) (= (store |v_#memory_int_273| |ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |v_#memory_int_273| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0 (select (select |v_#memory_int_274| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0))) |v_#memory_int_274|) (= (select (select |v_#memory_$Pointer$.offset_304| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0) |ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset|) (or (and (= |ULTIMATE.start_dll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_296| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_296| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_296| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 0) 4 0) 8 (select (select |v_#memory_$Pointer$.offset_304| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8))) |v_#memory_$Pointer$.offset_304|)) (exists ((|v_#memory_$Pointer$.base_310| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_310| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.base_310| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 0) 4 0) 8 (select (select |v_#memory_$Pointer$.base_318| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8))) |v_#memory_$Pointer$.base_318|)) (exists ((|v_#memory_int_265| (Array Int (Array Int Int))) (|v_#memory_int_266| (Array Int (Array Int Int))) (|v_#memory_int_267| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_265| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_265| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_266| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_266|) (= (store |v_#memory_int_267| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_267| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8 1)) |v_#memory_int_273|) (= |v_#memory_int_267| (store |v_#memory_int_266| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_266| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_267| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4)))))) (not (= |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 0)) (<= (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_213| (Array Int Int))) (and (= (store |v_#valid_213| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_213| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_302| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_97| (Array Int Int)) (|v_#memory_$Pointer$.base_316| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_97| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_164| (Array Int Int)) (|v_#memory_int_BEFORE_CALL_154| (Array Int (Array Int Int))) (|v_#memory_int_271| (Array Int (Array Int Int))) (|v_#memory_int_272| (Array Int (Array Int Int)))) (and (= |ULTIMATE.start_dll_circular_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_97| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (store |v_#memory_int_271| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_97| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_int_271| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_97| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 (select (select |v_#memory_int_272| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_97| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0))) |v_#memory_int_272|) (<= 8 (select |v_#length_BEFORE_CALL_164| |ULTIMATE.start_dll_circular_create_#res#1.base|)) (= (select (select (store (store |v_#memory_$Pointer$.offset_302| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_97| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_302| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_97| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 0)) |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select (store |v_#memory_$Pointer$.offset_302| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_97| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_302| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_97| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 0)) |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_97| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_97| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 1) (= (select |v_old(#valid)_AFTER_CALL_97| |ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (<= 4 (select |v_#length_BEFORE_CALL_164| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_97| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (= |v_#memory_int_BEFORE_CALL_154| (store |v_#memory_int_272| |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |v_#memory_int_272| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |v_#memory_int_BEFORE_CALL_154| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_97| (store (store |v_#memory_$Pointer$.base_316| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_97| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.base_316| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_97| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 |ULTIMATE.start_dll_circular_create_#res#1.base|)) |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select (store |v_#memory_$Pointer$.base_316| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_97| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.base_316| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_97| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 |ULTIMATE.start_dll_circular_create_#res#1.base|)) |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_97| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)))))) (= |ULTIMATE.start_dll_circular_prepend_~head#1.base| |ULTIMATE.start_dll_circular_prepend_#in~head#1.base|) (exists ((|v_#length_188| (Array Int Int))) (= |#length| (store |v_#length_188| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 12)))) (and (= |ULTIMATE.start_dll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_296| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_296| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_296| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 0) 4 0) 8 (select (select |v_#memory_$Pointer$.offset_304| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8))) |v_#memory_$Pointer$.offset_304|)) (exists ((|v_#memory_$Pointer$.base_310| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_310| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.base_310| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 0) 4 0) 8 (select (select |v_#memory_$Pointer$.base_318| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8))) |v_#memory_$Pointer$.base_318|)) (exists ((|v_#memory_int_265| (Array Int (Array Int Int))) (|v_#memory_int_266| (Array Int (Array Int Int))) (|v_#memory_int_267| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_265| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_265| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_266| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_266|) (= (store |v_#memory_int_267| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_267| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8 1)) |v_#memory_int_273|) (= |v_#memory_int_267| (store |v_#memory_int_266| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_266| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_267| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4)))))) (exists ((|v_#memory_$Pointer$.offset_302| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_96| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_96| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_316| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_96| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_162| (Array Int Int)) (|v_#memory_int_271| (Array Int (Array Int Int))) (|v_#memory_int_272| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_96| (store |v_#memory_int_272| |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |v_#memory_int_272| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_96| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)))) (= (select |v_old(#valid)_AFTER_CALL_96| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 1) (= (select (select (store (store |v_#memory_$Pointer$.offset_302| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_302| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 0)) |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select (store |v_#memory_$Pointer$.offset_302| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_302| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 0)) |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_#memory_int_272| (store |v_#memory_int_271| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_int_271| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 (select (select |v_#memory_int_272| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0)))) (= (select |v_old(#valid)_AFTER_CALL_96| |ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| (store (store |v_#memory_$Pointer$.base_316| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.base_316| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 |ULTIMATE.start_dll_circular_create_#res#1.base|)) |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select (store |v_#memory_$Pointer$.base_316| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.base_316| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 |ULTIMATE.start_dll_circular_create_#res#1.base|)) |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)))) (<= 4 (select |v_#length_BEFORE_CALL_162| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (<= 8 (select |v_#length_BEFORE_CALL_162| |ULTIMATE.start_dll_circular_create_#res#1.base|)) (= |ULTIMATE.start_dll_circular_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (not (= |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 0)) (<= (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_213| (Array Int Int))) (and (= (store |v_#valid_213| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_213| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0))) (= |ULTIMATE.start_dll_circular_prepend_~head#1.base| |ULTIMATE.start_dll_circular_prepend_#in~head#1.base|) (exists ((|v_#length_188| (Array Int Int))) (= |#length| (store |v_#length_188| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 12))))) (= |#memory_$Pointer$.offset| (store (store (store |v_#memory_$Pointer$.offset_304| |ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |v_#memory_$Pointer$.offset_304| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0 0)) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store |v_#memory_$Pointer$.offset_304| |ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |v_#memory_$Pointer$.offset_304| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0 0)) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 |ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset|)) |ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| (store (select (store (store |v_#memory_$Pointer$.offset_304| |ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |v_#memory_$Pointer$.offset_304| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0 0)) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store |v_#memory_$Pointer$.offset_304| |ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |v_#memory_$Pointer$.offset_304| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0 0)) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 |ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset|)) |ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|) (+ 4 |ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset|) 0))) (= (store |v_#memory_int_274| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_274| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_275| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_275|) (= |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| (select (select |v_#memory_$Pointer$.offset_304| (select (select |v_#memory_$Pointer$.base_318| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_304| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0) 4))))))' at error location [2023-12-02 08:47:48,347 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 08:47:48,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 08:47:48,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 34 [2023-12-02 08:47:48,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969691415] [2023-12-02 08:47:48,348 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 08:47:48,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-02 08:47:48,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:47:48,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-02 08:47:48,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=4259, Unknown=57, NotChecked=0, Total=4556 [2023-12-02 08:47:48,351 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 35 states, 28 states have (on average 2.25) internal successors, (63), 31 states have internal predecessors, (63), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 08:47:50,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:47:50,839 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2023-12-02 08:47:50,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 08:47:50,840 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 28 states have (on average 2.25) internal successors, (63), 31 states have internal predecessors, (63), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2023-12-02 08:47:50,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:47:50,840 INFO L225 Difference]: With dead ends: 78 [2023-12-02 08:47:50,841 INFO L226 Difference]: Without dead ends: 78 [2023-12-02 08:47:50,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1782 ImplicationChecksByTransitivity, 224.2s TimeCoverageRelationStatistics Valid=369, Invalid=5893, Unknown=58, NotChecked=0, Total=6320 [2023-12-02 08:47:50,843 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 143 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:47:50,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 589 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-02 08:47:50,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-02 08:47:50,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-12-02 08:47:50,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.368421052631579) internal successors, (78), 73 states have internal predecessors, (78), 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-12-02 08:47:50,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2023-12-02 08:47:50,846 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 42 [2023-12-02 08:47:50,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:47:50,847 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2023-12-02 08:47:50,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 28 states have (on average 2.25) internal successors, (63), 31 states have internal predecessors, (63), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 08:47:50,847 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2023-12-02 08:47:50,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 08:47:50,847 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:47:50,848 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:47:50,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-02 08:47:51,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:47:51,048 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-12-02 08:47:51,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:47:51,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2064824871, now seen corresponding path program 1 times [2023-12-02 08:47:51,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:47:51,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478100704] [2023-12-02 08:47:51,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:47:51,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:47:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:47:52,785 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:47:52,785 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:47:52,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478100704] [2023-12-02 08:47:52,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478100704] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:47:52,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567099080] [2023-12-02 08:47:52,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:47:52,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:47:52,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:47:52,787 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:47:52,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5b0d87a-caf4-46f9-9703-c461e1ad5a9c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 08:47:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:47:53,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 105 conjunts are in the unsatisfiable core [2023-12-02 08:47:53,013 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:47:53,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 08:47:53,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 08:47:53,495 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 08:47:53,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 08:47:53,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 08:47:54,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-12-02 08:47:54,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 1 [2023-12-02 08:47:54,137 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-12-02 08:47:54,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 36 [2023-12-02 08:47:54,157 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-12-02 08:47:54,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2023-12-02 08:47:54,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 08:47:54,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 08:47:54,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:47:54,475 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 08:47:54,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 78 [2023-12-02 08:47:54,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:47:54,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:47:54,489 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 08:47:54,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 78 [2023-12-02 08:47:54,515 INFO L349 Elim1Store]: treesize reduction 41, result has 47.4 percent of original size [2023-12-02 08:47:54,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 41 [2023-12-02 08:47:54,546 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-12-02 08:47:54,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2023-12-02 08:47:54,828 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-02 08:47:54,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 55 [2023-12-02 08:47:54,914 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-12-02 08:47:54,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 25 [2023-12-02 08:47:54,980 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:47:54,980 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:47:55,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567099080] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:47:55,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1664529604] [2023-12-02 08:47:55,587 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2023-12-02 08:47:55,587 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:47:55,587 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:47:55,587 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:47:55,587 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:47:57,450 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 08:47:57,470 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:48:26,044 WARN L293 SmtUtils]: Spent 20.39s on a formula simplification. DAG size of input: 288 DAG size of output: 275 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)