./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6c679b4-56b6-4220-997e-cd8505447784/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6c679b4-56b6-4220-997e-cd8505447784/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6c679b4-56b6-4220-997e-cd8505447784/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6c679b4-56b6-4220-997e-cd8505447784/bin/utaipan-eEHZpOm5b7/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6c679b4-56b6-4220-997e-cd8505447784/bin/utaipan-eEHZpOm5b7/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6c679b4-56b6-4220-997e-cd8505447784/bin/utaipan-eEHZpOm5b7 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 18:03:42,867 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 18:03:42,870 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 18:03:42,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 18:03:42,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 18:03:42,942 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 18:03:42,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 18:03:42,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 18:03:42,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 18:03:42,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 18:03:42,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 18:03:42,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 18:03:42,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 18:03:42,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 18:03:42,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 18:03:42,974 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 18:03:42,976 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 18:03:42,977 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 18:03:42,979 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 18:03:42,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 18:03:42,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 18:03:42,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 18:03:42,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 18:03:42,995 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 18:03:42,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 18:03:43,000 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 18:03:43,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 18:03:43,002 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 18:03:43,003 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 18:03:43,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 18:03:43,005 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 18:03:43,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 18:03:43,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 18:03:43,010 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 18:03:43,011 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 18:03:43,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 18:03:43,012 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 18:03:43,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 18:03:43,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 18:03:43,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 18:03:43,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 18:03:43,016 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6c679b4-56b6-4220-997e-cd8505447784/bin/utaipan-eEHZpOm5b7/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-11-25 18:03:43,068 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 18:03:43,069 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 18:03:43,069 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 18:03:43,070 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 18:03:43,071 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 18:03:43,071 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 18:03:43,071 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 18:03:43,071 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 18:03:43,072 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 18:03:43,072 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 18:03:43,073 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 18:03:43,073 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 18:03:43,074 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 18:03:43,074 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 18:03:43,074 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 18:03:43,074 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 18:03:43,075 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 18:03:43,075 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 18:03:43,076 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-25 18:03:43,076 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-25 18:03:43,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 18:03:43,076 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 18:03:43,077 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-25 18:03:43,079 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 18:03:43,079 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 18:03:43,079 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 18:03:43,080 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-25 18:03:43,080 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-25 18:03:43,080 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 18:03:43,080 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-25 18:03:43,081 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 18:03:43,081 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 18:03:43,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 18:03:43,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 18:03:43,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:03:43,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 18:03:43,082 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 18:03:43,083 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 18:03:43,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 18:03:43,083 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 18:03:43,083 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 18:03:43,084 INFO L138 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_c6c679b4-56b6-4220-997e-cd8505447784/bin/utaipan-eEHZpOm5b7/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_c6c679b4-56b6-4220-997e-cd8505447784/bin/utaipan-eEHZpOm5b7 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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-memcleanup) ) 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 -> 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf [2021-11-25 18:03:43,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 18:03:43,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 18:03:43,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 18:03:43,396 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 18:03:43,397 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 18:03:43,398 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6c679b4-56b6-4220-997e-cd8505447784/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2021-11-25 18:03:43,477 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6c679b4-56b6-4220-997e-cd8505447784/bin/utaipan-eEHZpOm5b7/data/198e608d1/67e1061b557047b4810f975520842c7e/FLAG1b059ebed [2021-11-25 18:03:43,957 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 18:03:43,957 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6c679b4-56b6-4220-997e-cd8505447784/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2021-11-25 18:03:43,987 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6c679b4-56b6-4220-997e-cd8505447784/bin/utaipan-eEHZpOm5b7/data/198e608d1/67e1061b557047b4810f975520842c7e/FLAG1b059ebed [2021-11-25 18:03:44,272 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6c679b4-56b6-4220-997e-cd8505447784/bin/utaipan-eEHZpOm5b7/data/198e608d1/67e1061b557047b4810f975520842c7e [2021-11-25 18:03:44,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 18:03:44,276 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 18:03:44,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 18:03:44,278 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 18:03:44,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 18:03:44,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:03:44" (1/1) ... [2021-11-25 18:03:44,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c8e202f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:44, skipping insertion in model container [2021-11-25 18:03:44,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:03:44" (1/1) ... [2021-11-25 18:03:44,290 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 18:03:44,355 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 18:03:44,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6c679b4-56b6-4220-997e-cd8505447784/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2021-11-25 18:03:44,750 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:03:44,762 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 18:03:44,819 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6c679b4-56b6-4220-997e-cd8505447784/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2021-11-25 18:03:44,841 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:03:44,880 INFO L208 MainTranslator]: Completed translation [2021-11-25 18:03:44,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:44 WrapperNode [2021-11-25 18:03:44,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 18:03:44,883 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 18:03:44,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 18:03:44,883 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 18:03:44,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:44" (1/1) ... [2021-11-25 18:03:44,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:44" (1/1) ... [2021-11-25 18:03:44,961 INFO L137 Inliner]: procedures = 125, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 294 [2021-11-25 18:03:44,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 18:03:44,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 18:03:44,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 18:03:44,962 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 18:03:44,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:44" (1/1) ... [2021-11-25 18:03:44,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:44" (1/1) ... [2021-11-25 18:03:44,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:44" (1/1) ... [2021-11-25 18:03:44,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:44" (1/1) ... [2021-11-25 18:03:44,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:44" (1/1) ... [2021-11-25 18:03:45,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:44" (1/1) ... [2021-11-25 18:03:45,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:44" (1/1) ... [2021-11-25 18:03:45,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 18:03:45,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 18:03:45,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 18:03:45,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 18:03:45,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:44" (1/1) ... [2021-11-25 18:03:45,044 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:03:45,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6c679b4-56b6-4220-997e-cd8505447784/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:03:45,063 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6c679b4-56b6-4220-997e-cd8505447784/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 18:03:45,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6c679b4-56b6-4220-997e-cd8505447784/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 18:03:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-25 18:03:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2021-11-25 18:03:45,100 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2021-11-25 18:03:45,101 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2021-11-25 18:03:45,101 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2021-11-25 18:03:45,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-25 18:03:45,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-25 18:03:45,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 18:03:45,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 18:03:45,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-25 18:03:45,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-25 18:03:45,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 18:03:45,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 18:03:45,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 18:03:45,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 18:03:45,214 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 18:03:45,215 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 18:03:45,868 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 18:03:45,953 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 18:03:45,953 INFO L301 CfgBuilder]: Removed 33 assume(true) statements. [2021-11-25 18:03:45,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:03:45 BoogieIcfgContainer [2021-11-25 18:03:45,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 18:03:45,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 18:03:45,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 18:03:45,962 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 18:03:45,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:03:44" (1/3) ... [2021-11-25 18:03:45,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e56f6ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:03:45, skipping insertion in model container [2021-11-25 18:03:45,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:44" (2/3) ... [2021-11-25 18:03:45,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e56f6ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:03:45, skipping insertion in model container [2021-11-25 18:03:45,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:03:45" (3/3) ... [2021-11-25 18:03:45,965 INFO L111 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2021-11-25 18:03:45,970 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 18:03:45,971 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 105 error locations. [2021-11-25 18:03:46,025 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 18:03:46,030 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 18:03:46,030 INFO L340 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2021-11-25 18:03:46,050 INFO L276 IsEmpty]: Start isEmpty. Operand has 230 states, 107 states have (on average 2.514018691588785) internal successors, (269), 227 states have internal predecessors, (269), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2021-11-25 18:03:46,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-25 18:03:46,057 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:46,058 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-25 18:03:46,058 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-11-25 18:03:46,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:46,064 INFO L85 PathProgramCache]: Analyzing trace with hash 18345167, now seen corresponding path program 1 times [2021-11-25 18:03:46,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:46,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166514977] [2021-11-25 18:03:46,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:46,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:46,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:03:46,251 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:46,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166514977] [2021-11-25 18:03:46,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166514977] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:03:46,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:03:46,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:03:46,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276549297] [2021-11-25 18:03:46,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:03:46,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:03:46,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:46,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:03:46,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:03:46,307 INFO L87 Difference]: Start difference. First operand has 230 states, 107 states have (on average 2.514018691588785) internal successors, (269), 227 states have internal predecessors, (269), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:46,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:46,799 INFO L93 Difference]: Finished difference Result 396 states and 447 transitions. [2021-11-25 18:03:46,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:03:46,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-11-25 18:03:46,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:46,834 INFO L225 Difference]: With dead ends: 396 [2021-11-25 18:03:46,835 INFO L226 Difference]: Without dead ends: 394 [2021-11-25 18:03:46,841 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:03:46,844 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 181 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:46,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 479 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 18:03:46,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-11-25 18:03:46,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 226. [2021-11-25 18:03:46,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 107 states have (on average 2.1869158878504673) internal successors, (234), 223 states have internal predecessors, (234), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 18:03:46,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 251 transitions. [2021-11-25 18:03:46,901 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 251 transitions. Word has length 4 [2021-11-25 18:03:46,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:46,901 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 251 transitions. [2021-11-25 18:03:46,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:46,902 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 251 transitions. [2021-11-25 18:03:46,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-25 18:03:46,902 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:46,902 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-25 18:03:46,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 18:03:46,903 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-11-25 18:03:46,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:46,904 INFO L85 PathProgramCache]: Analyzing trace with hash 18345168, now seen corresponding path program 1 times [2021-11-25 18:03:46,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:46,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925092230] [2021-11-25 18:03:46,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:46,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:03:46,952 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:46,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925092230] [2021-11-25 18:03:46,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925092230] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:03:46,952 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:03:46,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:03:46,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465644704] [2021-11-25 18:03:46,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:03:46,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:03:46,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:46,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:03:46,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:03:46,955 INFO L87 Difference]: Start difference. First operand 226 states and 251 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:47,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:47,202 INFO L93 Difference]: Finished difference Result 360 states and 405 transitions. [2021-11-25 18:03:47,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:03:47,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-11-25 18:03:47,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:47,205 INFO L225 Difference]: With dead ends: 360 [2021-11-25 18:03:47,206 INFO L226 Difference]: Without dead ends: 360 [2021-11-25 18:03:47,206 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:03:47,208 INFO L933 BasicCegarLoop]: 322 mSDtfsCounter, 148 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:47,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 471 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:03:47,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-11-25 18:03:47,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 224. [2021-11-25 18:03:47,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 107 states have (on average 2.1682242990654204) internal successors, (232), 221 states have internal predecessors, (232), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 18:03:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 249 transitions. [2021-11-25 18:03:47,226 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 249 transitions. Word has length 4 [2021-11-25 18:03:47,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:47,226 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 249 transitions. [2021-11-25 18:03:47,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:47,227 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 249 transitions. [2021-11-25 18:03:47,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-25 18:03:47,227 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:47,227 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-25 18:03:47,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-25 18:03:47,228 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-11-25 18:03:47,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:47,228 INFO L85 PathProgramCache]: Analyzing trace with hash 568154688, now seen corresponding path program 1 times [2021-11-25 18:03:47,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:47,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761164145] [2021-11-25 18:03:47,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:47,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:03:47,250 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:47,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761164145] [2021-11-25 18:03:47,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761164145] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:03:47,251 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:03:47,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-25 18:03:47,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175184069] [2021-11-25 18:03:47,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:03:47,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:03:47,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:47,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:03:47,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:03:47,253 INFO L87 Difference]: Start difference. First operand 224 states and 249 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:47,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:47,479 INFO L93 Difference]: Finished difference Result 349 states and 393 transitions. [2021-11-25 18:03:47,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:03:47,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-11-25 18:03:47,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:47,481 INFO L225 Difference]: With dead ends: 349 [2021-11-25 18:03:47,482 INFO L226 Difference]: Without dead ends: 348 [2021-11-25 18:03:47,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:03:47,483 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 125 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:47,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 311 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:03:47,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-11-25 18:03:47,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 227. [2021-11-25 18:03:47,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 110 states have (on average 2.1454545454545455) internal successors, (236), 224 states have internal predecessors, (236), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 18:03:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 253 transitions. [2021-11-25 18:03:47,524 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 253 transitions. Word has length 5 [2021-11-25 18:03:47,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:47,525 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 253 transitions. [2021-11-25 18:03:47,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:47,525 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 253 transitions. [2021-11-25 18:03:47,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-25 18:03:47,525 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:47,525 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-25 18:03:47,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-25 18:03:47,526 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-11-25 18:03:47,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:47,527 INFO L85 PathProgramCache]: Analyzing trace with hash 450363646, now seen corresponding path program 1 times [2021-11-25 18:03:47,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:47,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775584790] [2021-11-25 18:03:47,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:47,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:47,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:03:47,607 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:47,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775584790] [2021-11-25 18:03:47,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775584790] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:03:47,609 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:03:47,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:03:47,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848593845] [2021-11-25 18:03:47,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:03:47,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:03:47,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:47,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:03:47,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:03:47,613 INFO L87 Difference]: Start difference. First operand 227 states and 253 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:47,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:47,846 INFO L93 Difference]: Finished difference Result 360 states and 404 transitions. [2021-11-25 18:03:47,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:03:47,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-25 18:03:47,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:47,850 INFO L225 Difference]: With dead ends: 360 [2021-11-25 18:03:47,850 INFO L226 Difference]: Without dead ends: 360 [2021-11-25 18:03:47,851 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:03:47,852 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 146 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:47,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 466 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:03:47,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-11-25 18:03:47,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 225. [2021-11-25 18:03:47,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 110 states have (on average 2.1272727272727274) internal successors, (234), 222 states have internal predecessors, (234), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 18:03:47,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 251 transitions. [2021-11-25 18:03:47,875 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 251 transitions. Word has length 6 [2021-11-25 18:03:47,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:47,876 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 251 transitions. [2021-11-25 18:03:47,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:47,876 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 251 transitions. [2021-11-25 18:03:47,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-25 18:03:47,877 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:47,877 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-25 18:03:47,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-25 18:03:47,878 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-11-25 18:03:47,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:47,881 INFO L85 PathProgramCache]: Analyzing trace with hash 450363645, now seen corresponding path program 1 times [2021-11-25 18:03:47,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:47,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61431850] [2021-11-25 18:03:47,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:47,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:47,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:03:47,929 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:47,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61431850] [2021-11-25 18:03:47,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61431850] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:03:47,930 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:03:47,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:03:47,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566232356] [2021-11-25 18:03:47,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:03:47,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:03:47,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:47,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:03:47,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:03:47,932 INFO L87 Difference]: Start difference. First operand 225 states and 251 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:48,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:48,174 INFO L93 Difference]: Finished difference Result 390 states and 440 transitions. [2021-11-25 18:03:48,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:03:48,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-25 18:03:48,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:48,178 INFO L225 Difference]: With dead ends: 390 [2021-11-25 18:03:48,178 INFO L226 Difference]: Without dead ends: 390 [2021-11-25 18:03:48,178 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:03:48,179 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 174 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:48,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 474 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:03:48,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-11-25 18:03:48,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 223. [2021-11-25 18:03:48,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 110 states have (on average 2.109090909090909) internal successors, (232), 220 states have internal predecessors, (232), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 18:03:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 249 transitions. [2021-11-25 18:03:48,189 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 249 transitions. Word has length 6 [2021-11-25 18:03:48,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:48,190 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 249 transitions. [2021-11-25 18:03:48,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:48,190 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 249 transitions. [2021-11-25 18:03:48,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-25 18:03:48,191 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:48,191 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:48,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-25 18:03:48,191 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-11-25 18:03:48,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:48,192 INFO L85 PathProgramCache]: Analyzing trace with hash 535440203, now seen corresponding path program 1 times [2021-11-25 18:03:48,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:48,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558919313] [2021-11-25 18:03:48,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:48,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:48,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:03:48,218 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:48,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558919313] [2021-11-25 18:03:48,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558919313] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:03:48,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:03:48,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:03:48,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542396910] [2021-11-25 18:03:48,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:03:48,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:03:48,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:48,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:03:48,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:03:48,221 INFO L87 Difference]: Start difference. First operand 223 states and 249 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2021-11-25 18:03:48,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:48,307 INFO L93 Difference]: Finished difference Result 229 states and 253 transitions. [2021-11-25 18:03:48,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:03:48,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2021-11-25 18:03:48,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:48,310 INFO L225 Difference]: With dead ends: 229 [2021-11-25 18:03:48,310 INFO L226 Difference]: Without dead ends: 228 [2021-11-25 18:03:48,310 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:03:48,312 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 5 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:48,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 415 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:03:48,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-11-25 18:03:48,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 222. [2021-11-25 18:03:48,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 109 states have (on average 2.110091743119266) internal successors, (230), 219 states have internal predecessors, (230), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 18:03:48,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 247 transitions. [2021-11-25 18:03:48,320 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 247 transitions. Word has length 7 [2021-11-25 18:03:48,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:48,320 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 247 transitions. [2021-11-25 18:03:48,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2021-11-25 18:03:48,321 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 247 transitions. [2021-11-25 18:03:48,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-25 18:03:48,321 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:48,321 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:48,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-25 18:03:48,322 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-11-25 18:03:48,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:48,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1154009547, now seen corresponding path program 1 times [2021-11-25 18:03:48,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:48,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905213908] [2021-11-25 18:03:48,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:48,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:48,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:03:48,374 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:48,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905213908] [2021-11-25 18:03:48,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905213908] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:03:48,375 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:03:48,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 18:03:48,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400131335] [2021-11-25 18:03:48,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:03:48,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 18:03:48,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:48,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 18:03:48,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 18:03:48,377 INFO L87 Difference]: Start difference. First operand 222 states and 247 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:48,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:48,505 INFO L93 Difference]: Finished difference Result 353 states and 393 transitions. [2021-11-25 18:03:48,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 18:03:48,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-25 18:03:48,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:48,509 INFO L225 Difference]: With dead ends: 353 [2021-11-25 18:03:48,509 INFO L226 Difference]: Without dead ends: 353 [2021-11-25 18:03:48,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 18:03:48,511 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 535 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:48,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [537 Valid, 380 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:03:48,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-11-25 18:03:48,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 222. [2021-11-25 18:03:48,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 109 states have (on average 2.1009174311926606) internal successors, (229), 219 states have internal predecessors, (229), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 18:03:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 246 transitions. [2021-11-25 18:03:48,523 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 246 transitions. Word has length 11 [2021-11-25 18:03:48,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:48,523 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 246 transitions. [2021-11-25 18:03:48,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:48,524 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 246 transitions. [2021-11-25 18:03:48,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-25 18:03:48,524 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:48,525 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:48,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-25 18:03:48,526 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-11-25 18:03:48,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:48,527 INFO L85 PathProgramCache]: Analyzing trace with hash -901980672, now seen corresponding path program 1 times [2021-11-25 18:03:48,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:48,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419411745] [2021-11-25 18:03:48,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:48,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:48,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:03:48,629 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:48,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419411745] [2021-11-25 18:03:48,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419411745] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:03:48,630 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:03:48,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 18:03:48,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287429644] [2021-11-25 18:03:48,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:03:48,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 18:03:48,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:48,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 18:03:48,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 18:03:48,636 INFO L87 Difference]: Start difference. First operand 222 states and 246 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) [2021-11-25 18:03:48,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:48,883 INFO L93 Difference]: Finished difference Result 627 states and 702 transitions. [2021-11-25 18:03:48,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 18:03:48,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 13 [2021-11-25 18:03:48,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:48,887 INFO L225 Difference]: With dead ends: 627 [2021-11-25 18:03:48,888 INFO L226 Difference]: Without dead ends: 627 [2021-11-25 18:03:48,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-25 18:03:48,889 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 1317 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1319 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:48,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1319 Valid, 528 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:03:48,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2021-11-25 18:03:48,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 247. [2021-11-25 18:03:48,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 135 states have (on average 2.066666666666667) internal successors, (279), 244 states have internal predecessors, (279), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 18:03:48,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 295 transitions. [2021-11-25 18:03:48,910 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 295 transitions. Word has length 13 [2021-11-25 18:03:48,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:48,911 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 295 transitions. [2021-11-25 18:03:48,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) [2021-11-25 18:03:48,911 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 295 transitions. [2021-11-25 18:03:48,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-25 18:03:48,912 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:48,912 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:48,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-25 18:03:48,913 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-11-25 18:03:48,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:48,913 INFO L85 PathProgramCache]: Analyzing trace with hash -901991921, now seen corresponding path program 1 times [2021-11-25 18:03:48,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:48,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228531433] [2021-11-25 18:03:48,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:48,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:48,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:03:48,961 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:48,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228531433] [2021-11-25 18:03:48,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228531433] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:03:48,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:03:48,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 18:03:48,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418624826] [2021-11-25 18:03:48,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:03:48,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 18:03:48,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:48,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 18:03:48,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 18:03:48,964 INFO L87 Difference]: Start difference. First operand 247 states and 295 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:49,382 INFO L93 Difference]: Finished difference Result 403 states and 470 transitions. [2021-11-25 18:03:49,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 18:03:49,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-25 18:03:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:49,385 INFO L225 Difference]: With dead ends: 403 [2021-11-25 18:03:49,385 INFO L226 Difference]: Without dead ends: 403 [2021-11-25 18:03:49,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-25 18:03:49,386 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 576 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:49,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [578 Valid, 413 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 18:03:49,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-11-25 18:03:49,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 238. [2021-11-25 18:03:49,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 135 states have (on average 1.9777777777777779) internal successors, (267), 235 states have internal predecessors, (267), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 18:03:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 283 transitions. [2021-11-25 18:03:49,395 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 283 transitions. Word has length 13 [2021-11-25 18:03:49,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:49,395 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 283 transitions. [2021-11-25 18:03:49,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:49,396 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 283 transitions. [2021-11-25 18:03:49,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-25 18:03:49,396 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:49,396 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:49,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-25 18:03:49,397 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-11-25 18:03:49,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:49,397 INFO L85 PathProgramCache]: Analyzing trace with hash -901991920, now seen corresponding path program 1 times [2021-11-25 18:03:49,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:49,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838407590] [2021-11-25 18:03:49,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:49,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:49,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:03:49,461 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:49,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838407590] [2021-11-25 18:03:49,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838407590] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:03:49,462 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:03:49,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 18:03:49,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481308901] [2021-11-25 18:03:49,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:03:49,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 18:03:49,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:49,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 18:03:49,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 18:03:49,463 INFO L87 Difference]: Start difference. First operand 238 states and 283 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:49,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:49,923 INFO L93 Difference]: Finished difference Result 534 states and 596 transitions. [2021-11-25 18:03:49,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 18:03:49,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-25 18:03:49,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:49,926 INFO L225 Difference]: With dead ends: 534 [2021-11-25 18:03:49,926 INFO L226 Difference]: Without dead ends: 534 [2021-11-25 18:03:49,927 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-25 18:03:49,927 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 804 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:49,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [804 Valid, 441 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 18:03:49,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2021-11-25 18:03:49,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 258. [2021-11-25 18:03:49,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 155 states have (on average 1.8774193548387097) internal successors, (291), 255 states have internal predecessors, (291), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 18:03:49,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 307 transitions. [2021-11-25 18:03:49,938 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 307 transitions. Word has length 13 [2021-11-25 18:03:49,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:49,938 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 307 transitions. [2021-11-25 18:03:49,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:49,939 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 307 transitions. [2021-11-25 18:03:49,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:03:49,940 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:49,940 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:49,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-25 18:03:49,941 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-11-25 18:03:49,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:49,942 INFO L85 PathProgramCache]: Analyzing trace with hash -256693872, now seen corresponding path program 1 times [2021-11-25 18:03:49,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:49,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645891497] [2021-11-25 18:03:49,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:49,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:50,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:03:50,042 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:50,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645891497] [2021-11-25 18:03:50,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645891497] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:03:50,043 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:03:50,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 18:03:50,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293746913] [2021-11-25 18:03:50,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:03:50,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 18:03:50,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:50,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 18:03:50,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 18:03:50,045 INFO L87 Difference]: Start difference. First operand 258 states and 307 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2021-11-25 18:03:50,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:50,253 INFO L93 Difference]: Finished difference Result 332 states and 387 transitions. [2021-11-25 18:03:50,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 18:03:50,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 20 [2021-11-25 18:03:50,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:50,256 INFO L225 Difference]: With dead ends: 332 [2021-11-25 18:03:50,256 INFO L226 Difference]: Without dead ends: 332 [2021-11-25 18:03:50,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-25 18:03:50,257 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 95 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:50,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 662 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:03:50,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-11-25 18:03:50,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 257. [2021-11-25 18:03:50,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 155 states have (on average 1.864516129032258) internal successors, (289), 254 states have internal predecessors, (289), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 18:03:50,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 304 transitions. [2021-11-25 18:03:50,267 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 304 transitions. Word has length 20 [2021-11-25 18:03:50,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:50,267 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 304 transitions. [2021-11-25 18:03:50,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2021-11-25 18:03:50,268 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 304 transitions. [2021-11-25 18:03:50,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:03:50,269 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:50,269 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:50,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-25 18:03:50,269 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-11-25 18:03:50,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:50,270 INFO L85 PathProgramCache]: Analyzing trace with hash -937110950, now seen corresponding path program 1 times [2021-11-25 18:03:50,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:50,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021149504] [2021-11-25 18:03:50,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:50,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:50,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:03:50,348 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:50,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021149504] [2021-11-25 18:03:50,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021149504] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:03:50,348 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:03:50,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 18:03:50,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077037319] [2021-11-25 18:03:50,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:03:50,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 18:03:50,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:50,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 18:03:50,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 18:03:50,351 INFO L87 Difference]: Start difference. First operand 257 states and 304 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2021-11-25 18:03:50,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:50,540 INFO L93 Difference]: Finished difference Result 256 states and 301 transitions. [2021-11-25 18:03:50,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 18:03:50,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 20 [2021-11-25 18:03:50,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:50,542 INFO L225 Difference]: With dead ends: 256 [2021-11-25 18:03:50,542 INFO L226 Difference]: Without dead ends: 256 [2021-11-25 18:03:50,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-25 18:03:50,543 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 18 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:50,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 673 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:03:50,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-11-25 18:03:50,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2021-11-25 18:03:50,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 155 states have (on average 1.8516129032258064) internal successors, (287), 253 states have internal predecessors, (287), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 18:03:50,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 301 transitions. [2021-11-25 18:03:50,550 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 301 transitions. Word has length 20 [2021-11-25 18:03:50,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:50,550 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 301 transitions. [2021-11-25 18:03:50,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2021-11-25 18:03:50,551 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 301 transitions. [2021-11-25 18:03:50,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:03:50,552 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:50,552 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:50,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-25 18:03:50,552 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-11-25 18:03:50,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:50,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1946598122, now seen corresponding path program 1 times [2021-11-25 18:03:50,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:50,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367426149] [2021-11-25 18:03:50,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:50,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:50,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:03:50,665 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:50,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367426149] [2021-11-25 18:03:50,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367426149] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:03:50,666 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:03:50,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-25 18:03:50,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509938611] [2021-11-25 18:03:50,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:03:50,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-25 18:03:50,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:50,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-25 18:03:50,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-25 18:03:50,668 INFO L87 Difference]: Start difference. First operand 256 states and 301 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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) [2021-11-25 18:03:51,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:51,039 INFO L93 Difference]: Finished difference Result 539 states and 596 transitions. [2021-11-25 18:03:51,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 18:03:51,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 23 [2021-11-25 18:03:51,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:51,043 INFO L225 Difference]: With dead ends: 539 [2021-11-25 18:03:51,043 INFO L226 Difference]: Without dead ends: 539 [2021-11-25 18:03:51,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-11-25 18:03:51,044 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 1165 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:51,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1167 Valid, 825 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 18:03:51,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-11-25 18:03:51,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 256. [2021-11-25 18:03:51,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 155 states have (on average 1.8451612903225807) internal successors, (286), 253 states have internal predecessors, (286), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 18:03:51,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 300 transitions. [2021-11-25 18:03:51,054 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 300 transitions. Word has length 23 [2021-11-25 18:03:51,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:51,054 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 300 transitions. [2021-11-25 18:03:51,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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) [2021-11-25 18:03:51,055 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 300 transitions. [2021-11-25 18:03:51,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 18:03:51,056 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:51,056 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:51,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-25 18:03:51,056 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-11-25 18:03:51,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:51,057 INFO L85 PathProgramCache]: Analyzing trace with hash -479719491, now seen corresponding path program 1 times [2021-11-25 18:03:51,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:51,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517681317] [2021-11-25 18:03:51,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:51,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:51,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:03:51,121 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:51,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517681317] [2021-11-25 18:03:51,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517681317] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:03:51,121 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:03:51,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-25 18:03:51,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455523096] [2021-11-25 18:03:51,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:03:51,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-25 18:03:51,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:51,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-25 18:03:51,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-25 18:03:51,123 INFO L87 Difference]: Start difference. First operand 256 states and 300 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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) [2021-11-25 18:03:51,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:51,460 INFO L93 Difference]: Finished difference Result 538 states and 594 transitions. [2021-11-25 18:03:51,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 18:03:51,461 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 23 [2021-11-25 18:03:51,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:51,464 INFO L225 Difference]: With dead ends: 538 [2021-11-25 18:03:51,464 INFO L226 Difference]: Without dead ends: 538 [2021-11-25 18:03:51,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-11-25 18:03:51,465 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 1161 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:51,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1163 Valid, 825 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 18:03:51,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-11-25 18:03:51,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 256. [2021-11-25 18:03:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 155 states have (on average 1.8387096774193548) internal successors, (285), 253 states have internal predecessors, (285), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 18:03:51,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 299 transitions. [2021-11-25 18:03:51,475 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 299 transitions. Word has length 23 [2021-11-25 18:03:51,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:51,475 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 299 transitions. [2021-11-25 18:03:51,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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) [2021-11-25 18:03:51,476 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 299 transitions. [2021-11-25 18:03:51,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 18:03:51,476 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:51,477 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:51,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-25 18:03:51,477 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-11-25 18:03:51,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:51,478 INFO L85 PathProgramCache]: Analyzing trace with hash 214784498, now seen corresponding path program 1 times [2021-11-25 18:03:51,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:51,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802999364] [2021-11-25 18:03:51,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:51,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:51,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:03:51,556 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:51,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802999364] [2021-11-25 18:03:51,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802999364] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:03:51,556 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:03:51,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-25 18:03:51,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380693181] [2021-11-25 18:03:51,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:03:51,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 18:03:51,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:51,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 18:03:51,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-25 18:03:51,557 INFO L87 Difference]: Start difference. First operand 256 states and 299 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:52,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:52,172 INFO L93 Difference]: Finished difference Result 591 states and 662 transitions. [2021-11-25 18:03:52,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 18:03:52,173 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-25 18:03:52,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:52,176 INFO L225 Difference]: With dead ends: 591 [2021-11-25 18:03:52,176 INFO L226 Difference]: Without dead ends: 591 [2021-11-25 18:03:52,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2021-11-25 18:03:52,177 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 1302 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1304 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:52,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1304 Valid, 645 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 18:03:52,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2021-11-25 18:03:52,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 257. [2021-11-25 18:03:52,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 156 states have (on average 1.8397435897435896) internal successors, (287), 254 states have internal predecessors, (287), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 18:03:52,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 301 transitions. [2021-11-25 18:03:52,192 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 301 transitions. Word has length 24 [2021-11-25 18:03:52,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:52,193 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 301 transitions. [2021-11-25 18:03:52,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:52,193 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 301 transitions. [2021-11-25 18:03:52,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 18:03:52,194 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:52,194 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:52,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-25 18:03:52,194 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-11-25 18:03:52,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:52,196 INFO L85 PathProgramCache]: Analyzing trace with hash 214784499, now seen corresponding path program 1 times [2021-11-25 18:03:52,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:52,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294915252] [2021-11-25 18:03:52,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:52,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:52,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:03:52,354 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:52,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294915252] [2021-11-25 18:03:52,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294915252] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:03:52,357 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:03:52,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-25 18:03:52,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009000895] [2021-11-25 18:03:52,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:03:52,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-25 18:03:52,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:52,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-25 18:03:52,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-25 18:03:52,359 INFO L87 Difference]: Start difference. First operand 257 states and 301 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:52,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:52,992 INFO L93 Difference]: Finished difference Result 596 states and 660 transitions. [2021-11-25 18:03:52,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 18:03:52,992 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-25 18:03:52,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:52,995 INFO L225 Difference]: With dead ends: 596 [2021-11-25 18:03:52,996 INFO L226 Difference]: Without dead ends: 596 [2021-11-25 18:03:52,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-11-25 18:03:52,996 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 1065 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:52,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1065 Valid, 684 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 18:03:52,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-11-25 18:03:53,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 257. [2021-11-25 18:03:53,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 156 states have (on average 1.8333333333333333) internal successors, (286), 254 states have internal predecessors, (286), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 18:03:53,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 300 transitions. [2021-11-25 18:03:53,007 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 300 transitions. Word has length 24 [2021-11-25 18:03:53,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:53,007 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 300 transitions. [2021-11-25 18:03:53,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:53,008 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 300 transitions. [2021-11-25 18:03:53,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 18:03:53,012 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:53,012 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:53,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-25 18:03:53,013 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-11-25 18:03:53,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:53,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1986692204, now seen corresponding path program 1 times [2021-11-25 18:03:53,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:53,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623393727] [2021-11-25 18:03:53,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:53,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:53,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:03:53,118 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:53,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623393727] [2021-11-25 18:03:53,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623393727] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:03:53,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:03:53,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-25 18:03:53,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911434720] [2021-11-25 18:03:53,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:03:53,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 18:03:53,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:53,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 18:03:53,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-25 18:03:53,120 INFO L87 Difference]: Start difference. First operand 257 states and 300 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:53,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:53,707 INFO L93 Difference]: Finished difference Result 589 states and 660 transitions. [2021-11-25 18:03:53,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 18:03:53,709 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-25 18:03:53,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:53,712 INFO L225 Difference]: With dead ends: 589 [2021-11-25 18:03:53,712 INFO L226 Difference]: Without dead ends: 589 [2021-11-25 18:03:53,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2021-11-25 18:03:53,714 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 1292 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:53,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1294 Valid, 645 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 18:03:53,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2021-11-25 18:03:53,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 257. [2021-11-25 18:03:53,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 156 states have (on average 1.8269230769230769) internal successors, (285), 254 states have internal predecessors, (285), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 18:03:53,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 299 transitions. [2021-11-25 18:03:53,724 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 299 transitions. Word has length 24 [2021-11-25 18:03:53,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:53,724 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 299 transitions. [2021-11-25 18:03:53,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:53,724 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 299 transitions. [2021-11-25 18:03:53,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 18:03:53,725 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:53,725 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:53,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-25 18:03:53,726 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-11-25 18:03:53,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:53,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1986692203, now seen corresponding path program 1 times [2021-11-25 18:03:53,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:53,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871534276] [2021-11-25 18:03:53,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:53,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:53,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:03:53,841 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:53,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871534276] [2021-11-25 18:03:53,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871534276] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:03:53,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:03:53,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-25 18:03:53,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640121410] [2021-11-25 18:03:53,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:03:53,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-25 18:03:53,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:53,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-25 18:03:53,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-25 18:03:53,843 INFO L87 Difference]: Start difference. First operand 257 states and 299 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:54,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:54,818 INFO L93 Difference]: Finished difference Result 708 states and 787 transitions. [2021-11-25 18:03:54,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 18:03:54,819 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-25 18:03:54,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:54,823 INFO L225 Difference]: With dead ends: 708 [2021-11-25 18:03:54,823 INFO L226 Difference]: Without dead ends: 708 [2021-11-25 18:03:54,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2021-11-25 18:03:54,825 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 1885 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1885 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:54,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1885 Valid, 565 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-25 18:03:54,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2021-11-25 18:03:54,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 257. [2021-11-25 18:03:54,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 156 states have (on average 1.8205128205128205) internal successors, (284), 254 states have internal predecessors, (284), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 18:03:54,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 298 transitions. [2021-11-25 18:03:54,836 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 298 transitions. Word has length 24 [2021-11-25 18:03:54,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:54,836 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 298 transitions. [2021-11-25 18:03:54,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:54,837 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 298 transitions. [2021-11-25 18:03:54,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 18:03:54,840 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:54,841 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:54,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-25 18:03:54,841 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2021-11-25 18:03:54,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:54,842 INFO L85 PathProgramCache]: Analyzing trace with hash -856061257, now seen corresponding path program 1 times [2021-11-25 18:03:54,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:54,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823762502] [2021-11-25 18:03:54,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:54,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-25 18:03:54,869 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-25 18:03:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-25 18:03:54,929 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-25 18:03:54,929 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-25 18:03:54,931 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONMEMORY_LEAK (104 of 105 remaining) [2021-11-25 18:03:54,933 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr0REQUIRES_VIOLATION (103 of 105 remaining) [2021-11-25 18:03:54,933 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr1REQUIRES_VIOLATION (102 of 105 remaining) [2021-11-25 18:03:54,933 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr2REQUIRES_VIOLATION (101 of 105 remaining) [2021-11-25 18:03:54,933 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr3REQUIRES_VIOLATION (100 of 105 remaining) [2021-11-25 18:03:54,934 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr4REQUIRES_VIOLATION (99 of 105 remaining) [2021-11-25 18:03:54,934 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr5REQUIRES_VIOLATION (98 of 105 remaining) [2021-11-25 18:03:54,934 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr6REQUIRES_VIOLATION (97 of 105 remaining) [2021-11-25 18:03:54,934 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr7REQUIRES_VIOLATION (96 of 105 remaining) [2021-11-25 18:03:54,934 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr8REQUIRES_VIOLATION (95 of 105 remaining) [2021-11-25 18:03:54,934 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr9REQUIRES_VIOLATION (94 of 105 remaining) [2021-11-25 18:03:54,935 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr10REQUIRES_VIOLATION (93 of 105 remaining) [2021-11-25 18:03:54,935 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr11REQUIRES_VIOLATION (92 of 105 remaining) [2021-11-25 18:03:54,935 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr12REQUIRES_VIOLATION (91 of 105 remaining) [2021-11-25 18:03:54,935 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr13REQUIRES_VIOLATION (90 of 105 remaining) [2021-11-25 18:03:54,935 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (89 of 105 remaining) [2021-11-25 18:03:54,935 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (88 of 105 remaining) [2021-11-25 18:03:54,935 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (87 of 105 remaining) [2021-11-25 18:03:54,936 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (86 of 105 remaining) [2021-11-25 18:03:54,936 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (85 of 105 remaining) [2021-11-25 18:03:54,936 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (84 of 105 remaining) [2021-11-25 18:03:54,936 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (83 of 105 remaining) [2021-11-25 18:03:54,936 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (82 of 105 remaining) [2021-11-25 18:03:54,936 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (81 of 105 remaining) [2021-11-25 18:03:54,937 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (80 of 105 remaining) [2021-11-25 18:03:54,937 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (79 of 105 remaining) [2021-11-25 18:03:54,937 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (78 of 105 remaining) [2021-11-25 18:03:54,937 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (77 of 105 remaining) [2021-11-25 18:03:54,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (76 of 105 remaining) [2021-11-25 18:03:54,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (75 of 105 remaining) [2021-11-25 18:03:54,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (74 of 105 remaining) [2021-11-25 18:03:54,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (73 of 105 remaining) [2021-11-25 18:03:54,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (72 of 105 remaining) [2021-11-25 18:03:54,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (71 of 105 remaining) [2021-11-25 18:03:54,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (70 of 105 remaining) [2021-11-25 18:03:54,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (69 of 105 remaining) [2021-11-25 18:03:54,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (68 of 105 remaining) [2021-11-25 18:03:54,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (67 of 105 remaining) [2021-11-25 18:03:54,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (66 of 105 remaining) [2021-11-25 18:03:54,940 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (65 of 105 remaining) [2021-11-25 18:03:54,940 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (64 of 105 remaining) [2021-11-25 18:03:54,940 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (63 of 105 remaining) [2021-11-25 18:03:54,940 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (62 of 105 remaining) [2021-11-25 18:03:54,940 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (61 of 105 remaining) [2021-11-25 18:03:54,940 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (60 of 105 remaining) [2021-11-25 18:03:54,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (59 of 105 remaining) [2021-11-25 18:03:54,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (58 of 105 remaining) [2021-11-25 18:03:54,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (57 of 105 remaining) [2021-11-25 18:03:54,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (56 of 105 remaining) [2021-11-25 18:03:54,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (55 of 105 remaining) [2021-11-25 18:03:54,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (54 of 105 remaining) [2021-11-25 18:03:54,942 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (53 of 105 remaining) [2021-11-25 18:03:54,942 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (52 of 105 remaining) [2021-11-25 18:03:54,942 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (51 of 105 remaining) [2021-11-25 18:03:54,942 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (50 of 105 remaining) [2021-11-25 18:03:54,942 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (49 of 105 remaining) [2021-11-25 18:03:54,942 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (48 of 105 remaining) [2021-11-25 18:03:54,943 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (47 of 105 remaining) [2021-11-25 18:03:54,943 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION (46 of 105 remaining) [2021-11-25 18:03:54,943 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION (45 of 105 remaining) [2021-11-25 18:03:54,943 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (44 of 105 remaining) [2021-11-25 18:03:54,943 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (43 of 105 remaining) [2021-11-25 18:03:54,943 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION (42 of 105 remaining) [2021-11-25 18:03:54,944 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION (41 of 105 remaining) [2021-11-25 18:03:54,944 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (40 of 105 remaining) [2021-11-25 18:03:54,944 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION (39 of 105 remaining) [2021-11-25 18:03:54,944 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION (38 of 105 remaining) [2021-11-25 18:03:54,944 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION (37 of 105 remaining) [2021-11-25 18:03:54,944 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION (36 of 105 remaining) [2021-11-25 18:03:54,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION (35 of 105 remaining) [2021-11-25 18:03:54,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION (34 of 105 remaining) [2021-11-25 18:03:54,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION (33 of 105 remaining) [2021-11-25 18:03:54,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION (32 of 105 remaining) [2021-11-25 18:03:54,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION (31 of 105 remaining) [2021-11-25 18:03:54,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION (30 of 105 remaining) [2021-11-25 18:03:54,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION (29 of 105 remaining) [2021-11-25 18:03:54,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION (28 of 105 remaining) [2021-11-25 18:03:54,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION (27 of 105 remaining) [2021-11-25 18:03:54,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATION (26 of 105 remaining) [2021-11-25 18:03:54,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE (25 of 105 remaining) [2021-11-25 18:03:54,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE (24 of 105 remaining) [2021-11-25 18:03:54,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE (23 of 105 remaining) [2021-11-25 18:03:54,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION (22 of 105 remaining) [2021-11-25 18:03:54,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATION (21 of 105 remaining) [2021-11-25 18:03:54,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATION (20 of 105 remaining) [2021-11-25 18:03:54,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATION (19 of 105 remaining) [2021-11-25 18:03:54,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATION (18 of 105 remaining) [2021-11-25 18:03:54,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION (17 of 105 remaining) [2021-11-25 18:03:54,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATION (16 of 105 remaining) [2021-11-25 18:03:54,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATION (15 of 105 remaining) [2021-11-25 18:03:54,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATION (14 of 105 remaining) [2021-11-25 18:03:54,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATION (13 of 105 remaining) [2021-11-25 18:03:54,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATION (12 of 105 remaining) [2021-11-25 18:03:54,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATION (11 of 105 remaining) [2021-11-25 18:03:54,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATION (10 of 105 remaining) [2021-11-25 18:03:54,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATION (9 of 105 remaining) [2021-11-25 18:03:54,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_FREE (8 of 105 remaining) [2021-11-25 18:03:54,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE (7 of 105 remaining) [2021-11-25 18:03:54,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE (6 of 105 remaining) [2021-11-25 18:03:54,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84REQUIRES_VIOLATION (5 of 105 remaining) [2021-11-25 18:03:54,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85REQUIRES_VIOLATION (4 of 105 remaining) [2021-11-25 18:03:54,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONMEMORY_FREE (3 of 105 remaining) [2021-11-25 18:03:54,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONMEMORY_FREE (2 of 105 remaining) [2021-11-25 18:03:54,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONMEMORY_FREE (1 of 105 remaining) [2021-11-25 18:03:54,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK (0 of 105 remaining) [2021-11-25 18:03:54,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-25 18:03:54,959 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:54,964 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-25 18:03:55,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:03:55 BoogieIcfgContainer [2021-11-25 18:03:55,017 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-25 18:03:55,018 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-25 18:03:55,018 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-25 18:03:55,018 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-25 18:03:55,019 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:03:45" (3/4) ... [2021-11-25 18:03:55,021 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-25 18:03:55,088 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6c679b4-56b6-4220-997e-cd8505447784/bin/utaipan-eEHZpOm5b7/witness.graphml [2021-11-25 18:03:55,088 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-25 18:03:55,089 INFO L158 Benchmark]: Toolchain (without parser) took 10813.37ms. Allocated memory was 94.4MB in the beginning and 176.2MB in the end (delta: 81.8MB). Free memory was 57.1MB in the beginning and 58.3MB in the end (delta: -1.2MB). Peak memory consumption was 78.7MB. Max. memory is 16.1GB. [2021-11-25 18:03:55,089 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 94.4MB. Free memory was 74.8MB in the beginning and 74.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 18:03:55,098 INFO L158 Benchmark]: CACSL2BoogieTranslator took 604.53ms. Allocated memory is still 94.4MB. Free memory was 56.9MB in the beginning and 61.7MB in the end (delta: -4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-25 18:03:55,098 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.83ms. Allocated memory is still 94.4MB. Free memory was 61.7MB in the beginning and 58.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-25 18:03:55,099 INFO L158 Benchmark]: Boogie Preprocessor took 59.33ms. Allocated memory is still 94.4MB. Free memory was 58.9MB in the beginning and 56.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-25 18:03:55,099 INFO L158 Benchmark]: RCFGBuilder took 934.81ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 56.4MB in the beginning and 68.5MB in the end (delta: -12.1MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2021-11-25 18:03:55,100 INFO L158 Benchmark]: TraceAbstraction took 9058.88ms. Allocated memory was 113.2MB in the beginning and 176.2MB in the end (delta: 62.9MB). Free memory was 68.5MB in the beginning and 60.4MB in the end (delta: 8.2MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. [2021-11-25 18:03:55,104 INFO L158 Benchmark]: Witness Printer took 70.80ms. Allocated memory is still 176.2MB. Free memory was 60.4MB in the beginning and 58.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-25 18:03:55,109 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 94.4MB. Free memory was 74.8MB in the beginning and 74.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 604.53ms. Allocated memory is still 94.4MB. Free memory was 56.9MB in the beginning and 61.7MB in the end (delta: -4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.83ms. Allocated memory is still 94.4MB. Free memory was 61.7MB in the beginning and 58.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.33ms. Allocated memory is still 94.4MB. Free memory was 58.9MB in the beginning and 56.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 934.81ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 56.4MB in the beginning and 68.5MB in the end (delta: -12.1MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9058.88ms. Allocated memory was 113.2MB in the beginning and 176.2MB in the end (delta: 62.9MB). Free memory was 68.5MB in the beginning and 60.4MB in the end (delta: 8.2MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. * Witness Printer took 70.80ms. Allocated memory is still 176.2MB. Free memory was 60.4MB in the beginning and 58.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 565]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L638] struct list *data = ((void *)0); VAL [data={0:0}] [L639] COND TRUE __VERIFIER_nondet_int() [L640] struct node *node = malloc(sizeof *node); [L641] COND FALSE !(!node) VAL [data={0:0}, node={-1:0}] [L643] node->next = node [L644] node->value = __VERIFIER_nondet_int() [L645] struct list *item = malloc(sizeof *item); [L646] COND FALSE !(!item) VAL [data={0:0}, item={-3:0}, node={-1:0}] [L648] item->slist = node VAL [data={0:0}, item={-3:0}, node={-1:0}] [L649] item->next = data [L650] data = item VAL [data={-3:0}, item={-3:0}, node={-1:0}] [L639] COND FALSE !(__VERIFIER_nondet_int()) [L652] COND FALSE !(!data) [L654] CALL inspect_before(data) [L615] COND FALSE !(!(shape)) VAL [shape={-3:0}, shape={-3:0}] [L616] shape->next VAL [shape={-3:0}, shape={-3:0}, shape->next={0:0}] [L616] COND FALSE !(shape->next) [L622] COND FALSE !(!(shape)) VAL [shape={-3:0}, shape={-3:0}] [L623] EXPR shape->next VAL [shape={-3:0}, shape={-3:0}, shape->next={0:0}] [L623] COND FALSE !(!(shape->next == ((void *)0))) [L624] EXPR shape->slist VAL [shape={-3:0}, shape={-3:0}, shape->slist={-1:0}] [L624] COND FALSE !(!(shape->slist)) [L625] EXPR shape->slist VAL [shape={-3:0}, shape={-3:0}, shape->slist={-1:0}] [L625] EXPR shape->slist->next VAL [shape={-3:0}, shape={-3:0}, shape->slist={-1:0}, shape->slist->next={-1:0}] [L625] COND TRUE !(shape->slist->next == ((void *)0)) [L625] CALL fail() [L565] reach_error() - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 649]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 649]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 624]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 624]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 630]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 630]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 631]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 631]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 661]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 661]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 636]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 230 locations, 105 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12012 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11994 mSDsluCounter, 9902 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6639 mSDsCounter, 287 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6068 IncrementalHoareTripleChecker+Invalid, 6355 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 287 mSolverCounterUnsat, 3660 mSDtfsCounter, 6068 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=10, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 3781 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 246 ConstructedInterpolants, 0 QuantifiedInterpolants, 1721 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 24/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-25 18:03:55,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6c679b4-56b6-4220-997e-cd8505447784/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)