./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 04:15:42,468 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 04:15:42,590 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-19 04:15:42,605 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 04:15:42,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 04:15:42,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 04:15:42,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 04:15:42,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 04:15:42,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 04:15:42,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 04:15:42,661 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 04:15:42,662 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 04:15:42,662 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 04:15:42,664 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 04:15:42,665 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 04:15:42,665 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 04:15:42,666 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 04:15:42,666 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 04:15:42,667 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 04:15:42,667 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 04:15:42,668 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 04:15:42,669 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 04:15:42,669 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 04:15:42,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 04:15:42,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 04:15:42,671 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 04:15:42,672 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 04:15:42,672 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 04:15:42,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 04:15:42,673 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 04:15:42,675 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 04:15:42,675 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 04:15:42,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 04:15:42,676 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 04:15:42,676 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 04:15:42,676 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 04:15:42,676 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 04:15:42,677 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 04:15:42,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 04:15:42,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:15:42,678 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 04:15:42,678 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 04:15:42,678 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 04:15:42,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 04:15:42,679 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 04:15:42,679 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 04:15:42,680 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_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2023-11-19 04:15:42,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 04:15:43,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 04:15:43,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 04:15:43,026 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 04:15:43,028 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 04:15:43,029 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2023-11-19 04:15:46,230 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 04:15:46,567 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 04:15:46,575 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2023-11-19 04:15:46,590 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/data/0b7431beb/f858f7c643fe4b35b9425fdec27ed265/FLAG2bf951413 [2023-11-19 04:15:46,603 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/data/0b7431beb/f858f7c643fe4b35b9425fdec27ed265 [2023-11-19 04:15:46,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 04:15:46,607 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 04:15:46,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 04:15:46,609 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 04:15:46,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 04:15:46,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:15:46" (1/1) ... [2023-11-19 04:15:46,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3683452e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:15:46, skipping insertion in model container [2023-11-19 04:15:46,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:15:46" (1/1) ... [2023-11-19 04:15:46,667 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 04:15:46,991 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:15:47,005 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 04:15:47,080 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:15:47,119 INFO L206 MainTranslator]: Completed translation [2023-11-19 04:15:47,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:15:47 WrapperNode [2023-11-19 04:15:47,119 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 04:15:47,121 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 04:15:47,121 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 04:15:47,121 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 04:15:47,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:15:47" (1/1) ... [2023-11-19 04:15:47,165 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:15:47" (1/1) ... [2023-11-19 04:15:47,203 INFO L138 Inliner]: procedures = 127, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 111 [2023-11-19 04:15:47,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 04:15:47,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 04:15:47,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 04:15:47,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 04:15:47,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:15:47" (1/1) ... [2023-11-19 04:15:47,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:15:47" (1/1) ... [2023-11-19 04:15:47,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:15:47" (1/1) ... [2023-11-19 04:15:47,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:15:47" (1/1) ... [2023-11-19 04:15:47,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:15:47" (1/1) ... [2023-11-19 04:15:47,241 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:15:47" (1/1) ... [2023-11-19 04:15:47,242 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:15:47" (1/1) ... [2023-11-19 04:15:47,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:15:47" (1/1) ... [2023-11-19 04:15:47,253 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 04:15:47,255 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 04:15:47,256 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 04:15:47,257 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 04:15:47,258 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:15:47" (1/1) ... [2023-11-19 04:15:47,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:15:47,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:15:47,293 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 04:15:47,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 04:15:47,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 04:15:47,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 04:15:47,330 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-19 04:15:47,330 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-19 04:15:47,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 04:15:47,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 04:15:47,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 04:15:47,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 04:15:47,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 04:15:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 04:15:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 04:15:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 04:15:47,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 04:15:47,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 04:15:47,464 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 04:15:47,467 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 04:15:47,804 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 04:15:47,926 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 04:15:47,926 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-19 04:15:47,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:15:47 BoogieIcfgContainer [2023-11-19 04:15:47,933 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 04:15:47,936 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 04:15:47,936 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 04:15:47,941 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 04:15:47,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:15:46" (1/3) ... [2023-11-19 04:15:47,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb9990e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:15:47, skipping insertion in model container [2023-11-19 04:15:47,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:15:47" (2/3) ... [2023-11-19 04:15:47,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb9990e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:15:47, skipping insertion in model container [2023-11-19 04:15:47,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:15:47" (3/3) ... [2023-11-19 04:15:47,944 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2023-11-19 04:15:47,961 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 04:15:47,962 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2023-11-19 04:15:48,008 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:15:48,017 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;@23f0348, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:15:48,017 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2023-11-19 04:15:48,023 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 57 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:15:48,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-19 04:15:48,031 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:15:48,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 04:15:48,034 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-19 04:15:48,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:15:48,042 INFO L85 PathProgramCache]: Analyzing trace with hash 773697468, now seen corresponding path program 1 times [2023-11-19 04:15:48,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:15:48,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653667779] [2023-11-19 04:15:48,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:15:48,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:15:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:15:48,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:15:48,427 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:15:48,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653667779] [2023-11-19 04:15:48,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653667779] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:15:48,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:15:48,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:15:48,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516822908] [2023-11-19 04:15:48,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:15:48,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:15:48,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:15:48,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:15:48,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:15:48,495 INFO L87 Difference]: Start difference. First operand has 61 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 57 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:15:48,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:15:48,555 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2023-11-19 04:15:48,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:15:48,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-19 04:15:48,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:15:48,566 INFO L225 Difference]: With dead ends: 66 [2023-11-19 04:15:48,566 INFO L226 Difference]: Without dead ends: 64 [2023-11-19 04:15:48,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:15:48,571 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:15:48,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 102 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:15:48,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-19 04:15:48,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2023-11-19 04:15:48,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:15:48,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2023-11-19 04:15:48,611 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 6 [2023-11-19 04:15:48,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:15:48,612 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2023-11-19 04:15:48,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:15:48,612 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2023-11-19 04:15:48,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-19 04:15:48,613 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:15:48,613 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 04:15:48,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 04:15:48,614 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-19 04:15:48,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:15:48,614 INFO L85 PathProgramCache]: Analyzing trace with hash 642497904, now seen corresponding path program 1 times [2023-11-19 04:15:48,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:15:48,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077553922] [2023-11-19 04:15:48,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:15:48,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:15:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:15:48,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:15:48,690 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:15:48,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077553922] [2023-11-19 04:15:48,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077553922] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:15:48,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:15:48,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:15:48,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641457327] [2023-11-19 04:15:48,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:15:48,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:15:48,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:15:48,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:15:48,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:15:48,694 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:15:48,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:15:48,768 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2023-11-19 04:15:48,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:15:48,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-19 04:15:48,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:15:48,771 INFO L225 Difference]: With dead ends: 57 [2023-11-19 04:15:48,771 INFO L226 Difference]: Without dead ends: 57 [2023-11-19 04:15:48,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:15:48,773 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:15:48,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 71 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:15:48,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-19 04:15:48,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-19 04:15:48,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:15:48,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2023-11-19 04:15:48,783 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 6 [2023-11-19 04:15:48,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:15:48,783 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2023-11-19 04:15:48,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:15:48,784 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2023-11-19 04:15:48,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-19 04:15:48,784 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:15:48,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 04:15:48,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 04:15:48,785 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-19 04:15:48,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:15:48,786 INFO L85 PathProgramCache]: Analyzing trace with hash 642497905, now seen corresponding path program 1 times [2023-11-19 04:15:48,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:15:48,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088367773] [2023-11-19 04:15:48,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:15:48,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:15:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:15:48,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:15:48,940 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:15:48,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088367773] [2023-11-19 04:15:48,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088367773] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:15:48,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:15:48,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:15:48,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670971569] [2023-11-19 04:15:48,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:15:48,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:15:48,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:15:48,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:15:48,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:15:48,944 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:15:49,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:15:49,028 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2023-11-19 04:15:49,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:15:49,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-19 04:15:49,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:15:49,033 INFO L225 Difference]: With dead ends: 55 [2023-11-19 04:15:49,034 INFO L226 Difference]: Without dead ends: 55 [2023-11-19 04:15:49,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:15:49,039 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:15:49,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 74 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:15:49,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-19 04:15:49,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-19 04:15:49,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 29 states have (on average 1.896551724137931) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:15:49,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2023-11-19 04:15:49,047 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 6 [2023-11-19 04:15:49,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:15:49,048 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2023-11-19 04:15:49,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:15:49,048 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2023-11-19 04:15:49,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 04:15:49,049 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:15:49,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:15:49,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 04:15:49,050 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-19 04:15:49,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:15:49,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1988208076, now seen corresponding path program 1 times [2023-11-19 04:15:49,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:15:49,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345122847] [2023-11-19 04:15:49,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:15:49,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:15:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:15:49,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:15:49,241 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:15:49,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345122847] [2023-11-19 04:15:49,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345122847] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:15:49,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:15:49,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:15:49,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921621981] [2023-11-19 04:15:49,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:15:49,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:15:49,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:15:49,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:15:49,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:15:49,245 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 04:15:49,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:15:49,420 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2023-11-19 04:15:49,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:15:49,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2023-11-19 04:15:49,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:15:49,427 INFO L225 Difference]: With dead ends: 55 [2023-11-19 04:15:49,427 INFO L226 Difference]: Without dead ends: 55 [2023-11-19 04:15:49,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:15:49,439 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 5 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:15:49,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 147 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:15:49,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-19 04:15:49,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2023-11-19 04:15:49,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 50 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:15:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2023-11-19 04:15:49,447 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 10 [2023-11-19 04:15:49,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:15:49,447 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2023-11-19 04:15:49,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 04:15:49,448 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2023-11-19 04:15:49,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 04:15:49,448 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:15:49,449 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:15:49,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 04:15:49,449 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-19 04:15:49,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:15:49,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1988208077, now seen corresponding path program 1 times [2023-11-19 04:15:49,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:15:49,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176992595] [2023-11-19 04:15:49,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:15:49,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:15:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:15:49,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:15:49,716 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:15:49,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176992595] [2023-11-19 04:15:49,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176992595] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:15:49,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:15:49,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:15:49,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659482595] [2023-11-19 04:15:49,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:15:49,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:15:49,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:15:49,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:15:49,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:15:49,720 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 04:15:49,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:15:49,858 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2023-11-19 04:15:49,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:15:49,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2023-11-19 04:15:49,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:15:49,862 INFO L225 Difference]: With dead ends: 54 [2023-11-19 04:15:49,862 INFO L226 Difference]: Without dead ends: 54 [2023-11-19 04:15:49,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:15:49,865 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 3 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:15:49,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 159 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:15:49,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-19 04:15:49,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2023-11-19 04:15:49,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:15:49,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2023-11-19 04:15:49,876 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 10 [2023-11-19 04:15:49,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:15:49,876 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2023-11-19 04:15:49,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 04:15:49,877 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2023-11-19 04:15:49,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 04:15:49,878 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:15:49,878 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:15:49,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 04:15:49,879 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-19 04:15:49,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:15:49,879 INFO L85 PathProgramCache]: Analyzing trace with hash -760723014, now seen corresponding path program 1 times [2023-11-19 04:15:49,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:15:49,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768508742] [2023-11-19 04:15:49,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:15:49,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:15:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:15:50,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 04:15:50,043 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:15:50,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768508742] [2023-11-19 04:15:50,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768508742] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:15:50,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345836883] [2023-11-19 04:15:50,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:15:50,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:15:50,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:15:50,047 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:15:50,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 04:15:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:15:50,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 04:15:50,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:15:50,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:15:50,275 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:15:50,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 04:15:50,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345836883] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:15:50,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2095571901] [2023-11-19 04:15:50,352 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-19 04:15:50,353 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:15:50,358 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:15:50,364 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:15:50,365 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:15:53,040 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 144 for LOIs [2023-11-19 04:15:53,723 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:16:02,958 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '767#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_prepend_~data#1| 1) (not (= (select |#valid| |ULTIMATE.start_sll_prepend_~head#1.base|) 1)) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_prepend_#in~data#1| 1) (or (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_72| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (store |v_#memory_$Pointer$.base_72| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_72| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|) 4)))))) (exists ((|v_#memory_int_54| (Array Int (Array Int Int))) (|v_#memory_int_55| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_55| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_55| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0 1))) (= |v_#memory_int_55| (store |v_#memory_int_54| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_54| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_55| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4)))))) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (= 1 (select |v_old(#valid)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|))) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_prepend_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.base_68| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_68| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_68| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))))) (exists ((|v_#length_BEFORE_CALL_17| (Array Int Int))) (<= 8 (select |v_#length_BEFORE_CALL_17| |ULTIMATE.start_sll_create_#res#1.base|))) (= |ULTIMATE.start_sll_prepend_~head#1.base| |ULTIMATE.start_sll_prepend_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_68| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_68| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))))) (not (= |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 0)) (exists ((|v_#valid_80| (Array Int Int))) (and (= (store |v_#valid_80| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_80| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_72| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#length_65| (Array Int Int))) (= (store |v_#length_65| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 8) |#length|)) (<= (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_58| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_10| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_10| (store |v_#memory_int_58| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_58| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|) 4)))))) (and (exists ((|v_#memory_int_54| (Array Int (Array Int Int))) (|v_#memory_int_55| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_55| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_55| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0 1))) (= |v_#memory_int_55| (store |v_#memory_int_54| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_54| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_55| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4)))))) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_prepend_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.base_68| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_68| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_68| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))))) (= |ULTIMATE.start_sll_prepend_~head#1.base| |ULTIMATE.start_sll_prepend_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_68| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_68| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))))) (not (= |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 0)) (exists ((|v_old(#length)_AFTER_CALL_9| (Array Int Int))) (<= 8 (select |v_old(#length)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 1)) (exists ((|v_#valid_80| (Array Int Int))) (and (= (store |v_#valid_80| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_80| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_72| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#length_65| (Array Int Int))) (= (store |v_#length_65| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 8) |#length|)) (exists ((|v_#memory_int_58| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= (store |v_#memory_int_58| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_58| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 4))) |v_old(#memory_int)_AFTER_CALL_9|)) (<= (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_72| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|) (= (store |v_#memory_$Pointer$.base_72| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_72| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_9|))))) (= |ULTIMATE.start_sll_prepend_#in~head#1.offset| 0) (= |ULTIMATE.start_sll_prepend_~head#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-19 04:16:02,958 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:16:02,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:16:02,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-19 04:16:02,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888849469] [2023-11-19 04:16:02,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:16:02,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:16:02,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:16:02,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:16:02,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=234, Unknown=1, NotChecked=0, Total=272 [2023-11-19 04:16:02,962 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 04:16:03,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:16:03,033 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2023-11-19 04:16:03,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:16:03,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2023-11-19 04:16:03,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:16:03,035 INFO L225 Difference]: With dead ends: 57 [2023-11-19 04:16:03,035 INFO L226 Difference]: Without dead ends: 57 [2023-11-19 04:16:03,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=37, Invalid=234, Unknown=1, NotChecked=0, Total=272 [2023-11-19 04:16:03,037 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:16:03,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 86 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:16:03,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-19 04:16:03,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-19 04:16:03,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.75) internal successors, (56), 52 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:16:03,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2023-11-19 04:16:03,045 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 19 [2023-11-19 04:16:03,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:16:03,045 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2023-11-19 04:16:03,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 04:16:03,046 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2023-11-19 04:16:03,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-19 04:16:03,047 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:16:03,047 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-19 04:16:03,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 04:16:03,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:16:03,264 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-19 04:16:03,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:16:03,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1718077274, now seen corresponding path program 2 times [2023-11-19 04:16:03,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:16:03,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225354863] [2023-11-19 04:16:03,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:03,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:16:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:04,064 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-19 04:16:04,065 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:16:04,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225354863] [2023-11-19 04:16:04,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225354863] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:16:04,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310787518] [2023-11-19 04:16:04,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 04:16:04,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:16:04,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:16:04,067 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:16:04,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 04:16:04,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-19 04:16:04,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 04:16:04,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-19 04:16:04,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:16:04,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 04:16:04,329 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-11-19 04:16:04,347 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2023-11-19 04:16:04,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:04,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-19 04:16:04,418 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-11-19 04:16:04,477 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 04:16:04,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-19 04:16:04,611 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-11-19 04:16:04,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:04,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-19 04:16:04,669 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 8 not checked. [2023-11-19 04:16:04,670 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:16:04,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310787518] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:16:04,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [880497841] [2023-11-19 04:16:04,764 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-19 04:16:04,764 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:16:04,764 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:16:04,765 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:16:04,765 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:16:06,268 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 144 for LOIs [2023-11-19 04:16:06,862 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:16:16,453 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1000#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_prepend_~data#1| 1) (or (and (exists ((|v_#memory_int_70| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_20| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_20| (store |v_#memory_int_70| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_70| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_20| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (exists ((|v_#memory_$Pointer$.base_80| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_80| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_80| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))))) (exists ((|v_#memory_int_66| (Array Int (Array Int Int))) (|v_#memory_int_67| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_67| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_67| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0 1))) (= |v_#memory_int_67| (store |v_#memory_int_66| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_66| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_67| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4)))))) (exists ((|v_#valid_93| (Array Int Int))) (and (= (select |v_#valid_93| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0) (= (store |v_#valid_93| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#valid|))) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_prepend_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_80| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_80| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_80| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))))) (= |ULTIMATE.start_sll_prepend_~head#1.base| |ULTIMATE.start_sll_prepend_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_84| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_84| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_84| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (not (= |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 0)) (exists ((|v_old(#length)_AFTER_CALL_20| (Array Int Int))) (<= 8 (select |v_old(#length)_AFTER_CALL_20| |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_20| |ULTIMATE.start_sll_create_#res#1.base|) 1)) (exists ((|v_#length_72| (Array Int Int))) (= |#length| (store |v_#length_72| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 8))) (<= (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_84| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (store |v_#memory_$Pointer$.base_84| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_84| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)))) (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_21| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_84| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| (store |v_#memory_$Pointer$.base_84| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_84| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_21| |ULTIMATE.start_sll_create_#res#1.base|) 1)) (exists ((|v_#memory_$Pointer$.base_80| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_80| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_80| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))))) (exists ((|v_#memory_int_66| (Array Int (Array Int Int))) (|v_#memory_int_67| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_67| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_67| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0 1))) (= |v_#memory_int_67| (store |v_#memory_int_66| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_66| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_67| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4)))))) (exists ((|v_#valid_93| (Array Int Int))) (and (= (select |v_#valid_93| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0) (= (store |v_#valid_93| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#valid|))) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_prepend_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_80| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_80| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_80| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))))) (= |ULTIMATE.start_sll_prepend_~head#1.base| |ULTIMATE.start_sll_prepend_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_84| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_84| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_84| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (not (= |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 0)) (exists ((|v_#memory_int_70| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_21| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_21| (store |v_#memory_int_70| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_70| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_21| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (exists ((|v_#length_72| (Array Int Int))) (= |#length| (store |v_#length_72| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 8))) (<= (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_BEFORE_CALL_35| (Array Int Int))) (<= 8 (select |v_#length_BEFORE_CALL_35| |ULTIMATE.start_sll_create_#res#1.base|))))) (not (= (select |#valid| |ULTIMATE.start_sll_prepend_~head#1.base|) 1)) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_prepend_#in~data#1| 1) (= |ULTIMATE.start_sll_prepend_#in~head#1.offset| 0) (= |ULTIMATE.start_sll_prepend_~head#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-19 04:16:16,453 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:16:16,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 04:16:16,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2023-11-19 04:16:16,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933280780] [2023-11-19 04:16:16,454 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 04:16:16,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-19 04:16:16,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:16:16,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-19 04:16:16,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=666, Unknown=2, NotChecked=52, Total=812 [2023-11-19 04:16:16,456 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 16 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-19 04:16:17,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:16:17,083 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2023-11-19 04:16:17,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 04:16:17,084 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2023-11-19 04:16:17,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:16:17,085 INFO L225 Difference]: With dead ends: 63 [2023-11-19 04:16:17,085 INFO L226 Difference]: Without dead ends: 63 [2023-11-19 04:16:17,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=121, Invalid=811, Unknown=2, NotChecked=58, Total=992 [2023-11-19 04:16:17,087 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 48 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 04:16:17,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 161 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 290 Invalid, 0 Unknown, 59 Unchecked, 0.4s Time] [2023-11-19 04:16:17,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-19 04:16:17,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2023-11-19 04:16:17,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.625) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:16:17,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2023-11-19 04:16:17,098 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 28 [2023-11-19 04:16:17,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:16:17,100 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2023-11-19 04:16:17,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-19 04:16:17,101 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2023-11-19 04:16:17,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-19 04:16:17,102 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:16:17,102 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-19 04:16:17,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 04:16:17,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:16:17,311 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-19 04:16:17,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:16:17,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1718077275, now seen corresponding path program 1 times [2023-11-19 04:16:17,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:16:17,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092037249] [2023-11-19 04:16:17,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:17,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:16:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:18,523 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 04:16:18,523 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:16:18,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092037249] [2023-11-19 04:16:18,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092037249] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:16:18,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723688966] [2023-11-19 04:16:18,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:18,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:16:18,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:16:18,527 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:16:18,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 04:16:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:18,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-19 04:16:18,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:16:18,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-19 04:16:18,774 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-11-19 04:16:18,789 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-11-19 04:16:18,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:18,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-19 04:16:18,869 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-11-19 04:16:18,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:18,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-19 04:16:18,999 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-11-19 04:16:19,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:19,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-19 04:16:19,099 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-19 04:16:19,099 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:16:19,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723688966] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:16:19,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 04:16:19,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2023-11-19 04:16:19,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954671285] [2023-11-19 04:16:19,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:16:19,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:16:19,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:16:19,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:16:19,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=222, Unknown=1, NotChecked=30, Total=306 [2023-11-19 04:16:19,102 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:16:19,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:16:19,280 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2023-11-19 04:16:19,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 04:16:19,281 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2023-11-19 04:16:19,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:16:19,282 INFO L225 Difference]: With dead ends: 51 [2023-11-19 04:16:19,283 INFO L226 Difference]: Without dead ends: 51 [2023-11-19 04:16:19,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=251, Unknown=1, NotChecked=32, Total=342 [2023-11-19 04:16:19,284 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:16:19,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 116 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 68 Unchecked, 0.1s Time] [2023-11-19 04:16:19,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-19 04:16:19,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-11-19 04:16:19,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.5625) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:16:19,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2023-11-19 04:16:19,291 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 28 [2023-11-19 04:16:19,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:16:19,292 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2023-11-19 04:16:19,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:16:19,293 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2023-11-19 04:16:19,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-19 04:16:19,294 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:16:19,294 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:16:19,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 04:16:19,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:16:19,499 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-19 04:16:19,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:16:19,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1720787943, now seen corresponding path program 1 times [2023-11-19 04:16:19,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:16:19,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135066528] [2023-11-19 04:16:19,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:19,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:16:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:19,830 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-19 04:16:19,830 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:16:19,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135066528] [2023-11-19 04:16:19,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135066528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:16:19,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:16:19,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:16:19,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133832788] [2023-11-19 04:16:19,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:16:19,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:16:19,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:16:19,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:16:19,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:16:19,835 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-11-19 04:16:20,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:16:20,022 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2023-11-19 04:16:20,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:16:20,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 29 [2023-11-19 04:16:20,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:16:20,024 INFO L225 Difference]: With dead ends: 50 [2023-11-19 04:16:20,024 INFO L226 Difference]: Without dead ends: 50 [2023-11-19 04:16:20,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:16:20,025 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:16:20,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 124 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:16:20,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-19 04:16:20,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-11-19 04:16:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.53125) internal successors, (49), 45 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:16:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2023-11-19 04:16:20,032 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 29 [2023-11-19 04:16:20,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:16:20,032 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2023-11-19 04:16:20,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-11-19 04:16:20,033 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2023-11-19 04:16:20,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-19 04:16:20,035 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:16:20,035 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:16:20,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 04:16:20,036 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-19 04:16:20,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:16:20,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1720787942, now seen corresponding path program 1 times [2023-11-19 04:16:20,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:16:20,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789770] [2023-11-19 04:16:20,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:20,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:16:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:20,215 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-19 04:16:20,215 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:16:20,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789770] [2023-11-19 04:16:20,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789770] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:16:20,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:16:20,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:16:20,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759793526] [2023-11-19 04:16:20,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:16:20,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:16:20,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:16:20,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:16:20,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:16:20,219 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-11-19 04:16:20,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:16:20,377 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2023-11-19 04:16:20,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:16:20,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 29 [2023-11-19 04:16:20,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:16:20,379 INFO L225 Difference]: With dead ends: 49 [2023-11-19 04:16:20,379 INFO L226 Difference]: Without dead ends: 49 [2023-11-19 04:16:20,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:16:20,380 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:16:20,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 120 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:16:20,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-19 04:16:20,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-19 04:16:20,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.5) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:16:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2023-11-19 04:16:20,386 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 29 [2023-11-19 04:16:20,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:16:20,386 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2023-11-19 04:16:20,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-11-19 04:16:20,387 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2023-11-19 04:16:20,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-19 04:16:20,396 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:16:20,396 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:16:20,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 04:16:20,397 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-19 04:16:20,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:16:20,398 INFO L85 PathProgramCache]: Analyzing trace with hash 114916214, now seen corresponding path program 1 times [2023-11-19 04:16:20,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:16:20,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746364709] [2023-11-19 04:16:20,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:20,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:16:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:20,702 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-19 04:16:20,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:16:20,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746364709] [2023-11-19 04:16:20,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746364709] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:16:20,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:16:20,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 04:16:20,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695764051] [2023-11-19 04:16:20,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:16:20,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:16:20,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:16:20,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:16:20,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:16:20,705 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 7 states, 5 states have (on average 2.8) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:16:20,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:16:20,833 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2023-11-19 04:16:20,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:16:20,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2023-11-19 04:16:20,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:16:20,835 INFO L225 Difference]: With dead ends: 47 [2023-11-19 04:16:20,836 INFO L226 Difference]: Without dead ends: 47 [2023-11-19 04:16:20,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-11-19 04:16:20,837 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 58 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:16:20,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 102 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:16:20,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-19 04:16:20,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-11-19 04:16:20,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.4375) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:16:20,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2023-11-19 04:16:20,842 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 31 [2023-11-19 04:16:20,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:16:20,842 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2023-11-19 04:16:20,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 04:16:20,843 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2023-11-19 04:16:20,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-19 04:16:20,844 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:16:20,844 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:16:20,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 04:16:20,845 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-19 04:16:20,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:16:20,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1234566464, now seen corresponding path program 1 times [2023-11-19 04:16:20,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:16:20,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961460350] [2023-11-19 04:16:20,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:20,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:16:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:21,187 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-19 04:16:21,187 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:16:21,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961460350] [2023-11-19 04:16:21,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961460350] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:16:21,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:16:21,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 04:16:21,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936275433] [2023-11-19 04:16:21,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:16:21,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 04:16:21,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:16:21,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 04:16:21,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:16:21,190 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 9 states, 6 states have (on average 3.0) internal successors, (18), 8 states have internal predecessors, (18), 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-11-19 04:16:21,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:16:21,393 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2023-11-19 04:16:21,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 04:16:21,394 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.0) internal successors, (18), 8 states have internal predecessors, (18), 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 33 [2023-11-19 04:16:21,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:16:21,395 INFO L225 Difference]: With dead ends: 75 [2023-11-19 04:16:21,395 INFO L226 Difference]: Without dead ends: 75 [2023-11-19 04:16:21,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-19 04:16:21,396 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 67 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:16:21,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 100 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:16:21,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-19 04:16:21,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 48. [2023-11-19 04:16:21,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 43 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:16:21,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2023-11-19 04:16:21,401 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 33 [2023-11-19 04:16:21,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:16:21,401 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2023-11-19 04:16:21,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.0) internal successors, (18), 8 states have internal predecessors, (18), 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-11-19 04:16:21,402 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2023-11-19 04:16:21,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-19 04:16:21,402 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:16:21,402 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:16:21,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 04:16:21,403 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-19 04:16:21,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:16:21,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1234566463, now seen corresponding path program 1 times [2023-11-19 04:16:21,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:16:21,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437100109] [2023-11-19 04:16:21,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:21,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:16:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-19 04:16:21,945 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:16:21,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437100109] [2023-11-19 04:16:21,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437100109] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:16:21,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:16:21,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 04:16:21,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208964197] [2023-11-19 04:16:21,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:16:21,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 04:16:21,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:16:21,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 04:16:21,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:16:21,947 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 8 states have internal predecessors, (20), 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-11-19 04:16:22,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:16:22,157 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2023-11-19 04:16:22,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 04:16:22,158 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 8 states have internal predecessors, (20), 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 33 [2023-11-19 04:16:22,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:16:22,159 INFO L225 Difference]: With dead ends: 68 [2023-11-19 04:16:22,160 INFO L226 Difference]: Without dead ends: 68 [2023-11-19 04:16:22,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-19 04:16:22,161 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 71 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 113 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.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:16:22,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 113 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:16:22,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-19 04:16:22,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 49. [2023-11-19 04:16:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.4) internal successors, (49), 44 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:16:22,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2023-11-19 04:16:22,165 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 33 [2023-11-19 04:16:22,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:16:22,166 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2023-11-19 04:16:22,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 8 states have internal predecessors, (20), 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-11-19 04:16:22,166 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2023-11-19 04:16:22,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-19 04:16:22,169 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:16:22,169 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:16:22,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 04:16:22,169 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-19 04:16:22,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:16:22,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1072568680, now seen corresponding path program 1 times [2023-11-19 04:16:22,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:16:22,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030497162] [2023-11-19 04:16:22,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:22,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:16:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:22,514 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-19 04:16:22,514 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:16:22,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030497162] [2023-11-19 04:16:22,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030497162] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:16:22,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:16:22,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 04:16:22,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436028344] [2023-11-19 04:16:22,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:16:22,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 04:16:22,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:16:22,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 04:16:22,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:16:22,517 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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-11-19 04:16:22,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:16:22,697 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2023-11-19 04:16:22,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 04:16:22,698 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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 36 [2023-11-19 04:16:22,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:16:22,699 INFO L225 Difference]: With dead ends: 54 [2023-11-19 04:16:22,699 INFO L226 Difference]: Without dead ends: 54 [2023-11-19 04:16:22,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-19 04:16:22,700 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 42 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:16:22,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 162 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:16:22,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-19 04:16:22,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2023-11-19 04:16:22,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:16:22,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2023-11-19 04:16:22,706 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 36 [2023-11-19 04:16:22,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:16:22,708 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2023-11-19 04:16:22,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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-11-19 04:16:22,709 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2023-11-19 04:16:22,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-19 04:16:22,712 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:16:22,713 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:16:22,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 04:16:22,713 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-19 04:16:22,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:16:22,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1657188925, now seen corresponding path program 1 times [2023-11-19 04:16:22,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:16:22,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654885842] [2023-11-19 04:16:22,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:22,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:16:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:24,433 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 04:16:24,434 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:16:24,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654885842] [2023-11-19 04:16:24,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654885842] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:16:24,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978217753] [2023-11-19 04:16:24,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:16:24,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:16:24,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:16:24,436 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:16:24,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a0eb6ff-fe0b-45cb-9ab8-d54a160740d2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 04:16:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:16:24,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-19 04:16:24,653 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:16:24,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 04:16:25,054 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-11-19 04:16:25,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:25,271 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-11-19 04:16:25,292 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-19 04:16:25,292 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 18 treesize of output 21 [2023-11-19 04:16:25,644 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 04:16:25,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:25,648 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-11-19 04:16:25,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:16:25,778 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 04:16:25,779 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 04:16:25,782 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2023-11-19 04:16:25,790 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 15 treesize of output 1 [2023-11-19 04:16:25,922 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 04:16:25,923 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-11-19 04:16:26,110 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 04:16:26,133 INFO L349 Elim1Store]: treesize reduction 61, result has 10.3 percent of original size [2023-11-19 04:16:26,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2023-11-19 04:16:26,192 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 04:16:26,192 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:16:26,331 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 84 treesize of output 80 [2023-11-19 04:16:28,359 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|)))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and (or (not .cse0) (not .cse1)) (forall ((v_arrayElimCell_24 Int)) (= 1 (select |c_#valid| (select .cse2 (+ 4 v_arrayElimCell_24)))))) (and .cse0 (= (select |c_#valid| (select .cse2 (+ 4 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))) 1) .cse1))) is different from false [2023-11-19 04:16:29,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978217753] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:16:29,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1224086480] [2023-11-19 04:16:29,997 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-11-19 04:16:29,997 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:16:29,998 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:16:29,998 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:16:29,998 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:16:32,318 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 144 for LOIs [2023-11-19 04:16:32,867 INFO L180 IcfgInterpreter]: Interpretation finished