./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.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_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/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_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/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_78f2c9f7-5930-4189-abb3-41da06bd55cc/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 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 12:30:45,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 12:30:45,663 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 12:30:45,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 12:30:45,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 12:30:45,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 12:30:45,695 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 12:30:45,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 12:30:45,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 12:30:45,697 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 12:30:45,697 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 12:30:45,698 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 12:30:45,698 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 12:30:45,699 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 12:30:45,699 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 12:30:45,700 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 12:30:45,700 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 12:30:45,701 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 12:30:45,702 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 12:30:45,702 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 12:30:45,703 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 12:30:45,706 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 12:30:45,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 12:30:45,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 12:30:45,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 12:30:45,708 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 12:30:45,708 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 12:30:45,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 12:30:45,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 12:30:45,710 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 12:30:45,710 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 12:30:45,710 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 12:30:45,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 12:30:45,711 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 12:30:45,711 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 12:30:45,711 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 12:30:45,711 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 12:30:45,712 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 12:30:45,712 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 12:30:45,712 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 12:30:45,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:30:45,713 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 12:30:45,713 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 12:30:45,713 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 12:30:45,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 12:30:45,713 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 12:30:45,713 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 12:30:45,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 12:30:45,714 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_78f2c9f7-5930-4189-abb3-41da06bd55cc/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_78f2c9f7-5930-4189-abb3-41da06bd55cc/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 -> 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 [2023-12-02 12:30:45,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 12:30:45,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 12:30:45,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 12:30:45,972 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 12:30:45,973 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 12:30:45,974 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2023-12-02 12:30:48,870 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 12:30:49,094 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 12:30:49,095 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2023-12-02 12:30:49,111 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/data/d1f05cf6e/cb82d15602994da49972e48d4eb1c74f/FLAG6ff892bf2 [2023-12-02 12:30:49,125 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/data/d1f05cf6e/cb82d15602994da49972e48d4eb1c74f [2023-12-02 12:30:49,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 12:30:49,129 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 12:30:49,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 12:30:49,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 12:30:49,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 12:30:49,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:30:49" (1/1) ... [2023-12-02 12:30:49,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dfcc367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:49, skipping insertion in model container [2023-12-02 12:30:49,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:30:49" (1/1) ... [2023-12-02 12:30:49,195 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 12:30:49,473 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:30:49,484 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 12:30:49,528 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:30:49,556 INFO L206 MainTranslator]: Completed translation [2023-12-02 12:30:49,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:49 WrapperNode [2023-12-02 12:30:49,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 12:30:49,557 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 12:30:49,557 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 12:30:49,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 12:30:49,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:49" (1/1) ... [2023-12-02 12:30:49,580 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:49" (1/1) ... [2023-12-02 12:30:49,611 INFO L138 Inliner]: procedures = 127, calls = 50, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 155 [2023-12-02 12:30:49,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 12:30:49,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 12:30:49,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 12:30:49,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 12:30:49,623 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:49" (1/1) ... [2023-12-02 12:30:49,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:49" (1/1) ... [2023-12-02 12:30:49,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:49" (1/1) ... [2023-12-02 12:30:49,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:49" (1/1) ... [2023-12-02 12:30:49,641 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:49" (1/1) ... [2023-12-02 12:30:49,644 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:49" (1/1) ... [2023-12-02 12:30:49,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:49" (1/1) ... [2023-12-02 12:30:49,649 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:49" (1/1) ... [2023-12-02 12:30:49,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 12:30:49,655 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 12:30:49,655 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 12:30:49,655 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 12:30:49,656 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:49" (1/1) ... [2023-12-02 12:30:49,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:30:49,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:30:49,688 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 12:30:49,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 12:30:49,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 12:30:49,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 12:30:49,725 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-02 12:30:49,725 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-02 12:30:49,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 12:30:49,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 12:30:49,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 12:30:49,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 12:30:49,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 12:30:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 12:30:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-12-02 12:30:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 12:30:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 12:30:49,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 12:30:49,871 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 12:30:49,873 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 12:30:50,286 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 12:30:50,366 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 12:30:50,366 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-02 12:30:50,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:30:50 BoogieIcfgContainer [2023-12-02 12:30:50,368 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 12:30:50,371 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 12:30:50,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 12:30:50,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 12:30:50,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:30:49" (1/3) ... [2023-12-02 12:30:50,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f07282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:30:50, skipping insertion in model container [2023-12-02 12:30:50,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:49" (2/3) ... [2023-12-02 12:30:50,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f07282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:30:50, skipping insertion in model container [2023-12-02 12:30:50,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:30:50" (3/3) ... [2023-12-02 12:30:50,378 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_unequal.i [2023-12-02 12:30:50,399 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 12:30:50,399 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2023-12-02 12:30:50,443 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 12:30:50,451 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;@4fabe3a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 12:30:50,451 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2023-12-02 12:30:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 58 states have (on average 2.310344827586207) internal successors, (134), 122 states have internal predecessors, (134), 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 12:30:50,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 12:30:50,463 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:30:50,464 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 12:30:50,464 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-12-02 12:30:50,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:30:50,471 INFO L85 PathProgramCache]: Analyzing trace with hash 246714355, now seen corresponding path program 1 times [2023-12-02 12:30:50,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:30:50,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009460116] [2023-12-02 12:30:50,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:30:50,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:30:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:30:50,721 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 12:30:50,722 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:30:50,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009460116] [2023-12-02 12:30:50,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009460116] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:30:50,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:30:50,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:30:50,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801827499] [2023-12-02 12:30:50,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:30:50,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:30:50,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:30:50,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:30:50,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:30:50,758 INFO L87 Difference]: Start difference. First operand has 127 states, 58 states have (on average 2.310344827586207) internal successors, (134), 122 states have internal predecessors, (134), 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 12:30:50,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:30:50,949 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2023-12-02 12:30:50,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:30:50,951 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 12:30:50,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:30:50,959 INFO L225 Difference]: With dead ends: 123 [2023-12-02 12:30:50,959 INFO L226 Difference]: Without dead ends: 121 [2023-12-02 12:30:50,961 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 12:30:50,965 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 8 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:30:50,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 171 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 12:30:50,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-02 12:30:51,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-12-02 12:30:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 56 states have (on average 2.2142857142857144) internal successors, (124), 116 states have internal predecessors, (124), 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 12:30:51,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2023-12-02 12:30:51,007 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 5 [2023-12-02 12:30:51,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:30:51,008 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2023-12-02 12:30:51,008 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 12:30:51,008 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2023-12-02 12:30:51,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 12:30:51,009 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:30:51,009 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 12:30:51,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 12:30:51,009 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-12-02 12:30:51,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:30:51,010 INFO L85 PathProgramCache]: Analyzing trace with hash 246714356, now seen corresponding path program 1 times [2023-12-02 12:30:51,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:30:51,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066922439] [2023-12-02 12:30:51,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:30:51,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:30:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:30:51,129 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 12:30:51,130 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:30:51,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066922439] [2023-12-02 12:30:51,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066922439] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:30:51,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:30:51,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:30:51,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129096034] [2023-12-02 12:30:51,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:30:51,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:30:51,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:30:51,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:30:51,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:30:51,133 INFO L87 Difference]: Start difference. First operand 121 states and 130 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 12:30:51,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:30:51,259 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2023-12-02 12:30:51,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:30:51,259 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 12:30:51,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:30:51,261 INFO L225 Difference]: With dead ends: 118 [2023-12-02 12:30:51,262 INFO L226 Difference]: Without dead ends: 118 [2023-12-02 12:30:51,262 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 12:30:51,264 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 3 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:30:51,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 176 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:30:51,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-02 12:30:51,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-12-02 12:30:51,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 56 states have (on average 2.1607142857142856) internal successors, (121), 113 states have internal predecessors, (121), 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 12:30:51,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2023-12-02 12:30:51,277 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 5 [2023-12-02 12:30:51,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:30:51,278 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2023-12-02 12:30:51,278 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 12:30:51,278 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2023-12-02 12:30:51,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 12:30:51,279 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:30:51,279 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:30:51,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 12:30:51,280 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-12-02 12:30:51,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:30:51,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1095340495, now seen corresponding path program 1 times [2023-12-02 12:30:51,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:30:51,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981236121] [2023-12-02 12:30:51,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:30:51,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:30:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:30:51,379 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 12:30:51,379 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:30:51,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981236121] [2023-12-02 12:30:51,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981236121] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:30:51,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:30:51,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:30:51,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129567370] [2023-12-02 12:30:51,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:30:51,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:30:51,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:30:51,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:30:51,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:30:51,383 INFO L87 Difference]: Start difference. First operand 118 states and 127 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 12:30:51,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:30:51,428 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2023-12-02 12:30:51,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:30:51,429 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 12:30:51,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:30:51,432 INFO L225 Difference]: With dead ends: 129 [2023-12-02 12:30:51,432 INFO L226 Difference]: Without dead ends: 129 [2023-12-02 12:30:51,432 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 12:30:51,434 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 10 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 12:30:51,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 220 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 12:30:51,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-12-02 12:30:51,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 119. [2023-12-02 12:30:51,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 57 states have (on average 2.1403508771929824) internal successors, (122), 114 states have internal predecessors, (122), 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 12:30:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2023-12-02 12:30:51,450 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 11 [2023-12-02 12:30:51,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:30:51,450 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2023-12-02 12:30:51,450 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 12:30:51,451 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2023-12-02 12:30:51,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 12:30:51,451 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:30:51,452 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:30:51,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 12:30:51,452 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-12-02 12:30:51,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:30:51,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1860275105, now seen corresponding path program 1 times [2023-12-02 12:30:51,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:30:51,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790888489] [2023-12-02 12:30:51,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:30:51,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:30:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:30:51,632 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 12:30:51,632 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:30:51,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790888489] [2023-12-02 12:30:51,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790888489] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:30:51,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:30:51,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 12:30:51,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059880785] [2023-12-02 12:30:51,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:30:51,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 12:30:51,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:30:51,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 12:30:51,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 12:30:51,635 INFO L87 Difference]: Start difference. First operand 119 states and 128 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 12:30:51,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:30:51,904 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2023-12-02 12:30:51,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:30:51,904 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 12:30:51,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:30:51,906 INFO L225 Difference]: With dead ends: 118 [2023-12-02 12:30:51,906 INFO L226 Difference]: Without dead ends: 118 [2023-12-02 12:30:51,907 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 12:30:51,908 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 9 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:30:51,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 328 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 12:30:51,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-02 12:30:51,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-12-02 12:30:51,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 57 states have (on average 2.1228070175438596) internal successors, (121), 113 states have internal predecessors, (121), 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 12:30:51,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2023-12-02 12:30:51,919 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 19 [2023-12-02 12:30:51,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:30:51,919 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2023-12-02 12:30:51,919 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 12:30:51,920 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2023-12-02 12:30:51,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 12:30:51,921 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:30:51,921 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:30:51,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 12:30:51,921 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-12-02 12:30:51,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:30:51,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1860275106, now seen corresponding path program 1 times [2023-12-02 12:30:51,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:30:51,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032596184] [2023-12-02 12:30:51,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:30:51,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:30:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:30:52,168 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 12:30:52,168 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:30:52,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032596184] [2023-12-02 12:30:52,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032596184] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:30:52,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:30:52,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 12:30:52,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829751950] [2023-12-02 12:30:52,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:30:52,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 12:30:52,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:30:52,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 12:30:52,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 12:30:52,171 INFO L87 Difference]: Start difference. First operand 118 states and 127 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 12:30:52,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:30:52,402 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2023-12-02 12:30:52,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:30:52,403 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 12:30:52,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:30:52,404 INFO L225 Difference]: With dead ends: 117 [2023-12-02 12:30:52,404 INFO L226 Difference]: Without dead ends: 117 [2023-12-02 12:30:52,405 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 12:30:52,406 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 7 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:30:52,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 352 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 12:30:52,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-12-02 12:30:52,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2023-12-02 12:30:52,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 57 states have (on average 2.1052631578947367) internal successors, (120), 112 states have internal predecessors, (120), 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 12:30:52,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2023-12-02 12:30:52,414 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 19 [2023-12-02 12:30:52,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:30:52,415 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2023-12-02 12:30:52,415 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 12:30:52,415 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2023-12-02 12:30:52,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 12:30:52,416 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:30:52,416 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:30:52,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 12:30:52,417 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-12-02 12:30:52,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:30:52,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1017980482, now seen corresponding path program 1 times [2023-12-02 12:30:52,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:30:52,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428811651] [2023-12-02 12:30:52,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:30:52,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:30:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:30:52,710 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 12:30:52,710 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:30:52,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428811651] [2023-12-02 12:30:52,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428811651] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:30:52,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958002752] [2023-12-02 12:30:52,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:30:52,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:30:52,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:30:52,717 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:30:52,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 12:30:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:30:52,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-02 12:30:52,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:30:52,903 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 12:30:52,978 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 12:30:52,979 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 12:30:53,034 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 12:30:53,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:30:53,348 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 12:30:53,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958002752] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:30:53,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1038333894] [2023-12-02 12:30:53,369 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 12:30:53,369 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:30:53,374 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:30:53,379 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:30:53,379 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:30:54,563 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2023-12-02 12:30:55,332 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:31:12,471 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1491#(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_103| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_103| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_103| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 0)))) (exists ((|v_#memory_int_80| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_80| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_int_80| |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_#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) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_103| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_103| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_103| |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_~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 12:31:12,471 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:31:12,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:31:12,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2023-12-02 12:31:12,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634720053] [2023-12-02 12:31:12,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:31:12,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 12:31:12,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:31:12,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 12:31:12,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=792, Unknown=5, NotChecked=0, Total=930 [2023-12-02 12:31:12,474 INFO L87 Difference]: Start difference. First operand 117 states and 126 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 12:31:13,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:31:13,005 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2023-12-02 12:31:13,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 12:31:13,005 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 12:31:13,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:31:13,006 INFO L225 Difference]: With dead ends: 124 [2023-12-02 12:31:13,006 INFO L226 Difference]: Without dead ends: 124 [2023-12-02 12:31:13,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=145, Invalid=842, Unknown=5, NotChecked=0, Total=992 [2023-12-02 12:31:13,007 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 10 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 12:31:13,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 675 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 12:31:13,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-12-02 12:31:13,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2023-12-02 12:31:13,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 61 states have (on average 2.0655737704918034) internal successors, (126), 116 states have internal predecessors, (126), 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 12:31:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2023-12-02 12:31:13,016 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 21 [2023-12-02 12:31:13,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:31:13,017 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2023-12-02 12:31:13,017 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 12:31:13,017 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2023-12-02 12:31:13,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 12:31:13,018 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:31:13,018 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:31:13,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 12:31:13,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-02 12:31:13,222 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-12-02 12:31:13,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:31:13,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1017980483, now seen corresponding path program 1 times [2023-12-02 12:31:13,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:31:13,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978812926] [2023-12-02 12:31:13,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:31:13,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:31:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:31:13,653 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 12:31:13,653 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:31:13,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978812926] [2023-12-02 12:31:13,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978812926] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:31:13,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226191022] [2023-12-02 12:31:13,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:31:13,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:31:13,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:31:13,655 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:31:13,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 12:31:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:31:13,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-02 12:31:13,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:31:13,806 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 12:31:13,925 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 12:31:13,925 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 12:31:13,931 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 12:31:13,961 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 12:31:13,961 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:31:14,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226191022] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:31:14,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [338011882] [2023-12-02 12:31:14,083 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 12:31:14,083 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:31:14,083 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:31:14,083 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:31:14,084 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:31:14,725 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2023-12-02 12:31:15,230 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:31:32,553 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1843#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_#memory_int_94| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_94| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_int_94| |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))))) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 7) (= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (exists ((|v_#memory_$Pointer$.offset_117| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_117| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_117| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 0)))) (exists ((|v_#memory_$Pointer$.base_117| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_117| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_117| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |#memory_$Pointer$.base|)) (= 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)) (= |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 12:31:32,553 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:31:32,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 12:31:32,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2023-12-02 12:31:32,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105932527] [2023-12-02 12:31:32,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 12:31:32,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 12:31:32,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:31:32,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 12:31:32,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=707, Unknown=4, NotChecked=0, Total=812 [2023-12-02 12:31:32,555 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand has 14 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 12:31:32,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:31:32,961 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2023-12-02 12:31:32,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 12:31:32,962 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2023-12-02 12:31:32,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:31:32,963 INFO L225 Difference]: With dead ends: 124 [2023-12-02 12:31:32,963 INFO L226 Difference]: Without dead ends: 124 [2023-12-02 12:31:32,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=123, Invalid=803, Unknown=4, NotChecked=0, Total=930 [2023-12-02 12:31:32,964 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 6 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 12:31:32,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 397 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 12:31:32,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-12-02 12:31:32,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2023-12-02 12:31:32,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 61 states have (on average 2.0491803278688523) internal successors, (125), 116 states have internal predecessors, (125), 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 12:31:32,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2023-12-02 12:31:32,971 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 21 [2023-12-02 12:31:32,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:31:32,972 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2023-12-02 12:31:32,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 12:31:32,972 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2023-12-02 12:31:32,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 12:31:32,973 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:31:32,973 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 12:31:32,979 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 12:31:33,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-02 12:31:33,178 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-12-02 12:31:33,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:31:33,178 INFO L85 PathProgramCache]: Analyzing trace with hash -973139146, now seen corresponding path program 1 times [2023-12-02 12:31:33,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:31:33,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372109952] [2023-12-02 12:31:33,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:31:33,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:31:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:31:33,264 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 12:31:33,264 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:31:33,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372109952] [2023-12-02 12:31:33,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372109952] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:31:33,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505075239] [2023-12-02 12:31:33,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:31:33,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:31:33,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:31:33,266 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:31:33,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 12:31:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:31:33,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 12:31:33,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:31:33,401 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 12:31:33,401 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:31:33,434 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 12:31:33,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505075239] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:31:33,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [296433906] [2023-12-02 12:31:33,437 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-12-02 12:31:33,437 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:31:33,437 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:31:33,437 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:31:33,438 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:31:34,079 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-12-02 12:31:34,230 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:31:44,459 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2244#(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 12:31:44,459 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:31:44,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:31:44,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2023-12-02 12:31:44,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51999368] [2023-12-02 12:31:44,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:31:44,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 12:31:44,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:31:44,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 12:31:44,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=359, Unknown=3, NotChecked=0, Total=420 [2023-12-02 12:31:44,461 INFO L87 Difference]: Start difference. First operand 122 states and 133 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 12:31:44,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:31:44,551 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2023-12-02 12:31:44,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:31:44,552 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 12:31:44,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:31:44,553 INFO L225 Difference]: With dead ends: 123 [2023-12-02 12:31:44,553 INFO L226 Difference]: Without dead ends: 123 [2023-12-02 12:31:44,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=63, Invalid=396, Unknown=3, NotChecked=0, Total=462 [2023-12-02 12:31:44,554 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 3 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:31:44,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 511 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:31:44,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-02 12:31:44,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2023-12-02 12:31:44,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 116 states have internal predecessors, (124), 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 12:31:44,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2023-12-02 12:31:44,559 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 23 [2023-12-02 12:31:44,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:31:44,560 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2023-12-02 12:31:44,560 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 12:31:44,560 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2023-12-02 12:31:44,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 12:31:44,561 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:31:44,561 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 12:31:44,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 12:31:44,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:31:44,763 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-12-02 12:31:44,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:31:44,764 INFO L85 PathProgramCache]: Analyzing trace with hash -107533297, now seen corresponding path program 1 times [2023-12-02 12:31:44,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:31:44,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475317053] [2023-12-02 12:31:44,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:31:44,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:31:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:31:44,844 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 12:31:44,844 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:31:44,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475317053] [2023-12-02 12:31:44,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475317053] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:31:44,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100301658] [2023-12-02 12:31:44,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:31:44,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:31:44,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:31:44,846 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:31:44,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 12:31:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:31:44,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 12:31:44,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:31:44,997 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 12:31:44,998 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:31:45,012 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 12:31:45,012 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 12:31:45,031 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 12:31:45,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100301658] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:31:45,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [387428745] [2023-12-02 12:31:45,034 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 12:31:45,034 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:31:45,034 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:31:45,034 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:31:45,035 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:31:45,891 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2023-12-02 12:31:46,298 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:32:02,937 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2649#(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 12:32:02,938 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:32:02,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:32:02,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2023-12-02 12:32:02,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322066159] [2023-12-02 12:32:02,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:32:02,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 12:32:02,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:32:02,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 12:32:02,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=357, Unknown=7, NotChecked=0, Total=420 [2023-12-02 12:32:02,940 INFO L87 Difference]: Start difference. First operand 122 states and 132 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 12:32:03,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:32:03,133 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2023-12-02 12:32:03,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 12:32:03,133 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 12:32:03,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:32:03,136 INFO L225 Difference]: With dead ends: 127 [2023-12-02 12:32:03,136 INFO L226 Difference]: Without dead ends: 127 [2023-12-02 12:32:03,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=62, Invalid=393, Unknown=7, NotChecked=0, Total=462 [2023-12-02 12:32:03,138 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 6 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:32:03,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 319 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:32:03,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-12-02 12:32:03,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2023-12-02 12:32:03,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 64 states have (on average 2.015625) internal successors, (129), 119 states have internal predecessors, (129), 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 12:32:03,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2023-12-02 12:32:03,144 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 24 [2023-12-02 12:32:03,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:32:03,144 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2023-12-02 12:32:03,145 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 12:32:03,145 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2023-12-02 12:32:03,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 12:32:03,146 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:32:03,146 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 12:32:03,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 12:32:03,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-12-02 12:32:03,350 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-12-02 12:32:03,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:32:03,350 INFO L85 PathProgramCache]: Analyzing trace with hash -107533296, now seen corresponding path program 1 times [2023-12-02 12:32:03,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:32:03,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836370357] [2023-12-02 12:32:03,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:32:03,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:32:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:32:03,532 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 12:32:03,533 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:32:03,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836370357] [2023-12-02 12:32:03,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836370357] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:32:03,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137539634] [2023-12-02 12:32:03,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:32:03,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:32:03,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:32:03,534 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:32:03,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 12:32:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:32:03,667 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 12:32:03,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:32:03,799 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 12:32:03,799 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:32:03,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:32:03,842 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 12:32:03,978 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 12:32:03,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137539634] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:32:03,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [829819171] [2023-12-02 12:32:03,981 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 12:32:03,982 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:32:03,982 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:32:03,982 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:32:03,982 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:32:04,875 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 155 for LOIs [2023-12-02 12:32:05,306 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:32:21,607 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3072#(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 12:32:21,607 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:32:21,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:32:21,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2023-12-02 12:32:21,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704555670] [2023-12-02 12:32:21,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:32:21,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 12:32:21,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:32:21,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 12:32:21,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=823, Unknown=6, NotChecked=0, Total=930 [2023-12-02 12:32:21,609 INFO L87 Difference]: Start difference. First operand 125 states and 137 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 12:32:21,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:32:21,874 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2023-12-02 12:32:21,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 12:32:21,875 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 12:32:21,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:32:21,876 INFO L225 Difference]: With dead ends: 129 [2023-12-02 12:32:21,876 INFO L226 Difference]: Without dead ends: 129 [2023-12-02 12:32:21,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=118, Invalid=932, Unknown=6, NotChecked=0, Total=1056 [2023-12-02 12:32:21,877 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 20 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:32:21,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 940 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 12:32:21,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-12-02 12:32:21,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2023-12-02 12:32:21,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 64 states have (on average 2.0) internal successors, (128), 119 states have internal predecessors, (128), 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 12:32:21,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2023-12-02 12:32:21,881 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 24 [2023-12-02 12:32:21,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:32:21,881 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2023-12-02 12:32:21,882 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 12:32:21,882 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2023-12-02 12:32:21,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 12:32:21,882 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:32:21,882 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 12:32:21,887 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 12:32:22,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 12:32:22,083 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-12-02 12:32:22,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:32:22,084 INFO L85 PathProgramCache]: Analyzing trace with hash 961435094, now seen corresponding path program 1 times [2023-12-02 12:32:22,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:32:22,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711311802] [2023-12-02 12:32:22,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:32:22,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:32:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:32:22,171 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 12:32:22,171 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:32:22,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711311802] [2023-12-02 12:32:22,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711311802] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:32:22,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:32:22,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 12:32:22,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864724813] [2023-12-02 12:32:22,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:32:22,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 12:32:22,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:32:22,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 12:32:22,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-02 12:32:22,174 INFO L87 Difference]: Start difference. First operand 125 states and 136 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 12:32:22,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:32:22,405 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2023-12-02 12:32:22,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 12:32:22,406 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 12:32:22,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:32:22,407 INFO L225 Difference]: With dead ends: 125 [2023-12-02 12:32:22,407 INFO L226 Difference]: Without dead ends: 125 [2023-12-02 12:32:22,407 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 12:32:22,408 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 9 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:32:22,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 378 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 12:32:22,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-12-02 12:32:22,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2023-12-02 12:32:22,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 64 states have (on average 1.984375) internal successors, (127), 118 states have internal predecessors, (127), 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 12:32:22,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2023-12-02 12:32:22,412 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 25 [2023-12-02 12:32:22,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:32:22,413 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2023-12-02 12:32:22,413 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 12:32:22,413 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2023-12-02 12:32:22,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 12:32:22,414 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:32:22,414 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 12:32:22,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 12:32:22,414 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-12-02 12:32:22,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:32:22,415 INFO L85 PathProgramCache]: Analyzing trace with hash 961435095, now seen corresponding path program 1 times [2023-12-02 12:32:22,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:32:22,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540673518] [2023-12-02 12:32:22,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:32:22,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:32:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:32:22,618 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 12:32:22,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:32:22,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540673518] [2023-12-02 12:32:22,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540673518] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:32:22,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:32:22,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 12:32:22,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449991727] [2023-12-02 12:32:22,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:32:22,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 12:32:22,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:32:22,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 12:32:22,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-02 12:32:22,621 INFO L87 Difference]: Start difference. First operand 124 states and 135 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 12:32:22,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:32:22,908 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2023-12-02 12:32:22,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 12:32:22,909 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 12:32:22,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:32:22,910 INFO L225 Difference]: With dead ends: 123 [2023-12-02 12:32:22,910 INFO L226 Difference]: Without dead ends: 123 [2023-12-02 12:32:22,910 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 12:32:22,911 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 7 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 12:32:22,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 408 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 12:32:22,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-02 12:32:22,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2023-12-02 12:32:22,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 64 states have (on average 1.96875) internal successors, (126), 117 states have internal predecessors, (126), 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 12:32:22,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2023-12-02 12:32:22,916 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 25 [2023-12-02 12:32:22,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:32:22,916 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2023-12-02 12:32:22,916 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 12:32:22,917 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2023-12-02 12:32:22,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 12:32:22,918 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:32:22,918 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 12:32:22,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 12:32:22,918 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-12-02 12:32:22,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:32:22,919 INFO L85 PathProgramCache]: Analyzing trace with hash -2056327038, now seen corresponding path program 1 times [2023-12-02 12:32:22,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:32:22,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907178] [2023-12-02 12:32:22,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:32:22,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:32:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:32:23,019 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-02 12:32:23,020 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:32:23,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907178] [2023-12-02 12:32:23,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907178] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:32:23,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492570761] [2023-12-02 12:32:23,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:32:23,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:32:23,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:32:23,021 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:32:23,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 12:32:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:32:23,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 12:32:23,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:32:23,199 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 12:32:23,199 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:32:23,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492570761] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:32:23,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 12:32:23,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-12-02 12:32:23,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258727923] [2023-12-02 12:32:23,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:32:23,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:32:23,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:32:23,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:32:23,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:32:23,201 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 12:32:23,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:32:23,234 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2023-12-02 12:32:23,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:32:23,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 34 [2023-12-02 12:32:23,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:32:23,236 INFO L225 Difference]: With dead ends: 111 [2023-12-02 12:32:23,236 INFO L226 Difference]: Without dead ends: 111 [2023-12-02 12:32:23,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:32:23,237 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 4 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 12:32:23,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 201 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 12:32:23,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-02 12:32:23,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-12-02 12:32:23,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 57 states have (on average 1.9649122807017543) internal successors, (112), 106 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 12:32:23,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2023-12-02 12:32:23,241 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 34 [2023-12-02 12:32:23,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:32:23,241 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2023-12-02 12:32:23,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 12:32:23,242 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2023-12-02 12:32:23,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 12:32:23,242 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:32:23,243 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 12:32:23,249 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 12:32:23,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-02 12:32:23,449 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-12-02 12:32:23,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:32:23,449 INFO L85 PathProgramCache]: Analyzing trace with hash 326901281, now seen corresponding path program 1 times [2023-12-02 12:32:23,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:32:23,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200112534] [2023-12-02 12:32:23,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:32:23,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:32:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:32:23,893 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 12:32:23,893 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:32:23,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200112534] [2023-12-02 12:32:23,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200112534] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:32:23,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467518202] [2023-12-02 12:32:23,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:32:23,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:32:23,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:32:23,895 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:32:23,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 12:32:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:32:24,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-02 12:32:24,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:32:24,106 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 12:32:24,112 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 12:32:24,144 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 12:32:24,144 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 12:32:24,189 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 12:32:24,196 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 12:32:24,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:32:24,221 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 12:32:24,264 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-12-02 12:32:24,280 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 12:32:24,280 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 12 treesize of output 14 [2023-12-02 12:32:24,294 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 15 not checked. [2023-12-02 12:32:24,295 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:32:24,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467518202] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:32:24,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1360676888] [2023-12-02 12:32:24,502 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-12-02 12:32:24,502 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:32:24,503 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:32:24,503 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:32:24,503 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:32:25,540 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 12:32:25,567 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:32:41,220 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4362#(and (= 5 |ULTIMATE.start_dll_circular_prepend_#in~data#1|) (<= 2 |ULTIMATE.start_dll_circular_prepend_#in~head#1.base|) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 0) (= |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) (or (and (= |ULTIMATE.start_dll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_191| (Array Int Int))) (and (= (store |v_#valid_191| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_191| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0))) (exists ((|v_#memory_$Pointer$.base_215| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_215| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.base_215| |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(#memory_$Pointer$.base)_AFTER_CALL_50| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_50| (Array Int Int)) (|v_#memory_int_198| (Array Int (Array Int Int))) (|v_#memory_int_199| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_50| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_80| (Array Int Int)) (|v_#memory_$Pointer$.offset_221| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_221| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_198| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_50| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_int_198| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_50| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 (select (select |v_#memory_int_199| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_50| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0))) |v_#memory_int_199|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_50| (store (store |v_#memory_$Pointer$.base_221| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_50| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.base_221| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_50| |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_221| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_50| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.base_221| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_50| |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_50| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)))) (= |v_old(#memory_int)_AFTER_CALL_50| (store |v_#memory_int_199| |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |v_#memory_int_199| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_50| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)))) (= (select |v_old(#valid)_AFTER_CALL_50| |ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_50| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_50| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 1) (<= 4 (select |v_#length_BEFORE_CALL_80| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_50| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (= |ULTIMATE.start_dll_circular_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_50| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (<= 8 (select |v_#length_BEFORE_CALL_80| |ULTIMATE.start_dll_circular_create_#res#1.base|)) (= (select (select (store (store |v_#memory_$Pointer$.offset_221| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_50| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_221| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_50| |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_221| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_50| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_221| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_50| |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_#memory_$Pointer$.offset_215| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_215| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_215| |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_#length_163| (Array Int Int))) (= (store |v_#length_163| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 12) |#length|)) (<= (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_192| (Array Int (Array Int Int))) (|v_#memory_int_193| (Array Int (Array Int Int))) (|v_#memory_int_194| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_194| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_194| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8 5))) (= (store |v_#memory_int_193| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_193| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_194| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4))) |v_#memory_int_194|) (= |v_#memory_int_193| (store |v_#memory_int_192| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_192| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_193| |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|)) (and (= |ULTIMATE.start_dll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_191| (Array Int Int))) (and (= (store |v_#valid_191| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_191| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0))) (exists ((|v_#memory_$Pointer$.base_215| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_215| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.base_215| |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_#memory_$Pointer$.offset_215| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_215| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_215| |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_#length_163| (Array Int Int))) (= (store |v_#length_163| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 12) |#length|)) (<= (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_192| (Array Int (Array Int Int))) (|v_#memory_int_193| (Array Int (Array Int Int))) (|v_#memory_int_194| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_194| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_194| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8 5))) (= (store |v_#memory_int_193| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_193| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_194| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4))) |v_#memory_int_194|) (= |v_#memory_int_193| (store |v_#memory_int_192| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_192| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_193| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0)))))) (exists ((|v_old(#memory_int)_AFTER_CALL_49| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_49| (Array Int Int)) (|v_#memory_int_198| (Array Int (Array Int Int))) (|v_#memory_int_199| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_#memory_$Pointer$.offset_221| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_221| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_49| (Array Int (Array Int Int)))) (and (= (select (select (store (store |v_#memory_$Pointer$.offset_221| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_49| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_221| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_49| |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_221| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_49| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_221| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_49| |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_old(#memory_int)_AFTER_CALL_49| (store |v_#memory_int_199| |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |v_#memory_int_199| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_49| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)))) (= (store |v_#memory_int_198| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_49| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_int_198| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_49| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 (select (select |v_#memory_int_199| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_49| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0))) |v_#memory_int_199|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_49| (store (store |v_#memory_$Pointer$.base_221| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_49| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.base_221| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_49| |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_221| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_49| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.base_221| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_49| |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_49| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)))) (<= 4 (select |v_old(#length)_AFTER_CALL_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_49| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (= |ULTIMATE.start_dll_circular_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_49| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (<= 8 (select |v_old(#length)_AFTER_CALL_49| |ULTIMATE.start_dll_circular_create_#res#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_49| |ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_49| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 1))) (= |ULTIMATE.start_dll_circular_prepend_~head#1.base| |ULTIMATE.start_dll_circular_prepend_#in~head#1.base|))) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_prepend_~data#1| 5) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_circular_prepend_#in~head#1.offset| 0))' at error location [2023-12-02 12:32:41,220 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:32:41,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 12:32:41,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2023-12-02 12:32:41,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814634832] [2023-12-02 12:32:41,221 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 12:32:41,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 12:32:41,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:32:41,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 12:32:41,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1416, Unknown=13, NotChecked=154, Total=1722 [2023-12-02 12:32:41,222 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand has 19 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 16 states have internal predecessors, (50), 3 states have call successors, (4), 1 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-02 12:32:41,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:32:41,824 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2023-12-02 12:32:41,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 12:32:41,825 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 16 states have internal predecessors, (50), 3 states have call successors, (4), 1 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 34 [2023-12-02 12:32:41,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:32:41,826 INFO L225 Difference]: With dead ends: 120 [2023-12-02 12:32:41,826 INFO L226 Difference]: Without dead ends: 120 [2023-12-02 12:32:41,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=171, Invalid=1629, Unknown=14, NotChecked=166, Total=1980 [2023-12-02 12:32:41,828 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 484 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 246 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 12:32:41,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 329 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 539 Invalid, 0 Unknown, 246 Unchecked, 0.4s Time] [2023-12-02 12:32:41,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-02 12:32:41,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2023-12-02 12:32:41,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 57 states have (on average 1.8245614035087718) internal successors, (104), 98 states have internal predecessors, (104), 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 12:32:41,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2023-12-02 12:32:41,832 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 34 [2023-12-02 12:32:41,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:32:41,832 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2023-12-02 12:32:41,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 16 states have internal predecessors, (50), 3 states have call successors, (4), 1 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-02 12:32:41,832 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2023-12-02 12:32:41,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 12:32:41,833 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:32:41,833 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 12:32:41,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-02 12:32:42,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:32:42,034 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-12-02 12:32:42,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:32:42,034 INFO L85 PathProgramCache]: Analyzing trace with hash 326901282, now seen corresponding path program 1 times [2023-12-02 12:32:42,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:32:42,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331929929] [2023-12-02 12:32:42,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:32:42,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:32:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:32:42,622 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 12:32:42,622 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:32:42,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331929929] [2023-12-02 12:32:42,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331929929] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:32:42,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75925849] [2023-12-02 12:32:42,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:32:42,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:32:42,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:32:42,624 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:32:42,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 12:32:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:32:42,811 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 12:32:42,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:32:42,824 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 12:32:42,831 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 12:32:42,839 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 12:32:42,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:32:42,866 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 12:32:42,890 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 12:32:42,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:32:42,923 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 12:32:42,981 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 12:32:43,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:32:43,015 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 12:32:43,023 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 12:32:43,023 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:32:43,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75925849] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:32:43,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 12:32:43,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2023-12-02 12:32:43,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914806196] [2023-12-02 12:32:43,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:32:43,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 12:32:43,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:32:43,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 12:32:43,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2023-12-02 12:32:43,025 INFO L87 Difference]: Start difference. First operand 103 states and 110 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 12:32:43,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:32:43,220 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2023-12-02 12:32:43,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 12:32:43,221 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 12:32:43,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:32:43,222 INFO L225 Difference]: With dead ends: 98 [2023-12-02 12:32:43,222 INFO L226 Difference]: Without dead ends: 98 [2023-12-02 12:32:43,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2023-12-02 12:32:43,223 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 29 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:32:43,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 240 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 206 Invalid, 0 Unknown, 131 Unchecked, 0.2s Time] [2023-12-02 12:32:43,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-02 12:32:43,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-12-02 12:32:43,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 57 states have (on average 1.736842105263158) internal successors, (99), 93 states have internal predecessors, (99), 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 12:32:43,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2023-12-02 12:32:43,227 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 34 [2023-12-02 12:32:43,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:32:43,227 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2023-12-02 12:32:43,227 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 12:32:43,227 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2023-12-02 12:32:43,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 12:32:43,228 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:32:43,228 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 12:32:43,234 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 12:32:43,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-02 12:32:43,429 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-12-02 12:32:43,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:32:43,429 INFO L85 PathProgramCache]: Analyzing trace with hash 2025220148, now seen corresponding path program 1 times [2023-12-02 12:32:43,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:32:43,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595437803] [2023-12-02 12:32:43,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:32:43,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:32:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:32:43,538 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 12:32:43,538 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:32:43,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595437803] [2023-12-02 12:32:43,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595437803] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:32:43,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:32:43,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 12:32:43,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193255631] [2023-12-02 12:32:43,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:32:43,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 12:32:43,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:32:43,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 12:32:43,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 12:32:43,540 INFO L87 Difference]: Start difference. First operand 98 states and 105 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 12:32:43,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:32:43,708 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2023-12-02 12:32:43,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:32:43,708 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 12:32:43,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:32:43,709 INFO L225 Difference]: With dead ends: 94 [2023-12-02 12:32:43,710 INFO L226 Difference]: Without dead ends: 94 [2023-12-02 12:32:43,710 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 12:32:43,710 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 23 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:32:43,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 240 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 12:32:43,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-02 12:32:43,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-12-02 12:32:43,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 89 states have internal predecessors, (95), 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 12:32:43,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2023-12-02 12:32:43,715 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 37 [2023-12-02 12:32:43,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:32:43,715 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2023-12-02 12:32:43,715 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 12:32:43,716 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2023-12-02 12:32:43,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 12:32:43,716 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:32:43,717 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 12:32:43,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 12:32:43,717 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-12-02 12:32:43,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:32:43,718 INFO L85 PathProgramCache]: Analyzing trace with hash 2025220149, now seen corresponding path program 1 times [2023-12-02 12:32:43,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:32:43,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227432446] [2023-12-02 12:32:43,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:32:43,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:32:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:32:43,964 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 12:32:43,964 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:32:43,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227432446] [2023-12-02 12:32:43,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227432446] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:32:43,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:32:43,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 12:32:43,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942863069] [2023-12-02 12:32:43,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:32:43,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 12:32:43,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:32:43,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 12:32:43,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 12:32:43,966 INFO L87 Difference]: Start difference. First operand 94 states and 101 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 12:32:44,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:32:44,171 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2023-12-02 12:32:44,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:32:44,171 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 12:32:44,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:32:44,172 INFO L225 Difference]: With dead ends: 90 [2023-12-02 12:32:44,173 INFO L226 Difference]: Without dead ends: 90 [2023-12-02 12:32:44,173 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 12:32:44,173 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 18 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:32:44,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 252 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 12:32:44,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-02 12:32:44,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-12-02 12:32:44,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 85 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 12:32:44,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2023-12-02 12:32:44,178 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 37 [2023-12-02 12:32:44,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:32:44,178 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2023-12-02 12:32:44,178 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 12:32:44,178 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2023-12-02 12:32:44,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 12:32:44,179 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:32:44,179 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 12:32:44,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-02 12:32:44,179 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-12-02 12:32:44,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:32:44,180 INFO L85 PathProgramCache]: Analyzing trace with hash 2025231071, now seen corresponding path program 1 times [2023-12-02 12:32:44,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:32:44,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025708193] [2023-12-02 12:32:44,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:32:44,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:32:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:32:44,860 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 12:32:44,860 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:32:44,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025708193] [2023-12-02 12:32:44,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025708193] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:32:44,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58424261] [2023-12-02 12:32:44,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:32:44,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:32:44,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:32:44,862 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:32:44,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 12:32:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:32:45,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-02 12:32:45,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:32:45,107 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 12:32:45,275 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 12:32:45,339 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|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2023-12-02 12:32:45,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:32:45,349 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 18 treesize of output 13 [2023-12-02 12:32:45,362 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-12-02 12:32:45,362 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 16 treesize of output 18 [2023-12-02 12:32:45,432 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 12:32:45,452 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-12-02 12:32:45,452 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:32:47,504 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1632 (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int)) (or (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_58| 1)) (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_58| 1) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_58| v_ArrVal_1632) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) 1))) is different from false [2023-12-02 12:32:47,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58424261] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:32:47,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [925046784] [2023-12-02 12:32:47,508 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-12-02 12:32:47,508 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:32:47,509 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:32:47,509 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:32:47,509 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:32:48,751 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 12:32:48,775 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:32:52,512 WARN L876 $PredicateComparison]: unable to prove that (and (= 2 |c_ULTIMATE.start_dll_circular_create_#in~len#1|) (= |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) (let ((.cse0 (exists ((|v_#length_174| (Array Int Int))) (= (store |v_#length_174| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 12) |c_#length|))) (.cse1 (exists ((|v_#valid_202| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_202| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= (select |v_#valid_202| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)))) (.cse2 (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (exists ((|v_#length_173| (Array Int Int))) (and (= 2 (select |v_#length_173| 1)) (= (select |v_#length_173| 2) 24)))) (.cse4 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse5 (= (select |c_ULTIMATE.start_main_old_#valid#1| 2) 1)) (.cse6 (<= 12 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (.cse7 (exists ((|v_#memory_int_210| (Array Int (Array Int Int))) (|v_#memory_int_211| (Array Int (Array Int Int))) (|v_#memory_int_212| (Array Int (Array Int Int)))) (let ((.cse18 (select |v_#memory_int_212| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse17 (select |v_#memory_int_211| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= |v_#memory_int_212| (store |v_#memory_int_211| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse17 4 (select .cse18 4)))) (= (store |v_#memory_int_212| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse18 8 1)) |c_#memory_int|) (= (store |v_#memory_int_210| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |v_#memory_int_210| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0 (select .cse17 0))) |v_#memory_int_211|))))) (.cse8 (<= (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse9 (exists ((|v_#memory_$Pointer$.base_238| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_238| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_238| |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)))))) (.cse10 (= (select |c_ULTIMATE.start_main_old_#valid#1| 1) 1)) (.cse11 (exists ((|v_#memory_$Pointer$.offset_233| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_233| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_233| |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)))))) (.cse13 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (.cse14 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse15 (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (exists ((|v_#memory_int_BEFORE_CALL_87| (Array Int (Array Int Int)))) (let ((.cse12 (select |v_#memory_int_BEFORE_CALL_87| 1))) (and (= 48 (select .cse12 0)) (= (select .cse12 1) 0)))) .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (exists ((|v_#memory_int_BEFORE_CALL_89| (Array Int (Array Int Int)))) (let ((.cse16 (select |v_#memory_int_BEFORE_CALL_89| 1))) (and (= (select .cse16 1) 0) (= 48 (select .cse16 0))))) .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15))) (<= 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 12:33:32,252 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5455#(and (= 5 |ULTIMATE.start_dll_circular_prepend_#in~data#1|) (<= 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|) (not (= (select |#valid| |ULTIMATE.start_dll_circular_prepend_#t~mem11#1.base|) 1)) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= 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_~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) (= (select |#valid| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 1) (= |ULTIMATE.start_dll_circular_prepend_~data#1| 5) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_circular_prepend_#in~head#1.offset| 0) (or (and (exists ((|v_#memory_$Pointer$.offset_233| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_233| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_233| |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_#memory_int_210| (Array Int (Array Int Int))) (|v_#memory_int_211| (Array Int (Array Int Int))) (|v_#memory_int_212| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_211| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_211| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_212| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4))) |v_#memory_int_212|) (= |#memory_int| (store |v_#memory_int_212| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_212| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8 5))) (= |v_#memory_int_211| (store |v_#memory_int_210| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_210| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_211| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0)))))) (exists ((|v_#memory_int_217| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_64| (Array Int Int)) (|v_#memory_$Pointer$.offset_239| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (Array Int (Array Int Int))) (|v_#memory_int_216| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_64| (Array Int Int)) (|v_#memory_$Pointer$.base_244| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_98| (Array Int (Array Int Int)))) (and (= (select |v_old(#valid)_AFTER_CALL_64| |ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= (store |v_#memory_int_216| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_int_216| (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_217| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0))) |v_#memory_int_217|) (<= 4 (select |v_old(#length)_AFTER_CALL_64| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (= (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) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_64| (store (store |v_#memory_$Pointer$.base_244| (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_244| (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_244| (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_244| (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)))) (<= 8 (select |v_old(#length)_AFTER_CALL_64| |ULTIMATE.start_dll_circular_create_#res#1.base|)) (= (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|) (= (select (select (store (store |v_#memory_$Pointer$.offset_239| (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_239| (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_239| (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_239| (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) (= (store |v_#memory_int_217| |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |v_#memory_int_217| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |v_#memory_int_BEFORE_CALL_98| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) |v_#memory_int_BEFORE_CALL_98|))) (exists ((|v_#valid_202| (Array Int Int))) (and (= (select |v_#valid_202| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0) (= (store |v_#valid_202| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1) |#valid|))) (exists ((|v_#length_174| (Array Int Int))) (= (store |v_#length_174| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 12) |#length|)) (exists ((|v_#memory_$Pointer$.base_238| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_238| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.base_238| |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))))) (not (= |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 0)) (<= (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_prepend_~head#1.base| |ULTIMATE.start_dll_circular_prepend_#in~head#1.base|)) (and (exists ((|v_#memory_$Pointer$.offset_233| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_233| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_233| |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_#memory_int_210| (Array Int (Array Int Int))) (|v_#memory_int_211| (Array Int (Array Int Int))) (|v_#memory_int_212| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_211| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_211| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_212| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4))) |v_#memory_int_212|) (= |#memory_int| (store |v_#memory_int_212| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_212| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8 5))) (= |v_#memory_int_211| (store |v_#memory_int_210| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_210| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_211| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0)))))) (exists ((|v_#valid_202| (Array Int Int))) (and (= (select |v_#valid_202| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0) (= (store |v_#valid_202| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1) |#valid|))) (exists ((|v_#length_174| (Array Int Int))) (= (store |v_#length_174| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 12) |#length|)) (exists ((|v_#memory_$Pointer$.base_238| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_238| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.base_238| |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))))) (not (= |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 0)) (exists ((|v_#memory_int_217| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_63| (Array Int Int)) (|v_#length_BEFORE_CALL_104| (Array Int Int)) (|v_#memory_$Pointer$.offset_239| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_63| (Array Int (Array Int Int))) (|v_#memory_int_216| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_96| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_244| (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) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| (store (store |v_#memory_$Pointer$.base_244| (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_244| (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_244| (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_244| (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)))) (= |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)) (= (store |v_#memory_int_217| |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |v_#memory_int_217| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |v_#memory_int_BEFORE_CALL_96| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) |v_#memory_int_BEFORE_CALL_96|) (= |v_#memory_int_217| (store |v_#memory_int_216| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_int_216| (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_217| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0)))) (<= 8 (select |v_#length_BEFORE_CALL_104| |ULTIMATE.start_dll_circular_create_#res#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_63| |ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (<= 4 (select |v_#length_BEFORE_CALL_104| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_63| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (= (select (select (store (store |v_#memory_$Pointer$.offset_239| (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_239| (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_239| (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_239| (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|) (= |ULTIMATE.start_dll_circular_prepend_~head#1.base| |ULTIMATE.start_dll_circular_prepend_#in~head#1.base|))))' at error location [2023-12-02 12:33:32,252 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:33:32,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 12:33:32,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2023-12-02 12:33:32,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143558715] [2023-12-02 12:33:32,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 12:33:32,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 12:33:32,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:33:32,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 12:33:32,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1736, Unknown=20, NotChecked=258, Total=2162 [2023-12-02 12:33:32,255 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 23 states, 17 states have (on average 3.0) internal successors, (51), 20 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 12:33:33,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:33:33,142 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2023-12-02 12:33:33,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 12:33:33,142 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 17 states have (on average 3.0) internal successors, (51), 20 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2023-12-02 12:33:33,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:33:33,143 INFO L225 Difference]: With dead ends: 89 [2023-12-02 12:33:33,143 INFO L226 Difference]: Without dead ends: 89 [2023-12-02 12:33:33,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 46.1s TimeCoverageRelationStatistics Valid=189, Invalid=2155, Unknown=20, NotChecked=288, Total=2652 [2023-12-02 12:33:33,145 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 160 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 12:33:33,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 541 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 917 Invalid, 0 Unknown, 95 Unchecked, 0.6s Time] [2023-12-02 12:33:33,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-02 12:33:33,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-02 12:33:33,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 84 states have internal predecessors, (90), 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 12:33:33,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2023-12-02 12:33:33,148 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 37 [2023-12-02 12:33:33,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:33:33,148 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2023-12-02 12:33:33,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 17 states have (on average 3.0) internal successors, (51), 20 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 12:33:33,148 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2023-12-02 12:33:33,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 12:33:33,149 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:33:33,149 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 12:33:33,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 12:33:33,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-02 12:33:33,349 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-12-02 12:33:33,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:33:33,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2025231072, now seen corresponding path program 1 times [2023-12-02 12:33:33,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:33:33,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030981997] [2023-12-02 12:33:33,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:33:33,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:33:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:33:34,774 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 12:33:34,774 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:33:34,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030981997] [2023-12-02 12:33:34,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030981997] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:33:34,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096718087] [2023-12-02 12:33:34,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:33:34,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:33:34,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:33:34,775 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:33:34,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 12:33:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:33:34,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-02 12:33:34,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:33:35,284 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 12:33:35,289 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 12:33:35,470 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 12:33:35,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:33:35,483 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 12:33:35,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:33:35,489 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 12:33:35,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:33:35,494 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 12:33:35,502 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-02 12:33:35,502 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 12:33:35,563 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 12:33:35,565 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 12:33:35,596 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 1 not checked. [2023-12-02 12:33:35,596 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:33:35,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096718087] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:33:35,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1121225727] [2023-12-02 12:33:35,912 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-12-02 12:33:35,912 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:33:35,913 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:33:35,913 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:33:35,913 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:33:37,165 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 12:33:37,187 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:34:22,972 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5823#(and (= 5 |ULTIMATE.start_dll_circular_prepend_#in~data#1|) (<= 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|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (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_~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) (= (select |#valid| |ULTIMATE.start_dll_circular_prepend_~head#1.base|) 1) (= |ULTIMATE.start_dll_circular_prepend_~data#1| 5) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (or (and (exists ((|v_old(#valid)_AFTER_CALL_74| (Array Int Int)) (|v_#memory_int_235| (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_#memory_$Pointer$.offset_262| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_74| (Array Int (Array Int Int))) (|v_#memory_int_234| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_267| (Array Int (Array Int Int)))) (and (= (select (select (store (store |v_#memory_$Pointer$.offset_262| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_74| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_262| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_74| |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_262| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_74| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_262| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_74| |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_74| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (store |v_#memory_int_234| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_74| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_int_234| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_74| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 (select (select |v_#memory_int_235| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_74| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0))) |v_#memory_int_235|) (= |v_old(#memory_int)_AFTER_CALL_74| (store |v_#memory_int_235| |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |v_#memory_int_235| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_74| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)))) (= 1 (select |v_old(#valid)_AFTER_CALL_74| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_74| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (= (select |v_old(#valid)_AFTER_CALL_74| |ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (<= 8 (select |v_#length_BEFORE_CALL_124| |ULTIMATE.start_dll_circular_create_#res#1.base|)) (<= 4 (select |v_#length_BEFORE_CALL_124| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_74| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_74| (store (store |v_#memory_$Pointer$.base_267| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_74| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.base_267| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_74| |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_267| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_74| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.base_267| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_74| |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_74| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)))))) (= |ULTIMATE.start_dll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_256| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_256| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_256| |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))))) (exists ((|v_#valid_211| (Array Int Int))) (and (= |#valid| (store |v_#valid_211| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1)) (= (select |v_#valid_211| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0))) (exists ((|v_#length_184| (Array Int Int))) (= (store |v_#length_184| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 12) |#length|)) (not (= |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 0)) (<= (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_prepend_~head#1.base| |ULTIMATE.start_dll_circular_prepend_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.base_261| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_261| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.base_261| |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_#memory_int_228| (Array Int (Array Int Int))) (|v_#memory_int_229| (Array Int (Array Int Int))) (|v_#memory_int_230| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_230| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_230| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8 5))) (= (store |v_#memory_int_228| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_228| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_229| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_229|) (= (store |v_#memory_int_229| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_229| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_230| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4))) |v_#memory_int_230|)))) (and (= |ULTIMATE.start_dll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_75| (Array Int Int)) (|v_#memory_int_BEFORE_CALL_116| (Array Int (Array Int Int))) (|v_#memory_int_235| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_75| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_262| (Array Int (Array Int Int))) (|v_#memory_int_234| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_267| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_75| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_75| |ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_75| (store (store |v_#memory_$Pointer$.base_267| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_75| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.base_267| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_75| |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_267| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_75| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.base_267| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_75| |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_75| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)))) (= |v_#memory_int_BEFORE_CALL_116| (store |v_#memory_int_235| |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |v_#memory_int_235| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |v_#memory_int_BEFORE_CALL_116| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)))) (= (store |v_#memory_int_234| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_75| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_int_234| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_75| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0 (select (select |v_#memory_int_235| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_75| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 0))) |v_#memory_int_235|) (<= 8 (select |v_old(#length)_AFTER_CALL_75| |ULTIMATE.start_dll_circular_create_#res#1.base|)) (<= 4 (select |v_old(#length)_AFTER_CALL_75| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_75| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (= (select |v_old(#valid)_AFTER_CALL_75| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_75| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4)) 1) (= (select (select (store (store |v_#memory_$Pointer$.offset_262| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_75| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_262| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_75| |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_262| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_75| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_262| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_75| |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_75| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (exists ((|v_#memory_$Pointer$.offset_256| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_256| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_256| |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))))) (exists ((|v_#valid_211| (Array Int Int))) (and (= |#valid| (store |v_#valid_211| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1)) (= (select |v_#valid_211| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0))) (exists ((|v_#length_184| (Array Int Int))) (= (store |v_#length_184| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 12) |#length|)) (not (= |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 0)) (<= (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_prepend_~head#1.base| |ULTIMATE.start_dll_circular_prepend_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.base_261| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_261| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (store (store (select |v_#memory_$Pointer$.base_261| |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_#memory_int_228| (Array Int (Array Int Int))) (|v_#memory_int_229| (Array Int (Array Int Int))) (|v_#memory_int_230| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_230| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_230| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8 5))) (= (store |v_#memory_int_228| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_228| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_229| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_229|) (= (store |v_#memory_int_229| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_229| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_230| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 4))) |v_#memory_int_230|))))) (= |ULTIMATE.start_dll_circular_prepend_#in~head#1.offset| 0))' at error location [2023-12-02 12:34:22,972 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:34:22,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 12:34:22,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2023-12-02 12:34:22,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015341873] [2023-12-02 12:34:22,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 12:34:22,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 12:34:22,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:34:22,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 12:34:22,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2555, Unknown=32, NotChecked=102, Total=2862 [2023-12-02 12:34:22,976 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 28 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 24 states have internal predecessors, (53), 4 states have call successors, (6), 3 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 12:34:25,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:34:25,157 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2023-12-02 12:34:25,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 12:34:25,158 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 24 states have internal predecessors, (53), 4 states have call successors, (6), 3 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 12:34:25,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:34:25,159 INFO L225 Difference]: With dead ends: 88 [2023-12-02 12:34:25,159 INFO L226 Difference]: Without dead ends: 88 [2023-12-02 12:34:25,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 48.0s TimeCoverageRelationStatistics Valid=255, Invalid=3612, Unknown=43, NotChecked=122, Total=4032 [2023-12-02 12:34:25,161 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 156 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 12:34:25,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 690 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1030 Invalid, 0 Unknown, 94 Unchecked, 1.0s Time] [2023-12-02 12:34:25,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-02 12:34:25,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-12-02 12:34:25,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 57 states have (on average 1.5614035087719298) internal successors, (89), 83 states have internal predecessors, (89), 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 12:34:25,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2023-12-02 12:34:25,166 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 37 [2023-12-02 12:34:25,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:34:25,167 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2023-12-02 12:34:25,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 24 states have internal predecessors, (53), 4 states have call successors, (6), 3 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 12:34:25,167 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2023-12-02 12:34:25,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 12:34:25,168 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:34:25,168 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 12:34:25,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 12:34:25,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:34:25,368 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-12-02 12:34:25,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:34:25,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1927848039, now seen corresponding path program 1 times [2023-12-02 12:34:25,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:34:25,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457426737] [2023-12-02 12:34:25,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:34:25,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:34:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:34:25,590 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 12:34:25,591 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:34:25,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457426737] [2023-12-02 12:34:25,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457426737] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:34:25,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:34:25,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 12:34:25,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730120675] [2023-12-02 12:34:25,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:34:25,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 12:34:25,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:34:25,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 12:34:25,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-02 12:34:25,592 INFO L87 Difference]: Start difference. First operand 88 states and 95 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 12:34:25,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:34:25,687 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2023-12-02 12:34:25,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:34:25,688 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 12:34:25,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:34:25,689 INFO L225 Difference]: With dead ends: 85 [2023-12-02 12:34:25,689 INFO L226 Difference]: Without dead ends: 85 [2023-12-02 12:34:25,689 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 12:34:25,690 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 96 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:34:25,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 152 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:34:25,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-02 12:34:25,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-12-02 12:34:25,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 80 states have internal predecessors, (86), 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 12:34:25,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2023-12-02 12:34:25,693 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 40 [2023-12-02 12:34:25,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:34:25,694 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2023-12-02 12:34:25,694 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 12:34:25,694 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2023-12-02 12:34:25,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 12:34:25,695 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:34:25,695 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 12:34:25,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-02 12:34:25,695 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-12-02 12:34:25,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:34:25,696 INFO L85 PathProgramCache]: Analyzing trace with hash -366248625, now seen corresponding path program 1 times [2023-12-02 12:34:25,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:34:25,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771785557] [2023-12-02 12:34:25,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:34:25,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:34:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:34:26,192 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 12:34:26,192 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:34:26,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771785557] [2023-12-02 12:34:26,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771785557] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:34:26,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048231993] [2023-12-02 12:34:26,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:34:26,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:34:26,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:34:26,193 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:34:26,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 12:34:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:34:26,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-02 12:34:26,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:34:26,556 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 12:34:26,579 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 12:34:26,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:34:26,587 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 12:34:26,609 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 12:34:26,624 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 12:34:26,624 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:34:26,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048231993] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:34:26,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1750833870] [2023-12-02 12:34:26,714 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2023-12-02 12:34:26,714 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:34:26,714 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:34:26,714 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:34:26,714 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:34:28,548 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 12:34:28,567 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:35:15,868 WARN L293 SmtUtils]: Spent 6.43s on a formula simplification. DAG size of input: 244 DAG size of output: 237 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:35:46,780 WARN L293 SmtUtils]: Spent 13.22s on a formula simplification. DAG size of input: 252 DAG size of output: 245 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:36:03,123 WARN L293 SmtUtils]: Spent 10.09s on a formula simplification. DAG size of input: 242 DAG size of output: 235 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:36:28,530 WARN L293 SmtUtils]: Spent 12.85s on a formula simplification. DAG size of input: 254 DAG size of output: 243 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:36:28,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1750833870] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:36:28,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-02 12:36:28,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [15, 15] total 49 [2023-12-02 12:36:28,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473798592] [2023-12-02 12:36:28,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:36:28,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 12:36:28,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:36:28,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 12:36:28,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2246, Unknown=37, NotChecked=96, Total=2550 [2023-12-02 12:36:28,533 INFO L87 Difference]: Start difference. First operand 85 states and 92 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 12:36:34,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 12:36:36,400 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 12:36:38,683 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 12:36:40,841 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 12:36:42,987 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 12:36:45,627 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 12:36:48,118 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 12:36:50,352 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 12:36:52,582 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 12:36:54,841 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 12:37:04,047 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 12:37:06,428 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 12:37:19,777 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 12:37:22,085 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 12:37:24,107 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 12:37:26,305 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 12:37:28,705 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 12:37:30,966 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 12:37:33,357 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 12:37:36,270 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 12:37:38,291 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 12:37:40,414 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 12:37:42,636 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 12:37:44,784 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 12:37:46,917 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 12:37:49,163 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 12:37:51,588 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 12:37:53,789 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 12:37:55,944 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 12:37:58,130 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 12:38:01,186 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 12:38:03,227 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 12:38:05,548 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 12:38:07,703 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 12:38:10,420 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 12:38:12,597 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 12:38:15,138 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 12:38:17,174 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 12:38:19,580 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 12:38:21,994 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 12:38:24,360 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 12:38:28,308 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 12:38:30,439 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 12:38:33,198 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 12:38:35,863 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 12:38:39,585 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 12:38:42,154 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (exists ((|v_#memory_$Pointer$.base_293| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_85| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_85| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_283| (Array Int (Array Int Int))) (|v_#memory_int_255| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_85| (Array Int Int)) (|v_#memory_int_256| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_133| (Array Int (Array Int Int)))) (let ((.cse37 (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|)) (= (store |v_#memory_int_255| .cse37 (store (select |v_#memory_int_255| .cse37) 0 (select (select |v_#memory_int_256| .cse37) 0))) |v_#memory_int_256|) (= (select |v_old(#valid)_AFTER_CALL_85| .cse37) 1) (= (select |v_old(#valid)_AFTER_CALL_85| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= (let ((.cse38 (store |v_#memory_$Pointer$.base_293| .cse37 (store (select |v_#memory_$Pointer$.base_293| .cse37) 0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)))) (store .cse38 |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store (select .cse38 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4 .cse37))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_85|) (= (select (select (let ((.cse39 (store |v_#memory_$Pointer$.offset_283| .cse37 (store (select |v_#memory_$Pointer$.offset_283| .cse37) 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_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| .cse37)) (= |v_#memory_int_BEFORE_CALL_133| (store |v_#memory_int_256| |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |v_#memory_int_256| |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)))))))) (.cse15 (exists ((|v_#memory_$Pointer$.base_293| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_86| (Array Int Int)) (|v_#length_BEFORE_CALL_145| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_86| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_283| (Array Int (Array Int Int))) (|v_#memory_int_255| (Array Int (Array Int Int))) (|v_#memory_int_256| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_135| (Array Int (Array Int Int)))) (let ((.cse35 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_86| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (and (= (let ((.cse34 (store |v_#memory_$Pointer$.base_293| .cse35 (store (select |v_#memory_$Pointer$.base_293| .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_86|) (<= 4 (select |v_#length_BEFORE_CALL_145| .cse35)) (= |v_#memory_int_256| (store |v_#memory_int_255| .cse35 (store (select |v_#memory_int_255| .cse35) 0 (select (select |v_#memory_int_256| .cse35) 0)))) (= (select (select (let ((.cse36 (store |v_#memory_$Pointer$.offset_283| .cse35 (store (select |v_#memory_$Pointer$.offset_283| .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_86| .cse35) 1) (= |v_#memory_int_BEFORE_CALL_135| (store |v_#memory_int_256| |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |v_#memory_int_256| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |v_#memory_int_BEFORE_CALL_135| |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 (= (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_~uneq~0#1| 5) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |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) (exists ((|v_#memory_$Pointer$.base_295| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_circular_prepend_#in~head#1.base_7| Int) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_25| Int) (|v_#memory_int_257| (Array Int (Array Int Int))) (|v_#memory_int_258| (Array Int (Array Int Int))) (|v_#memory_int_259| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_285| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| Int)) (let ((.cse1 (select |v_#memory_$Pointer$.base_295| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_25|)) (.cse0 (select |v_#memory_int_259| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|)) (.cse4 (select |v_#memory_$Pointer$.offset_285| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_25|))) (and (= (store |v_#memory_int_259| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| (store .cse0 4 (select (select |c_#memory_int| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|) 4))) |c_#memory_int|) (= (store |v_#memory_int_257| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_25| (store (select |v_#memory_int_257| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_25|) 0 (select (select |v_#memory_int_258| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_25|) 0))) |v_#memory_int_258|) (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_25|) 1) (<= 4 (select |c_#length| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_25|)) (= 0 (select .cse1 0)) (= |c_#memory_$Pointer$.base| (let ((.cse2 (store |v_#memory_$Pointer$.base_295| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_25| (store .cse1 0 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|)))) (store .cse2 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| (store (store (select .cse2 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|) 0 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|) 4 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|)))) (= (store |v_#memory_int_258| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| (store (select |v_#memory_int_258| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|) 0 (select .cse0 0))) |v_#memory_int_259|) (= |c_#memory_$Pointer$.offset| (let ((.cse3 (store |v_#memory_$Pointer$.offset_285| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_25| (store .cse4 0 0)))) (store .cse3 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| (store (store (select .cse3 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|) 0 0) 4 0)))) (= (select .cse4 0) 0) (let ((.cse5 (exists ((|v_#memory_$Pointer$.base_287| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_287| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| (store (store (store (select |v_#memory_$Pointer$.base_287| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|) 0 0) 4 0) 8 (select (select |v_#memory_$Pointer$.base_295| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|) 8))) |v_#memory_$Pointer$.base_295|))) (.cse6 (exists ((|v_#memory_int_249| (Array Int (Array Int Int))) (|v_#memory_int_250| (Array Int (Array Int Int))) (|v_#memory_int_251| (Array Int (Array Int Int)))) (let ((.cse16 (select |v_#memory_int_250| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|)) (.cse17 (select |v_#memory_int_251| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|))) (and (= (store |v_#memory_int_249| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| (store (select |v_#memory_int_249| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|) 0 (select .cse16 0))) |v_#memory_int_250|) (= (store |v_#memory_int_251| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| (store .cse17 8 5)) |v_#memory_int_257|) (= (store |v_#memory_int_250| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| (store .cse16 4 (select .cse17 4))) |v_#memory_int_251|))))) (.cse7 (exists ((|v_#valid_218| (Array Int Int))) (and (= (select |v_#valid_218| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|) 0) (= |c_#valid| (store |v_#valid_218| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| 1))))) (.cse8 (not (= |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| 0))) (.cse10 (= |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_25| |v_ULTIMATE.start_dll_circular_prepend_#in~head#1.base_7|)) (.cse11 (exists ((|v_#memory_$Pointer$.offset_277| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_277| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| (store (store (store (select |v_#memory_$Pointer$.offset_277| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|) 0 0) 4 0) 8 (select (select |v_#memory_$Pointer$.offset_285| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|) 8))) |v_#memory_$Pointer$.offset_285|))) (.cse12 (= |v_ULTIMATE.start_dll_circular_prepend_#in~head#1.base_7| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse13 (<= (+ |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| 1) |c_#StackHeapBarrier|)) (.cse14 (exists ((|v_#length_191| (Array Int Int))) (= |c_#length| (store |v_#length_191| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| 12))))) (or (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse5 .cse6 .cse7 .cse8 .cse10 .cse15 .cse11 .cse12 .cse13 .cse14)))))) (= |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|) (exists ((|v_#memory_$Pointer$.base_295| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_circular_prepend_#in~head#1.base_7| Int) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_25| Int) (|v_#memory_int_257| (Array Int (Array Int Int))) (|v_#memory_int_258| (Array Int (Array Int Int))) (|v_#memory_int_259| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_285| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| Int)) (let ((.cse19 (select |v_#memory_$Pointer$.base_295| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_25|)) (.cse18 (select |v_#memory_int_259| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|)) (.cse22 (select |v_#memory_$Pointer$.offset_285| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_25|))) (and (= (store |v_#memory_int_259| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| (store .cse18 4 (select (select |c_#memory_int| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|) 4))) |c_#memory_int|) (= (store |v_#memory_int_257| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_25| (store (select |v_#memory_int_257| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_25|) 0 (select (select |v_#memory_int_258| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_25|) 0))) |v_#memory_int_258|) (= 0 (select .cse19 0)) (= |c_#memory_$Pointer$.base| (let ((.cse20 (store |v_#memory_$Pointer$.base_295| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_25| (store .cse19 0 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|)))) (store .cse20 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| (store (store (select .cse20 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|) 0 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|) 4 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|)))) (= (store |v_#memory_int_258| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| (store (select |v_#memory_int_258| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|) 0 (select .cse18 0))) |v_#memory_int_259|) (= |c_#memory_$Pointer$.offset| (let ((.cse21 (store |v_#memory_$Pointer$.offset_285| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_25| (store .cse22 0 0)))) (store .cse21 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| (store (store (select .cse21 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|) 0 0) 4 0)))) (= (select .cse22 0) 0) (let ((.cse23 (exists ((|v_#memory_$Pointer$.base_287| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_287| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| (store (store (store (select |v_#memory_$Pointer$.base_287| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|) 0 0) 4 0) 8 (select (select |v_#memory_$Pointer$.base_295| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|) 8))) |v_#memory_$Pointer$.base_295|))) (.cse24 (exists ((|v_#memory_int_249| (Array Int (Array Int Int))) (|v_#memory_int_250| (Array Int (Array Int Int))) (|v_#memory_int_251| (Array Int (Array Int Int)))) (let ((.cse32 (select |v_#memory_int_250| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|)) (.cse33 (select |v_#memory_int_251| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|))) (and (= (store |v_#memory_int_249| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| (store (select |v_#memory_int_249| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|) 0 (select .cse32 0))) |v_#memory_int_250|) (= (store |v_#memory_int_251| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| (store .cse33 8 5)) |v_#memory_int_257|) (= (store |v_#memory_int_250| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| (store .cse32 4 (select .cse33 4))) |v_#memory_int_251|))))) (.cse25 (exists ((|v_#valid_218| (Array Int Int))) (and (= (select |v_#valid_218| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|) 0) (= |c_#valid| (store |v_#valid_218| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| 1))))) (.cse26 (not (= |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| 0))) (.cse27 (= |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_25| |v_ULTIMATE.start_dll_circular_prepend_#in~head#1.base_7|)) (.cse28 (exists ((|v_#memory_$Pointer$.offset_277| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_277| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| (store (store (store (select |v_#memory_$Pointer$.offset_277| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|) 0 0) 4 0) 8 (select (select |v_#memory_$Pointer$.offset_285| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30|) 8))) |v_#memory_$Pointer$.offset_285|))) (.cse29 (= |v_ULTIMATE.start_dll_circular_prepend_#in~head#1.base_7| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse30 (<= (+ |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| 1) |c_#StackHeapBarrier|)) (.cse31 (exists ((|v_#length_191| (Array Int Int))) (= |c_#length| (store |v_#length_191| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_30| 12))))) (or (and .cse23 .cse24 .cse25 .cse26 .cse9 .cse27 .cse28 .cse29 .cse30 .cse31) (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse15 .cse28 .cse29 .cse30 .cse31)))))) (= |c_ULTIMATE.start_main_~len~0#1| 2))) is different from false [2023-12-02 12:38:44,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:38:44,731 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2023-12-02 12:38:44,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-02 12:38:44,732 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 12:38:44,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:38:44,732 INFO L225 Difference]: With dead ends: 88 [2023-12-02 12:38:44,732 INFO L226 Difference]: Without dead ends: 88 [2023-12-02 12:38:44,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 140.0s TimeCoverageRelationStatistics Valid=188, Invalid=2531, Unknown=45, NotChecked=206, Total=2970 [2023-12-02 12:38:44,734 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 7 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 4 mSolverCounterUnsat, 66 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 114.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 66 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 116.5s IncrementalHoareTripleChecker+Time [2023-12-02 12:38:44,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 326 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1190 Invalid, 66 Unknown, 54 Unchecked, 116.5s Time] [2023-12-02 12:38:44,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-02 12:38:44,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-12-02 12:38:44,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.5) internal successors, (90), 83 states have internal predecessors, (90), 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 12:38:44,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2023-12-02 12:38:44,737 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 41 [2023-12-02 12:38:44,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:38:44,737 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2023-12-02 12:38:44,737 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 12:38:44,737 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2023-12-02 12:38:44,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 12:38:44,738 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:38:44,738 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 12:38:44,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-02 12:38:44,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-12-02 12:38:44,939 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-12-02 12:38:44,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:38:44,939 INFO L85 PathProgramCache]: Analyzing trace with hash -366248624, now seen corresponding path program 1 times [2023-12-02 12:38:44,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:38:44,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566759338] [2023-12-02 12:38:44,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:38:44,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:38:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:38:45,391 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 12:38:45,391 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:38:45,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566759338] [2023-12-02 12:38:45,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566759338] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:38:45,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673217137] [2023-12-02 12:38:45,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:38:45,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:38:45,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:38:45,392 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:38:45,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 12:38:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:38:45,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-02 12:38:45,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:38:45,812 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 12:38:45,836 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 12:38:45,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:38:45,844 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 12:38:45,868 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 12:38:45,883 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 12:38:45,883 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:38:45,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673217137] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:38:45,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [214012764] [2023-12-02 12:38:45,978 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2023-12-02 12:38:45,978 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:38:45,978 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:38:45,978 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:38:45,978 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:38:48,037 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 12:38:48,058 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:39:39,902 WARN L293 SmtUtils]: Spent 6.92s on a formula simplification. DAG size of input: 244 DAG size of output: 237 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:40:14,916 WARN L293 SmtUtils]: Spent 14.14s on a formula simplification. DAG size of input: 252 DAG size of output: 245 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:40:38,582 WARN L293 SmtUtils]: Spent 9.27s on a formula simplification. DAG size of input: 242 DAG size of output: 235 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:41:06,596 WARN L293 SmtUtils]: Spent 12.21s on a formula simplification. DAG size of input: 254 DAG size of output: 243 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:41:06,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [214012764] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:41:06,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-02 12:41:06,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [15, 15] total 49 [2023-12-02 12:41:06,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802100599] [2023-12-02 12:41:06,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:41:06,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 12:41:06,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:41:06,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 12:41:06,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2240, Unknown=41, NotChecked=96, Total=2550 [2023-12-02 12:41:06,600 INFO L87 Difference]: Start difference. First operand 88 states and 96 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 12:41:09,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 12:41:12,422 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 12:41:14,873 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 12:41:17,836 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 12:41:20,802 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 12:41:22,972 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 12:41:25,026 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 12:41:27,150 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 12:41:29,518 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 12:41:31,766 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 12:41:33,770 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 12:41:35,999 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 12:41:38,043 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 12:41:40,320 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 12:41:42,448 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 12:41:44,587 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 12:41:46,590 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 12:41:50,871 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 12:41:52,875 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 12:41:55,613 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 12:41:57,828 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 12:42:00,226 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 12:42:02,645 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 12:42:04,648 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 12:42:07,067 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 12:42:09,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 12:42:11,690 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 12:42:16,099 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 12:42:18,103 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 12:42:20,964 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 12:42:24,743 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 12:42:26,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 12:42:30,380 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 12:42:35,533 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 12:42:38,365 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (exists ((|v_#memory_int_280| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_97| (Array Int Int)) (|v_#memory_int_279| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_307| (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_$Pointer$.base_322| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_97| (Array Int (Array Int Int)))) (let ((.cse37 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_97| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_97| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (<= 4 (select |v_#length_BEFORE_CALL_164| .cse37)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_97| (let ((.cse38 (store |v_#memory_$Pointer$.base_322| .cse37 (store (select |v_#memory_$Pointer$.base_322| .cse37) 0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)))) (store .cse38 |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store (select .cse38 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4 .cse37)))) (= |v_old(#memory_int)_AFTER_CALL_97| (store |v_#memory_int_280| |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |v_#memory_int_280| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_97| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4)))) (= (select |v_old(#valid)_AFTER_CALL_97| .cse37) 1) (= (store |v_#memory_int_279| .cse37 (store (select |v_#memory_int_279| .cse37) 0 (select (select |v_#memory_int_280| .cse37) 0))) |v_#memory_int_280|) (<= 8 (select |v_#length_BEFORE_CALL_164| |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_97| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (select (select (let ((.cse39 (store |v_#memory_$Pointer$.offset_307| .cse37 (store (select |v_#memory_$Pointer$.offset_307| .cse37) 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))))) (.cse13 (exists ((|v_#memory_int_280| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_96| (Array Int Int)) (|v_#memory_int_279| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_307| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_96| (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_$Pointer$.base_322| (Array Int (Array Int Int)))) (let ((.cse34 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_96| .cse34) 1) (= (select (select (let ((.cse35 (store |v_#memory_$Pointer$.offset_307| .cse34 (store (select |v_#memory_$Pointer$.offset_307| .cse34) 0 0)))) (store .cse35 |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store (select .cse35 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4 0))) |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_96| (store |v_#memory_int_280| |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |v_#memory_int_280| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_96| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4)))) (= (store |v_#memory_int_279| .cse34 (store (select |v_#memory_int_279| .cse34) 0 (select (select |v_#memory_int_280| .cse34) 0))) |v_#memory_int_280|) (<= 4 (select |v_#length_BEFORE_CALL_162| .cse34)) (<= 8 (select |v_#length_BEFORE_CALL_162| |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_96| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| (let ((.cse36 (store |v_#memory_$Pointer$.base_322| .cse34 (store (select |v_#memory_$Pointer$.base_322| .cse34) 0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)))) (store .cse36 |c_ULTIMATE.start_dll_circular_create_#res#1.base| (store (select .cse36 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 4 .cse34)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_#res#1.base|)))))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#memory_int_281| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| Int) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_27| Int) (|v_#memory_$Pointer$.offset_309| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_324| (Array Int (Array Int Int))) (|v_#memory_int_282| (Array Int (Array Int Int))) (|v_#memory_int_283| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_circular_prepend_#in~head#1.base_9| Int)) (let ((.cse1 (select |v_#memory_int_283| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|)) (.cse0 (select |v_#memory_$Pointer$.offset_309| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_27|)) (.cse17 (select |v_#memory_$Pointer$.base_324| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_27|))) (and (= (select .cse0 0) 0) (= (store |v_#memory_int_283| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| (store .cse1 4 (select (select |c_#memory_int| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|) 4))) |c_#memory_int|) (= (store |v_#memory_int_282| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| (store (select |v_#memory_int_282| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|) 0 (select .cse1 0))) |v_#memory_int_283|) (= (let ((.cse2 (store |v_#memory_$Pointer$.offset_309| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_27| (store .cse0 0 0)))) (store .cse2 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| (store (store (select .cse2 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|) 0 0) 4 0))) |c_#memory_$Pointer$.offset|) (let ((.cse3 (exists ((|v_#memory_$Pointer$.base_316| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_316| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| (store (store (store (select |v_#memory_$Pointer$.base_316| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|) 0 0) 4 0) 8 (select (select |v_#memory_$Pointer$.base_324| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|) 8))) |v_#memory_$Pointer$.base_324|))) (.cse4 (exists ((|v_#valid_225| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_225| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| 1)) (= (select |v_#valid_225| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|) 0)))) (.cse5 (= |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_27| |v_ULTIMATE.start_dll_circular_prepend_#in~head#1.base_9|)) (.cse6 (exists ((|v_#memory_$Pointer$.offset_301| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_309| (store |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| (store (store (store (select |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|) 0 0) 4 0) 8 (select (select |v_#memory_$Pointer$.offset_309| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|) 8)))))) (.cse8 (not (= |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| 0))) (.cse9 (= |v_ULTIMATE.start_dll_circular_prepend_#in~head#1.base_9| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse10 (<= (+ |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| 1) |c_#StackHeapBarrier|)) (.cse11 (exists ((|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)))) (let ((.cse15 (select |v_#memory_int_275| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|)) (.cse14 (select |v_#memory_int_274| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|))) (and (= (store |v_#memory_int_274| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| (store .cse14 4 (select .cse15 4))) |v_#memory_int_275|) (= (store |v_#memory_int_275| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| (store .cse15 8 5)) |v_#memory_int_281|) (= (store |v_#memory_int_273| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| (store (select |v_#memory_int_273| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|) 0 (select .cse14 0))) |v_#memory_int_274|))))) (.cse12 (exists ((|v_#length_198| (Array Int Int))) (= (store |v_#length_198| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| 12) |c_#length|)))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse13 .cse10 .cse11 .cse12))) (= (store |v_#memory_int_281| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_27| (store (select |v_#memory_int_281| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_27|) 0 (select (select |v_#memory_int_282| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_27|) 0))) |v_#memory_int_282|) (= (let ((.cse16 (store |v_#memory_$Pointer$.base_324| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_27| (store .cse17 0 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|)))) (store .cse16 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| (store (store (select .cse16 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|) 0 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|) 4 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|))) |c_#memory_$Pointer$.base|) (= (select .cse17 0) 0)))) (= |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_~uneq~0#1| 5) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |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|) (exists ((|v_#memory_int_281| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| Int) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_27| Int) (|v_#memory_$Pointer$.offset_309| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_324| (Array Int (Array Int Int))) (|v_#memory_int_282| (Array Int (Array Int Int))) (|v_#memory_int_283| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_circular_prepend_#in~head#1.base_9| Int)) (let ((.cse19 (select |v_#memory_int_283| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|)) (.cse18 (select |v_#memory_$Pointer$.offset_309| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_27|)) (.cse33 (select |v_#memory_$Pointer$.base_324| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_27|))) (and (= (select .cse18 0) 0) (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_27|) 1) (= (store |v_#memory_int_283| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| (store .cse19 4 (select (select |c_#memory_int| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|) 4))) |c_#memory_int|) (<= 4 (select |c_#length| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_27|)) (= (store |v_#memory_int_282| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| (store (select |v_#memory_int_282| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|) 0 (select .cse19 0))) |v_#memory_int_283|) (= (let ((.cse20 (store |v_#memory_$Pointer$.offset_309| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_27| (store .cse18 0 0)))) (store .cse20 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| (store (store (select .cse20 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|) 0 0) 4 0))) |c_#memory_$Pointer$.offset|) (let ((.cse21 (exists ((|v_#memory_$Pointer$.base_316| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_316| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| (store (store (store (select |v_#memory_$Pointer$.base_316| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|) 0 0) 4 0) 8 (select (select |v_#memory_$Pointer$.base_324| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|) 8))) |v_#memory_$Pointer$.base_324|))) (.cse22 (exists ((|v_#valid_225| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_225| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| 1)) (= (select |v_#valid_225| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|) 0)))) (.cse23 (= |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_27| |v_ULTIMATE.start_dll_circular_prepend_#in~head#1.base_9|)) (.cse24 (exists ((|v_#memory_$Pointer$.offset_301| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_309| (store |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| (store (store (store (select |v_#memory_$Pointer$.offset_301| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|) 0 0) 4 0) 8 (select (select |v_#memory_$Pointer$.offset_309| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|) 8)))))) (.cse25 (not (= |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| 0))) (.cse26 (= |v_ULTIMATE.start_dll_circular_prepend_#in~head#1.base_9| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse27 (<= (+ |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| 1) |c_#StackHeapBarrier|)) (.cse28 (exists ((|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)))) (let ((.cse31 (select |v_#memory_int_275| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|)) (.cse30 (select |v_#memory_int_274| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|))) (and (= (store |v_#memory_int_274| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| (store .cse30 4 (select .cse31 4))) |v_#memory_int_275|) (= (store |v_#memory_int_275| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| (store .cse31 8 5)) |v_#memory_int_281|) (= (store |v_#memory_int_273| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| (store (select |v_#memory_int_273| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|) 0 (select .cse30 0))) |v_#memory_int_274|))))) (.cse29 (exists ((|v_#length_198| (Array Int Int))) (= (store |v_#length_198| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| 12) |c_#length|)))) (or (and .cse21 .cse22 .cse23 .cse24 .cse7 .cse25 .cse26 .cse27 .cse28 .cse29) (and .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse13 .cse27 .cse28 .cse29))) (= (store |v_#memory_int_281| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_27| (store (select |v_#memory_int_281| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_27|) 0 (select (select |v_#memory_int_282| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_27|) 0))) |v_#memory_int_282|) (= (let ((.cse32 (store |v_#memory_$Pointer$.base_324| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_27| (store .cse33 0 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|)))) (store .cse32 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33| (store (store (select .cse32 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|) 0 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|) 4 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base_33|))) |c_#memory_$Pointer$.base|) (= (select .cse33 0) 0)))) (= |c_ULTIMATE.start_main_~len~0#1| 2))) is different from false [2023-12-02 12:42:43,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:42:43,622 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2023-12-02 12:42:43,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-02 12:42:43,623 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 12:42:43,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:42:43,623 INFO L225 Difference]: With dead ends: 88 [2023-12-02 12:42:43,623 INFO L226 Difference]: Without dead ends: 88 [2023-12-02 12:42:43,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 141.0s TimeCoverageRelationStatistics Valid=175, Invalid=2241, Unknown=42, NotChecked=194, Total=2652 [2023-12-02 12:42:43,625 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 2 mSolverCounterUnsat, 124 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 92.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 124 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 94.9s IncrementalHoareTripleChecker+Time [2023-12-02 12:42:43,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 332 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1130 Invalid, 124 Unknown, 27 Unchecked, 94.9s Time] [2023-12-02 12:42:43,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-02 12:42:43,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-12-02 12:42:43,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 83 states have internal predecessors, (89), 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 12:42:43,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2023-12-02 12:42:43,628 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 41 [2023-12-02 12:42:43,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:42:43,628 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2023-12-02 12:42:43,628 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 12:42:43,628 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2023-12-02 12:42:43,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 12:42:43,628 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:42:43,629 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 12:42:43,635 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 12:42:43,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-12-02 12:42:43,829 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-12-02 12:42:43,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:42:43,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1290946375, now seen corresponding path program 1 times [2023-12-02 12:42:43,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:42:43,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617793917] [2023-12-02 12:42:43,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:42:43,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:42:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:42:43,905 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 12:42:43,905 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:42:43,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617793917] [2023-12-02 12:42:43,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617793917] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:42:43,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:42:43,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 12:42:43,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422194044] [2023-12-02 12:42:43,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:42:43,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 12:42:43,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:42:43,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 12:42:43,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:42:43,907 INFO L87 Difference]: Start difference. First operand 88 states and 95 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 12:42:44,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:42:44,025 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2023-12-02 12:42:44,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:42:44,026 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 12:42:44,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:42:44,026 INFO L225 Difference]: With dead ends: 87 [2023-12-02 12:42:44,026 INFO L226 Difference]: Without dead ends: 87 [2023-12-02 12:42:44,027 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 12:42:44,027 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 6 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:42:44,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 212 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:42:44,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-02 12:42:44,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-12-02 12:42:44,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 82 states have internal predecessors, (88), 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 12:42:44,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2023-12-02 12:42:44,031 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 41 [2023-12-02 12:42:44,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:42:44,031 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2023-12-02 12:42:44,031 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 12:42:44,031 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2023-12-02 12:42:44,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 12:42:44,032 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:42:44,032 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 12:42:44,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-02 12:42:44,032 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-12-02 12:42:44,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:42:44,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1290946376, now seen corresponding path program 1 times [2023-12-02 12:42:44,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:42:44,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124472101] [2023-12-02 12:42:44,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:42:44,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:42:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:42:44,163 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 12:42:44,164 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:42:44,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124472101] [2023-12-02 12:42:44,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124472101] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:42:44,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:42:44,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 12:42:44,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589468773] [2023-12-02 12:42:44,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:42:44,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 12:42:44,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:42:44,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 12:42:44,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:42:44,166 INFO L87 Difference]: Start difference. First operand 87 states and 94 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 12:42:44,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:42:44,307 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2023-12-02 12:42:44,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:42:44,307 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 12:42:44,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:42:44,308 INFO L225 Difference]: With dead ends: 86 [2023-12-02 12:42:44,308 INFO L226 Difference]: Without dead ends: 86 [2023-12-02 12:42:44,308 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 12:42:44,309 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 5 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:42:44,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 224 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:42:44,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-02 12:42:44,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-12-02 12:42:44,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.45) internal successors, (87), 81 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 12:42:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2023-12-02 12:42:44,312 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 41 [2023-12-02 12:42:44,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:42:44,313 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2023-12-02 12:42:44,313 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 12:42:44,313 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2023-12-02 12:42:44,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 12:42:44,314 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:42:44,314 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 12:42:44,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-02 12:42:44,314 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-12-02 12:42:44,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:42:44,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1364632011, now seen corresponding path program 1 times [2023-12-02 12:42:44,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:42:44,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825220682] [2023-12-02 12:42:44,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:42:44,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:42:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:42:46,027 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 12:42:46,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:42:46,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825220682] [2023-12-02 12:42:46,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825220682] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:42:46,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226055615] [2023-12-02 12:42:46,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:42:46,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:42:46,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:42:46,028 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:42:46,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 12:42:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:42:46,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 54 conjunts are in the unsatisfiable core [2023-12-02 12:42:46,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:42:46,399 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 39 treesize of output 1 [2023-12-02 12:42:46,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:42:46,443 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 29 treesize of output 32 [2023-12-02 12:42:46,447 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 18 treesize of output 14 [2023-12-02 12:42:46,453 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 12:42:46,454 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 7 [2023-12-02 12:42:46,565 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$.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 12:42:46,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:42:46,584 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 12:42:46,584 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 37 treesize of output 36 [2023-12-02 12:42:46,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:42:46,590 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 28 treesize of output 23 [2023-12-02 12:42:46,620 INFO L349 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2023-12-02 12:42:46,620 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 42 treesize of output 64 [2023-12-02 12:42:46,680 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 27 treesize of output 19 [2023-12-02 12:42:46,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 12:42:46,738 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 38 treesize of output 31 [2023-12-02 12:42:46,772 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 12:42:46,772 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:42:46,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226055615] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:42:46,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 12:42:46,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [18] total 27 [2023-12-02 12:42:46,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066575945] [2023-12-02 12:42:46,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:42:46,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 12:42:46,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:42:46,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 12:42:46,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=630, Unknown=1, NotChecked=50, Total=756 [2023-12-02 12:42:46,774 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 14 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 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 12:42:47,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:42:47,385 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2023-12-02 12:42:47,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 12:42:47,385 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 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 42 [2023-12-02 12:42:47,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:42:47,386 INFO L225 Difference]: With dead ends: 85 [2023-12-02 12:42:47,386 INFO L226 Difference]: Without dead ends: 85 [2023-12-02 12:42:47,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=886, Unknown=1, NotChecked=60, Total=1056 [2023-12-02 12:42:47,386 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 79 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 12:42:47,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 334 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 531 Invalid, 0 Unknown, 88 Unchecked, 0.4s Time] [2023-12-02 12:42:47,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-02 12:42:47,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-12-02 12:42:47,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 80 states have internal predecessors, (86), 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 12:42:47,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2023-12-02 12:42:47,389 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 42 [2023-12-02 12:42:47,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:42:47,389 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2023-12-02 12:42:47,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 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 12:42:47,389 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2023-12-02 12:42:47,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 12:42:47,390 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:42:47,390 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 12:42:47,396 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-02 12:42:47,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-02 12:42:47,591 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-12-02 12:42:47,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:42:47,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1364632012, now seen corresponding path program 1 times [2023-12-02 12:42:47,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:42:47,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172420198] [2023-12-02 12:42:47,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:42:47,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:42:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:42:50,100 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 12:42:50,100 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:42:50,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172420198] [2023-12-02 12:42:50,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172420198] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:42:50,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713522251] [2023-12-02 12:42:50,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:42:50,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:42:50,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:42:50,102 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:42:50,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f2c9f7-5930-4189-abb3-41da06bd55cc/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 12:42:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:42:50,321 INFO L262 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 79 conjunts are in the unsatisfiable core [2023-12-02 12:42:50,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:42:50,681 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 39 treesize of output 1 [2023-12-02 12:42:50,689 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 39 treesize of output 1 [2023-12-02 12:42:50,763 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-12-02 12:42:50,763 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 81 treesize of output 44 [2023-12-02 12:42:50,778 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-12-02 12:42:50,778 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 31 treesize of output 25 [2023-12-02 12:42:50,786 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 12:42:50,786 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 7 [2023-12-02 12:42:50,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:42:51,003 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 12:42:51,003 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 89 treesize of output 78 [2023-12-02 12:42:51,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:42:51,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:42:51,013 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 12:42:51,013 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 80 treesize of output 66 [2023-12-02 12:42:51,031 INFO L349 Elim1Store]: treesize reduction 34, result has 44.3 percent of original size [2023-12-02 12:42:51,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2023-12-02 12:42:51,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2023-12-02 12:42:51,288 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-12-02 12:42:51,288 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 50 [2023-12-02 12:42:51,298 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-12-02 12:42:51,298 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 44 treesize of output 28 [2023-12-02 12:42:51,356 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 12:42:51,357 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:42:51,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713522251] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:42:51,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1790882158] [2023-12-02 12:42:51,792 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2023-12-02 12:42:51,792 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:42:51,793 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:42:51,793 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:42:51,793 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:42:53,852 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-12-02 12:42:53,871 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:43:15,178 WARN L293 SmtUtils]: Spent 16.22s on a formula simplification. DAG size of input: 291 DAG size of output: 278 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:44:59,455 WARN L293 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 252 DAG size of output: 246 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 12:45:36,363 WARN L293 SmtUtils]: Spent 10.08s on a formula simplification. DAG size of input: 266 DAG size of output: 259 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)