./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 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9965c63-8c73-418b-bd50-0a4e809b579b/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9965c63-8c73-418b-bd50-0a4e809b579b/bin/utaipan-UbGMyvGFUs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9965c63-8c73-418b-bd50-0a4e809b579b/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9965c63-8c73-418b-bd50-0a4e809b579b/bin/utaipan-UbGMyvGFUs/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9965c63-8c73-418b-bd50-0a4e809b579b/bin/utaipan-UbGMyvGFUs/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9965c63-8c73-418b-bd50-0a4e809b579b/bin/utaipan-UbGMyvGFUs --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.1-dev-0f8a17c [2021-11-19 13:59:41,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 13:59:41,455 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 13:59:41,487 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 13:59:41,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 13:59:41,489 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 13:59:41,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 13:59:41,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 13:59:41,496 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 13:59:41,497 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 13:59:41,499 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 13:59:41,500 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 13:59:41,501 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 13:59:41,502 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 13:59:41,504 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 13:59:41,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 13:59:41,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 13:59:41,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 13:59:41,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 13:59:41,514 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 13:59:41,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 13:59:41,518 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 13:59:41,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 13:59:41,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 13:59:41,525 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 13:59:41,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 13:59:41,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 13:59:41,527 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 13:59:41,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 13:59:41,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 13:59:41,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 13:59:41,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 13:59:41,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 13:59:41,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 13:59:41,536 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 13:59:41,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 13:59:41,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 13:59:41,539 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 13:59:41,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 13:59:41,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 13:59:41,542 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 13:59:41,543 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9965c63-8c73-418b-bd50-0a4e809b579b/bin/utaipan-UbGMyvGFUs/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-11-19 13:59:41,588 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 13:59:41,589 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 13:59:41,590 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 13:59:41,591 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 13:59:41,591 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 13:59:41,591 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 13:59:41,591 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 13:59:41,592 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-19 13:59:41,592 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 13:59:41,592 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 13:59:41,593 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-19 13:59:41,593 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-19 13:59:41,594 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 13:59:41,594 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-19 13:59:41,594 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-19 13:59:41,594 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-19 13:59:41,596 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-19 13:59:41,596 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-19 13:59:41,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 13:59:41,597 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 13:59:41,597 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-19 13:59:41,597 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-19 13:59:41,597 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 13:59:41,597 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 13:59:41,598 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-19 13:59:41,598 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-19 13:59:41,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 13:59:41,600 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 13:59:41,600 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 13:59:41,600 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 13:59:41,601 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 13:59:41,601 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 13:59:41,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 13:59:41,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 13:59:41,602 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 13:59:41,602 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-19 13:59:41,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-19 13:59:41,602 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 13:59:41,603 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 13:59:41,603 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_d9965c63-8c73-418b-bd50-0a4e809b579b/bin/utaipan-UbGMyvGFUs/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_d9965c63-8c73-418b-bd50-0a4e809b579b/bin/utaipan-UbGMyvGFUs 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-19 13:59:41,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 13:59:41,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 13:59:41,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 13:59:41,888 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 13:59:41,893 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 13:59:41,895 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9965c63-8c73-418b-bd50-0a4e809b579b/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2021-11-19 13:59:41,988 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9965c63-8c73-418b-bd50-0a4e809b579b/bin/utaipan-UbGMyvGFUs/data/7faadabfb/4f84dce64ada479ca69c4afba9e19cd5/FLAG913a5dcf4 [2021-11-19 13:59:42,534 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 13:59:42,535 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9965c63-8c73-418b-bd50-0a4e809b579b/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2021-11-19 13:59:42,555 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9965c63-8c73-418b-bd50-0a4e809b579b/bin/utaipan-UbGMyvGFUs/data/7faadabfb/4f84dce64ada479ca69c4afba9e19cd5/FLAG913a5dcf4 [2021-11-19 13:59:42,819 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9965c63-8c73-418b-bd50-0a4e809b579b/bin/utaipan-UbGMyvGFUs/data/7faadabfb/4f84dce64ada479ca69c4afba9e19cd5 [2021-11-19 13:59:42,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 13:59:42,823 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 13:59:42,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 13:59:42,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 13:59:42,828 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 13:59:42,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:59:42" (1/1) ... [2021-11-19 13:59:42,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aecf8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:42, skipping insertion in model container [2021-11-19 13:59:42,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:59:42" (1/1) ... [2021-11-19 13:59:42,837 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 13:59:42,886 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 13:59:43,213 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_d9965c63-8c73-418b-bd50-0a4e809b579b/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2021-11-19 13:59:43,283 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 13:59:43,297 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 13:59:43,329 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_d9965c63-8c73-418b-bd50-0a4e809b579b/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2021-11-19 13:59:43,347 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 13:59:43,380 INFO L208 MainTranslator]: Completed translation [2021-11-19 13:59:43,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:43 WrapperNode [2021-11-19 13:59:43,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 13:59:43,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 13:59:43,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 13:59:43,382 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 13:59:43,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:43" (1/1) ... [2021-11-19 13:59:43,410 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:43" (1/1) ... [2021-11-19 13:59:43,457 INFO L137 Inliner]: procedures = 125, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 294 [2021-11-19 13:59:43,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 13:59:43,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 13:59:43,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 13:59:43,459 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 13:59:43,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:43" (1/1) ... [2021-11-19 13:59:43,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:43" (1/1) ... [2021-11-19 13:59:43,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:43" (1/1) ... [2021-11-19 13:59:43,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:43" (1/1) ... [2021-11-19 13:59:43,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:43" (1/1) ... [2021-11-19 13:59:43,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:43" (1/1) ... [2021-11-19 13:59:43,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:43" (1/1) ... [2021-11-19 13:59:43,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 13:59:43,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 13:59:43,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 13:59:43,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 13:59:43,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:43" (1/1) ... [2021-11-19 13:59:43,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 13:59:43,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9965c63-8c73-418b-bd50-0a4e809b579b/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:59:43,549 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9965c63-8c73-418b-bd50-0a4e809b579b/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 13:59:43,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9965c63-8c73-418b-bd50-0a4e809b579b/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 13:59:43,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-19 13:59:43,607 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2021-11-19 13:59:43,607 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2021-11-19 13:59:43,608 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2021-11-19 13:59:43,608 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2021-11-19 13:59:43,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-19 13:59:43,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-19 13:59:43,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 13:59:43,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-19 13:59:43,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-19 13:59:43,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-19 13:59:43,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-19 13:59:43,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-19 13:59:43,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 13:59:43,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 13:59:43,812 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 13:59:43,829 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 13:59:44,461 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 13:59:44,569 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 13:59:44,569 INFO L301 CfgBuilder]: Removed 33 assume(true) statements. [2021-11-19 13:59:44,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:59:44 BoogieIcfgContainer [2021-11-19 13:59:44,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 13:59:44,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 13:59:44,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 13:59:44,576 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 13:59:44,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:59:42" (1/3) ... [2021-11-19 13:59:44,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127ee6d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:59:44, skipping insertion in model container [2021-11-19 13:59:44,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:59:43" (2/3) ... [2021-11-19 13:59:44,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127ee6d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:59:44, skipping insertion in model container [2021-11-19 13:59:44,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:59:44" (3/3) ... [2021-11-19 13:59:44,580 INFO L111 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2021-11-19 13:59:44,585 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 13:59:44,586 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 105 error locations. [2021-11-19 13:59:44,632 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 13:59:44,639 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-19 13:59:44,639 INFO L340 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2021-11-19 13:59:44,668 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-19 13:59:44,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-19 13:59:44,674 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:44,675 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-19 13:59:44,676 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-19 13:59:44,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:44,682 INFO L85 PathProgramCache]: Analyzing trace with hash 18345167, now seen corresponding path program 1 times [2021-11-19 13:59:44,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:59:44,691 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063628180] [2021-11-19 13:59:44,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:59:44,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:59:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:59:44,837 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-19 13:59:44,838 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:59:44,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063628180] [2021-11-19 13:59:44,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063628180] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:44,839 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:44,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-19 13:59:44,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73189180] [2021-11-19 13:59:44,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:44,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-19 13:59:44,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:59:44,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 13:59:44,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 13:59:44,876 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-19 13:59:45,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:59:45,266 INFO L93 Difference]: Finished difference Result 396 states and 447 transitions. [2021-11-19 13:59:45,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 13:59:45,270 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-19 13:59:45,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:59:45,294 INFO L225 Difference]: With dead ends: 396 [2021-11-19 13:59:45,294 INFO L226 Difference]: Without dead ends: 394 [2021-11-19 13:59:45,296 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-19 13:59:45,303 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 181 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2021-11-19 13:59:45,304 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.3s Time] [2021-11-19 13:59:45,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-11-19 13:59:45,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 226. [2021-11-19 13:59:45,392 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-19 13:59:45,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 251 transitions. [2021-11-19 13:59:45,395 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 251 transitions. Word has length 4 [2021-11-19 13:59:45,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:59:45,396 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 251 transitions. [2021-11-19 13:59:45,396 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-19 13:59:45,396 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 251 transitions. [2021-11-19 13:59:45,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-19 13:59:45,396 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:45,397 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-19 13:59:45,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-19 13:59:45,397 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-19 13:59:45,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:45,407 INFO L85 PathProgramCache]: Analyzing trace with hash 18345168, now seen corresponding path program 1 times [2021-11-19 13:59:45,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:59:45,407 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589120667] [2021-11-19 13:59:45,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:59:45,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:59:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:59:45,505 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-19 13:59:45,506 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:59:45,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589120667] [2021-11-19 13:59:45,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589120667] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:45,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:45,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-19 13:59:45,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104786771] [2021-11-19 13:59:45,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:45,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-19 13:59:45,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:59:45,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 13:59:45,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 13:59:45,514 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-19 13:59:45,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:59:45,794 INFO L93 Difference]: Finished difference Result 360 states and 405 transitions. [2021-11-19 13:59:45,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 13:59:45,795 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-19 13:59:45,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:59:45,797 INFO L225 Difference]: With dead ends: 360 [2021-11-19 13:59:45,798 INFO L226 Difference]: Without dead ends: 360 [2021-11-19 13:59:45,798 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-19 13:59:45,800 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.3s IncrementalHoareTripleChecker+Time [2021-11-19 13:59:45,801 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.3s Time] [2021-11-19 13:59:45,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-11-19 13:59:45,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 224. [2021-11-19 13:59:45,815 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-19 13:59:45,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 249 transitions. [2021-11-19 13:59:45,817 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 249 transitions. Word has length 4 [2021-11-19 13:59:45,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:59:45,818 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 249 transitions. [2021-11-19 13:59:45,818 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-19 13:59:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 249 transitions. [2021-11-19 13:59:45,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-19 13:59:45,819 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:45,819 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-19 13:59:45,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-19 13:59:45,820 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-19 13:59:45,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:45,821 INFO L85 PathProgramCache]: Analyzing trace with hash 568154688, now seen corresponding path program 1 times [2021-11-19 13:59:45,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:59:45,821 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930660401] [2021-11-19 13:59:45,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:59:45,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:59:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:59:45,845 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-19 13:59:45,846 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:59:45,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930660401] [2021-11-19 13:59:45,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930660401] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:45,847 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:45,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-19 13:59:45,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61179861] [2021-11-19 13:59:45,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:45,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-19 13:59:45,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:59:45,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 13:59:45,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 13:59:45,849 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-19 13:59:46,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:59:46,071 INFO L93 Difference]: Finished difference Result 349 states and 393 transitions. [2021-11-19 13:59:46,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 13:59:46,072 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-19 13:59:46,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:59:46,074 INFO L225 Difference]: With dead ends: 349 [2021-11-19 13:59:46,074 INFO L226 Difference]: Without dead ends: 348 [2021-11-19 13:59:46,075 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-19 13:59:46,076 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-19 13:59:46,077 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-19 13:59:46,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-11-19 13:59:46,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 227. [2021-11-19 13:59:46,098 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-19 13:59:46,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 253 transitions. [2021-11-19 13:59:46,100 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 253 transitions. Word has length 5 [2021-11-19 13:59:46,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:59:46,100 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 253 transitions. [2021-11-19 13:59:46,101 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-19 13:59:46,101 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 253 transitions. [2021-11-19 13:59:46,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-19 13:59:46,101 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:46,102 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-19 13:59:46,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-19 13:59:46,103 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-19 13:59:46,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:46,104 INFO L85 PathProgramCache]: Analyzing trace with hash 450363646, now seen corresponding path program 1 times [2021-11-19 13:59:46,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:59:46,105 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750460624] [2021-11-19 13:59:46,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:59:46,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:59:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:59:46,199 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-19 13:59:46,199 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:59:46,200 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750460624] [2021-11-19 13:59:46,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750460624] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:46,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:46,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-19 13:59:46,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188836603] [2021-11-19 13:59:46,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:46,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-19 13:59:46,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:59:46,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 13:59:46,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 13:59:46,204 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-19 13:59:46,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:59:46,438 INFO L93 Difference]: Finished difference Result 360 states and 404 transitions. [2021-11-19 13:59:46,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 13:59:46,439 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-19 13:59:46,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:59:46,441 INFO L225 Difference]: With dead ends: 360 [2021-11-19 13:59:46,441 INFO L226 Difference]: Without dead ends: 360 [2021-11-19 13:59:46,442 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-19 13:59:46,443 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-19 13:59:46,444 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-19 13:59:46,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-11-19 13:59:46,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 225. [2021-11-19 13:59:46,453 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-19 13:59:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 251 transitions. [2021-11-19 13:59:46,455 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 251 transitions. Word has length 6 [2021-11-19 13:59:46,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:59:46,455 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 251 transitions. [2021-11-19 13:59:46,455 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-19 13:59:46,456 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 251 transitions. [2021-11-19 13:59:46,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-19 13:59:46,456 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:46,456 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-19 13:59:46,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-19 13:59:46,457 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-19 13:59:46,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:46,458 INFO L85 PathProgramCache]: Analyzing trace with hash 450363645, now seen corresponding path program 1 times [2021-11-19 13:59:46,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:59:46,458 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890360053] [2021-11-19 13:59:46,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:59:46,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:59:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:59:46,491 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-19 13:59:46,491 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:59:46,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890360053] [2021-11-19 13:59:46,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890360053] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:46,492 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:46,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-19 13:59:46,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429284548] [2021-11-19 13:59:46,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:46,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-19 13:59:46,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:59:46,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 13:59:46,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 13:59:46,494 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-19 13:59:46,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:59:46,748 INFO L93 Difference]: Finished difference Result 390 states and 440 transitions. [2021-11-19 13:59:46,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 13:59:46,750 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-19 13:59:46,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:59:46,752 INFO L225 Difference]: With dead ends: 390 [2021-11-19 13:59:46,752 INFO L226 Difference]: Without dead ends: 390 [2021-11-19 13:59:46,753 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-19 13:59:46,754 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-19 13:59:46,754 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-19 13:59:46,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-11-19 13:59:46,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 223. [2021-11-19 13:59:46,770 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-19 13:59:46,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 249 transitions. [2021-11-19 13:59:46,771 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 249 transitions. Word has length 6 [2021-11-19 13:59:46,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:59:46,772 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 249 transitions. [2021-11-19 13:59:46,773 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-19 13:59:46,773 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 249 transitions. [2021-11-19 13:59:46,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-19 13:59:46,774 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:46,774 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:59:46,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-19 13:59:46,775 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-19 13:59:46,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:46,777 INFO L85 PathProgramCache]: Analyzing trace with hash 535440203, now seen corresponding path program 1 times [2021-11-19 13:59:46,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:59:46,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240697779] [2021-11-19 13:59:46,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:59:46,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:59:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:59:46,823 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-19 13:59:46,824 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:59:46,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240697779] [2021-11-19 13:59:46,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240697779] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:46,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:46,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-19 13:59:46,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716209899] [2021-11-19 13:59:46,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:46,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-19 13:59:46,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:59:46,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 13:59:46,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 13:59:46,827 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-19 13:59:46,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:59:46,911 INFO L93 Difference]: Finished difference Result 229 states and 253 transitions. [2021-11-19 13:59:46,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 13:59:46,912 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-19 13:59:46,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:59:46,914 INFO L225 Difference]: With dead ends: 229 [2021-11-19 13:59:46,914 INFO L226 Difference]: Without dead ends: 228 [2021-11-19 13:59:46,914 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-19 13:59:46,917 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-19 13:59:46,920 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-19 13:59:46,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-11-19 13:59:46,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 222. [2021-11-19 13:59:46,932 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-19 13:59:46,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 247 transitions. [2021-11-19 13:59:46,936 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 247 transitions. Word has length 7 [2021-11-19 13:59:46,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:59:46,936 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 247 transitions. [2021-11-19 13:59:46,936 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-19 13:59:46,937 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 247 transitions. [2021-11-19 13:59:46,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-19 13:59:46,937 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:46,937 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:59:46,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-19 13:59:46,938 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-19 13:59:46,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:46,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1154009547, now seen corresponding path program 1 times [2021-11-19 13:59:46,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:59:46,939 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707227807] [2021-11-19 13:59:46,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:59:46,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:59:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:59:47,010 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-19 13:59:47,010 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:59:47,010 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707227807] [2021-11-19 13:59:47,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707227807] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:47,011 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:47,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 13:59:47,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165337084] [2021-11-19 13:59:47,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:47,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 13:59:47,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:59:47,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 13:59:47,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-19 13:59:47,013 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-19 13:59:47,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:59:47,156 INFO L93 Difference]: Finished difference Result 353 states and 393 transitions. [2021-11-19 13:59:47,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 13:59:47,156 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-19 13:59:47,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:59:47,159 INFO L225 Difference]: With dead ends: 353 [2021-11-19 13:59:47,159 INFO L226 Difference]: Without dead ends: 353 [2021-11-19 13:59:47,159 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-19 13:59:47,160 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-19 13:59:47,161 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-19 13:59:47,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-11-19 13:59:47,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 222. [2021-11-19 13:59:47,168 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-19 13:59:47,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 246 transitions. [2021-11-19 13:59:47,170 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 246 transitions. Word has length 11 [2021-11-19 13:59:47,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:59:47,170 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 246 transitions. [2021-11-19 13:59:47,171 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-19 13:59:47,171 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 246 transitions. [2021-11-19 13:59:47,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-19 13:59:47,172 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:47,172 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:59:47,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-19 13:59:47,172 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-19 13:59:47,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:47,173 INFO L85 PathProgramCache]: Analyzing trace with hash -901980672, now seen corresponding path program 1 times [2021-11-19 13:59:47,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:59:47,174 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932080314] [2021-11-19 13:59:47,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:59:47,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:59:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:59:47,254 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-19 13:59:47,255 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:59:47,255 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932080314] [2021-11-19 13:59:47,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932080314] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:47,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:47,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-19 13:59:47,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156193864] [2021-11-19 13:59:47,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:47,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 13:59:47,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:59:47,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 13:59:47,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 13:59:47,258 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-19 13:59:47,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:59:47,599 INFO L93 Difference]: Finished difference Result 627 states and 702 transitions. [2021-11-19 13:59:47,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-19 13:59:47,600 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-19 13:59:47,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:59:47,605 INFO L225 Difference]: With dead ends: 627 [2021-11-19 13:59:47,605 INFO L226 Difference]: Without dead ends: 627 [2021-11-19 13:59:47,614 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-19 13:59:47,615 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.3s IncrementalHoareTripleChecker+Time [2021-11-19 13:59:47,616 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.3s Time] [2021-11-19 13:59:47,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2021-11-19 13:59:47,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 247. [2021-11-19 13:59:47,631 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-19 13:59:47,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 295 transitions. [2021-11-19 13:59:47,634 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 295 transitions. Word has length 13 [2021-11-19 13:59:47,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:59:47,634 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 295 transitions. [2021-11-19 13:59:47,634 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-19 13:59:47,635 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 295 transitions. [2021-11-19 13:59:47,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-19 13:59:47,636 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:47,636 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:59:47,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-19 13:59:47,636 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-19 13:59:47,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:47,637 INFO L85 PathProgramCache]: Analyzing trace with hash -901991921, now seen corresponding path program 1 times [2021-11-19 13:59:47,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:59:47,638 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395208579] [2021-11-19 13:59:47,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:59:47,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:59:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:59:47,720 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-19 13:59:47,720 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:59:47,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395208579] [2021-11-19 13:59:47,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395208579] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:47,721 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:47,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 13:59:47,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070406297] [2021-11-19 13:59:47,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:47,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 13:59:47,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:59:47,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 13:59:47,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 13:59:47,724 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-19 13:59:48,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:59:48,154 INFO L93 Difference]: Finished difference Result 403 states and 470 transitions. [2021-11-19 13:59:48,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-19 13:59:48,155 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-19 13:59:48,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:59:48,158 INFO L225 Difference]: With dead ends: 403 [2021-11-19 13:59:48,158 INFO L226 Difference]: Without dead ends: 403 [2021-11-19 13:59:48,159 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-19 13:59:48,159 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-19 13:59:48,160 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-19 13:59:48,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-11-19 13:59:48,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 238. [2021-11-19 13:59:48,178 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-19 13:59:48,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 283 transitions. [2021-11-19 13:59:48,179 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 283 transitions. Word has length 13 [2021-11-19 13:59:48,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:59:48,180 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 283 transitions. [2021-11-19 13:59:48,180 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-19 13:59:48,180 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 283 transitions. [2021-11-19 13:59:48,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-19 13:59:48,181 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:48,181 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:59:48,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-19 13:59:48,182 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-19 13:59:48,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:48,182 INFO L85 PathProgramCache]: Analyzing trace with hash -901991920, now seen corresponding path program 1 times [2021-11-19 13:59:48,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:59:48,183 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182760517] [2021-11-19 13:59:48,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:59:48,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:59:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:59:48,264 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-19 13:59:48,265 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:59:48,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182760517] [2021-11-19 13:59:48,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182760517] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:48,265 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:48,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-19 13:59:48,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004658933] [2021-11-19 13:59:48,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:48,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 13:59:48,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:59:48,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 13:59:48,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 13:59:48,268 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-19 13:59:48,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:59:48,705 INFO L93 Difference]: Finished difference Result 534 states and 596 transitions. [2021-11-19 13:59:48,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 13:59:48,706 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-19 13:59:48,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:59:48,709 INFO L225 Difference]: With dead ends: 534 [2021-11-19 13:59:48,709 INFO L226 Difference]: Without dead ends: 534 [2021-11-19 13:59:48,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-19 13:59:48,710 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-19 13:59:48,711 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-19 13:59:48,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2021-11-19 13:59:48,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 258. [2021-11-19 13:59:48,719 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-19 13:59:48,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 307 transitions. [2021-11-19 13:59:48,721 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 307 transitions. Word has length 13 [2021-11-19 13:59:48,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:59:48,721 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 307 transitions. [2021-11-19 13:59:48,722 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-19 13:59:48,722 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 307 transitions. [2021-11-19 13:59:48,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-19 13:59:48,723 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:48,723 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-19 13:59:48,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-19 13:59:48,723 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-19 13:59:48,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:48,724 INFO L85 PathProgramCache]: Analyzing trace with hash -256693872, now seen corresponding path program 1 times [2021-11-19 13:59:48,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:59:48,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314900087] [2021-11-19 13:59:48,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:59:48,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:59:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:59:48,799 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-19 13:59:48,799 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:59:48,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314900087] [2021-11-19 13:59:48,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314900087] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:48,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:48,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-19 13:59:48,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420252331] [2021-11-19 13:59:48,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:48,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 13:59:48,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:59:48,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 13:59:48,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 13:59:48,802 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-19 13:59:49,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:59:49,036 INFO L93 Difference]: Finished difference Result 332 states and 387 transitions. [2021-11-19 13:59:49,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 13:59:49,039 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-19 13:59:49,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:59:49,041 INFO L225 Difference]: With dead ends: 332 [2021-11-19 13:59:49,041 INFO L226 Difference]: Without dead ends: 332 [2021-11-19 13:59:49,041 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-19 13:59:49,042 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-19 13:59:49,042 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-19 13:59:49,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-11-19 13:59:49,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 257. [2021-11-19 13:59:49,050 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-19 13:59:49,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 304 transitions. [2021-11-19 13:59:49,052 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 304 transitions. Word has length 20 [2021-11-19 13:59:49,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:59:49,052 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 304 transitions. [2021-11-19 13:59:49,052 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-19 13:59:49,053 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 304 transitions. [2021-11-19 13:59:49,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-19 13:59:49,053 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:49,054 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-19 13:59:49,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-19 13:59:49,054 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-19 13:59:49,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:49,055 INFO L85 PathProgramCache]: Analyzing trace with hash -937110950, now seen corresponding path program 1 times [2021-11-19 13:59:49,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:59:49,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738659573] [2021-11-19 13:59:49,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:59:49,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:59:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:59:49,122 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-19 13:59:49,122 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:59:49,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738659573] [2021-11-19 13:59:49,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738659573] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:49,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:49,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-19 13:59:49,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416918554] [2021-11-19 13:59:49,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:49,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-19 13:59:49,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:59:49,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-19 13:59:49,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-19 13:59:49,125 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-19 13:59:49,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:59:49,318 INFO L93 Difference]: Finished difference Result 256 states and 301 transitions. [2021-11-19 13:59:49,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-19 13:59:49,319 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-19 13:59:49,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:59:49,320 INFO L225 Difference]: With dead ends: 256 [2021-11-19 13:59:49,321 INFO L226 Difference]: Without dead ends: 256 [2021-11-19 13:59:49,321 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-19 13:59:49,321 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-19 13:59:49,322 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-19 13:59:49,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-11-19 13:59:49,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2021-11-19 13:59:49,328 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-19 13:59:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 301 transitions. [2021-11-19 13:59:49,330 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 301 transitions. Word has length 20 [2021-11-19 13:59:49,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:59:49,330 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 301 transitions. [2021-11-19 13:59:49,330 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-19 13:59:49,330 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 301 transitions. [2021-11-19 13:59:49,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-19 13:59:49,331 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:49,332 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-19 13:59:49,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-19 13:59:49,332 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-19 13:59:49,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:49,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1946598122, now seen corresponding path program 1 times [2021-11-19 13:59:49,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:59:49,333 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164078247] [2021-11-19 13:59:49,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:59:49,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:59:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:59:49,399 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-19 13:59:49,399 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:59:49,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164078247] [2021-11-19 13:59:49,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164078247] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:49,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:49,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-19 13:59:49,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606425403] [2021-11-19 13:59:49,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:49,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-19 13:59:49,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:59:49,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-19 13:59:49,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-19 13:59:49,402 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-19 13:59:49,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:59:49,780 INFO L93 Difference]: Finished difference Result 539 states and 596 transitions. [2021-11-19 13:59:49,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-19 13:59:49,781 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-19 13:59:49,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:59:49,784 INFO L225 Difference]: With dead ends: 539 [2021-11-19 13:59:49,785 INFO L226 Difference]: Without dead ends: 539 [2021-11-19 13:59:49,785 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-19 13:59:49,786 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 1161 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-19 13:59:49,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1163 Valid, 808 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-19 13:59:49,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-11-19 13:59:49,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 256. [2021-11-19 13:59:49,794 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-19 13:59:49,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 300 transitions. [2021-11-19 13:59:49,796 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 300 transitions. Word has length 23 [2021-11-19 13:59:49,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:59:49,796 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 300 transitions. [2021-11-19 13:59:49,797 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-19 13:59:49,797 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 300 transitions. [2021-11-19 13:59:49,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-19 13:59:49,798 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:49,798 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-19 13:59:49,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-19 13:59:49,798 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-19 13:59:49,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:49,799 INFO L85 PathProgramCache]: Analyzing trace with hash -479719491, now seen corresponding path program 1 times [2021-11-19 13:59:49,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:59:49,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129334639] [2021-11-19 13:59:49,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:59:49,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:59:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:59:49,880 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-19 13:59:49,881 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:59:49,881 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129334639] [2021-11-19 13:59:49,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129334639] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:49,881 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:49,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-19 13:59:49,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323813328] [2021-11-19 13:59:49,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:49,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-19 13:59:49,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:59:49,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-19 13:59:49,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-19 13:59:49,883 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-19 13:59:50,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:59:50,270 INFO L93 Difference]: Finished difference Result 538 states and 594 transitions. [2021-11-19 13:59:50,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-19 13:59:50,271 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-19 13:59:50,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:59:50,274 INFO L225 Difference]: With dead ends: 538 [2021-11-19 13:59:50,274 INFO L226 Difference]: Without dead ends: 538 [2021-11-19 13:59:50,274 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-19 13:59:50,275 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 1157 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-19 13:59:50,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1159 Valid, 808 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-19 13:59:50,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-11-19 13:59:50,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 256. [2021-11-19 13:59:50,284 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-19 13:59:50,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 299 transitions. [2021-11-19 13:59:50,286 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 299 transitions. Word has length 23 [2021-11-19 13:59:50,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:59:50,286 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 299 transitions. [2021-11-19 13:59:50,287 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-19 13:59:50,287 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 299 transitions. [2021-11-19 13:59:50,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-19 13:59:50,288 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:50,288 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-19 13:59:50,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-19 13:59:50,289 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-19 13:59:50,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:50,289 INFO L85 PathProgramCache]: Analyzing trace with hash 214784498, now seen corresponding path program 1 times [2021-11-19 13:59:50,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:59:50,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769159406] [2021-11-19 13:59:50,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:59:50,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:59:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:59:50,371 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-19 13:59:50,371 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:59:50,371 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769159406] [2021-11-19 13:59:50,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769159406] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:50,371 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:50,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-19 13:59:50,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008718582] [2021-11-19 13:59:50,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:50,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-19 13:59:50,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:59:50,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-19 13:59:50,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-19 13:59:50,373 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-19 13:59:51,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:59:51,018 INFO L93 Difference]: Finished difference Result 591 states and 662 transitions. [2021-11-19 13:59:51,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-19 13:59:51,018 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-19 13:59:51,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:59:51,022 INFO L225 Difference]: With dead ends: 591 [2021-11-19 13:59:51,022 INFO L226 Difference]: Without dead ends: 591 [2021-11-19 13:59:51,025 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-19 13:59:51,025 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 1298 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1300 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-19 13:59:51,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1300 Valid, 633 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-19 13:59:51,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2021-11-19 13:59:51,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 257. [2021-11-19 13:59:51,038 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-19 13:59:51,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 301 transitions. [2021-11-19 13:59:51,040 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 301 transitions. Word has length 24 [2021-11-19 13:59:51,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:59:51,041 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 301 transitions. [2021-11-19 13:59:51,041 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-19 13:59:51,041 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 301 transitions. [2021-11-19 13:59:51,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-19 13:59:51,042 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:51,042 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-19 13:59:51,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-19 13:59:51,043 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-19 13:59:51,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:51,043 INFO L85 PathProgramCache]: Analyzing trace with hash 214784499, now seen corresponding path program 1 times [2021-11-19 13:59:51,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:59:51,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812659691] [2021-11-19 13:59:51,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:59:51,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:59:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:59:51,192 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-19 13:59:51,192 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:59:51,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812659691] [2021-11-19 13:59:51,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812659691] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:51,193 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:51,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-19 13:59:51,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147059244] [2021-11-19 13:59:51,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:51,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-19 13:59:51,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:59:51,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-19 13:59:51,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-19 13:59:51,195 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-19 13:59:51,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:59:51,856 INFO L93 Difference]: Finished difference Result 596 states and 660 transitions. [2021-11-19 13:59:51,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-19 13:59:51,857 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-19 13:59:51,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:59:51,882 INFO L225 Difference]: With dead ends: 596 [2021-11-19 13:59:51,884 INFO L226 Difference]: Without dead ends: 596 [2021-11-19 13:59:51,884 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-19 13:59:51,885 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 1061 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-19 13:59:51,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1061 Valid, 670 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-19 13:59:51,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-11-19 13:59:51,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 257. [2021-11-19 13:59:51,893 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-19 13:59:51,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 300 transitions. [2021-11-19 13:59:51,894 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 300 transitions. Word has length 24 [2021-11-19 13:59:51,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:59:51,895 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 300 transitions. [2021-11-19 13:59:51,895 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-19 13:59:51,895 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 300 transitions. [2021-11-19 13:59:51,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-19 13:59:51,896 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:51,896 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-19 13:59:51,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-19 13:59:51,897 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-19 13:59:51,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:51,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1986692204, now seen corresponding path program 1 times [2021-11-19 13:59:51,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:59:51,898 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037880146] [2021-11-19 13:59:51,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:59:51,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:59:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:59:51,989 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-19 13:59:51,989 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:59:51,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037880146] [2021-11-19 13:59:51,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037880146] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:51,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:51,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-19 13:59:51,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883320335] [2021-11-19 13:59:51,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:51,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-19 13:59:51,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:59:51,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-19 13:59:51,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-19 13:59:51,992 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-19 13:59:52,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:59:52,570 INFO L93 Difference]: Finished difference Result 589 states and 660 transitions. [2021-11-19 13:59:52,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-19 13:59:52,577 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-19 13:59:52,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:59:52,581 INFO L225 Difference]: With dead ends: 589 [2021-11-19 13:59:52,581 INFO L226 Difference]: Without dead ends: 589 [2021-11-19 13:59:52,582 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-19 13:59:52,582 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 1288 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-19 13:59:52,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1290 Valid, 633 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-19 13:59:52,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2021-11-19 13:59:52,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 257. [2021-11-19 13:59:52,591 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-19 13:59:52,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 299 transitions. [2021-11-19 13:59:52,593 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 299 transitions. Word has length 24 [2021-11-19 13:59:52,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:59:52,593 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 299 transitions. [2021-11-19 13:59:52,593 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-19 13:59:52,594 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 299 transitions. [2021-11-19 13:59:52,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-19 13:59:52,594 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:52,595 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-19 13:59:52,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-19 13:59:52,595 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-19 13:59:52,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:52,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1986692203, now seen corresponding path program 1 times [2021-11-19 13:59:52,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:59:52,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981447357] [2021-11-19 13:59:52,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:59:52,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:59:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:59:52,695 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-19 13:59:52,695 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:59:52,695 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981447357] [2021-11-19 13:59:52,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981447357] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:59:52,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:59:52,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-19 13:59:52,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824424342] [2021-11-19 13:59:52,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:59:52,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-19 13:59:52,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:59:52,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-19 13:59:52,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-19 13:59:52,698 INFO L87 Difference]: Start difference. First operand 257 states and 299 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-19 13:59:53,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:59:53,388 INFO L93 Difference]: Finished difference Result 594 states and 658 transitions. [2021-11-19 13:59:53,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-19 13:59:53,389 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-19 13:59:53,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:59:53,392 INFO L225 Difference]: With dead ends: 594 [2021-11-19 13:59:53,393 INFO L226 Difference]: Without dead ends: 594 [2021-11-19 13:59:53,393 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-19 13:59:53,394 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 1053 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-19 13:59:53,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1053 Valid, 670 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-19 13:59:53,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2021-11-19 13:59:53,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 257. [2021-11-19 13:59:53,402 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-19 13:59:53,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 298 transitions. [2021-11-19 13:59:53,404 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 298 transitions. Word has length 24 [2021-11-19 13:59:53,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:59:53,405 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 298 transitions. [2021-11-19 13:59:53,405 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-19 13:59:53,405 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 298 transitions. [2021-11-19 13:59:53,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-19 13:59:53,406 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:59:53,406 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-19 13:59:53,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-19 13:59:53,407 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-19 13:59:53,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:59:53,407 INFO L85 PathProgramCache]: Analyzing trace with hash -856061257, now seen corresponding path program 1 times [2021-11-19 13:59:53,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:59:53,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045332303] [2021-11-19 13:59:53,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:59:53,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:59:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 13:59:53,424 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 13:59:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 13:59:53,463 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-19 13:59:53,463 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-19 13:59:53,464 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONMEMORY_LEAK (104 of 105 remaining) [2021-11-19 13:59:53,466 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr0REQUIRES_VIOLATION (103 of 105 remaining) [2021-11-19 13:59:53,466 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr1REQUIRES_VIOLATION (102 of 105 remaining) [2021-11-19 13:59:53,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr2REQUIRES_VIOLATION (101 of 105 remaining) [2021-11-19 13:59:53,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr3REQUIRES_VIOLATION (100 of 105 remaining) [2021-11-19 13:59:53,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr4REQUIRES_VIOLATION (99 of 105 remaining) [2021-11-19 13:59:53,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr5REQUIRES_VIOLATION (98 of 105 remaining) [2021-11-19 13:59:53,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr6REQUIRES_VIOLATION (97 of 105 remaining) [2021-11-19 13:59:53,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr7REQUIRES_VIOLATION (96 of 105 remaining) [2021-11-19 13:59:53,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr8REQUIRES_VIOLATION (95 of 105 remaining) [2021-11-19 13:59:53,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr9REQUIRES_VIOLATION (94 of 105 remaining) [2021-11-19 13:59:53,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr10REQUIRES_VIOLATION (93 of 105 remaining) [2021-11-19 13:59:53,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr11REQUIRES_VIOLATION (92 of 105 remaining) [2021-11-19 13:59:53,469 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr12REQUIRES_VIOLATION (91 of 105 remaining) [2021-11-19 13:59:53,469 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr13REQUIRES_VIOLATION (90 of 105 remaining) [2021-11-19 13:59:53,469 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (89 of 105 remaining) [2021-11-19 13:59:53,469 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (88 of 105 remaining) [2021-11-19 13:59:53,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (87 of 105 remaining) [2021-11-19 13:59:53,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (86 of 105 remaining) [2021-11-19 13:59:53,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (85 of 105 remaining) [2021-11-19 13:59:53,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (84 of 105 remaining) [2021-11-19 13:59:53,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (83 of 105 remaining) [2021-11-19 13:59:53,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (82 of 105 remaining) [2021-11-19 13:59:53,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (81 of 105 remaining) [2021-11-19 13:59:53,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (80 of 105 remaining) [2021-11-19 13:59:53,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (79 of 105 remaining) [2021-11-19 13:59:53,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (78 of 105 remaining) [2021-11-19 13:59:53,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (77 of 105 remaining) [2021-11-19 13:59:53,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (76 of 105 remaining) [2021-11-19 13:59:53,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (75 of 105 remaining) [2021-11-19 13:59:53,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (74 of 105 remaining) [2021-11-19 13:59:53,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (73 of 105 remaining) [2021-11-19 13:59:53,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (72 of 105 remaining) [2021-11-19 13:59:53,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (71 of 105 remaining) [2021-11-19 13:59:53,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (70 of 105 remaining) [2021-11-19 13:59:53,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (69 of 105 remaining) [2021-11-19 13:59:53,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (68 of 105 remaining) [2021-11-19 13:59:53,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (67 of 105 remaining) [2021-11-19 13:59:53,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (66 of 105 remaining) [2021-11-19 13:59:53,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (65 of 105 remaining) [2021-11-19 13:59:53,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (64 of 105 remaining) [2021-11-19 13:59:53,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (63 of 105 remaining) [2021-11-19 13:59:53,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (62 of 105 remaining) [2021-11-19 13:59:53,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (61 of 105 remaining) [2021-11-19 13:59:53,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (60 of 105 remaining) [2021-11-19 13:59:53,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (59 of 105 remaining) [2021-11-19 13:59:53,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (58 of 105 remaining) [2021-11-19 13:59:53,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (57 of 105 remaining) [2021-11-19 13:59:53,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (56 of 105 remaining) [2021-11-19 13:59:53,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (55 of 105 remaining) [2021-11-19 13:59:53,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (54 of 105 remaining) [2021-11-19 13:59:53,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (53 of 105 remaining) [2021-11-19 13:59:53,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (52 of 105 remaining) [2021-11-19 13:59:53,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (51 of 105 remaining) [2021-11-19 13:59:53,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (50 of 105 remaining) [2021-11-19 13:59:53,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (49 of 105 remaining) [2021-11-19 13:59:53,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (48 of 105 remaining) [2021-11-19 13:59:53,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (47 of 105 remaining) [2021-11-19 13:59:53,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION (46 of 105 remaining) [2021-11-19 13:59:53,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION (45 of 105 remaining) [2021-11-19 13:59:53,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (44 of 105 remaining) [2021-11-19 13:59:53,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (43 of 105 remaining) [2021-11-19 13:59:53,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION (42 of 105 remaining) [2021-11-19 13:59:53,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION (41 of 105 remaining) [2021-11-19 13:59:53,478 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (40 of 105 remaining) [2021-11-19 13:59:53,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION (39 of 105 remaining) [2021-11-19 13:59:53,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION (38 of 105 remaining) [2021-11-19 13:59:53,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION (37 of 105 remaining) [2021-11-19 13:59:53,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION (36 of 105 remaining) [2021-11-19 13:59:53,479 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION (35 of 105 remaining) [2021-11-19 13:59:53,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION (34 of 105 remaining) [2021-11-19 13:59:53,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION (33 of 105 remaining) [2021-11-19 13:59:53,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION (32 of 105 remaining) [2021-11-19 13:59:53,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION (31 of 105 remaining) [2021-11-19 13:59:53,480 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION (30 of 105 remaining) [2021-11-19 13:59:53,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION (29 of 105 remaining) [2021-11-19 13:59:53,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION (28 of 105 remaining) [2021-11-19 13:59:53,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION (27 of 105 remaining) [2021-11-19 13:59:53,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATION (26 of 105 remaining) [2021-11-19 13:59:53,481 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE (25 of 105 remaining) [2021-11-19 13:59:53,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE (24 of 105 remaining) [2021-11-19 13:59:53,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE (23 of 105 remaining) [2021-11-19 13:59:53,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION (22 of 105 remaining) [2021-11-19 13:59:53,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATION (21 of 105 remaining) [2021-11-19 13:59:53,482 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATION (20 of 105 remaining) [2021-11-19 13:59:53,483 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATION (19 of 105 remaining) [2021-11-19 13:59:53,483 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATION (18 of 105 remaining) [2021-11-19 13:59:53,483 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION (17 of 105 remaining) [2021-11-19 13:59:53,483 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATION (16 of 105 remaining) [2021-11-19 13:59:53,483 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATION (15 of 105 remaining) [2021-11-19 13:59:53,484 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATION (14 of 105 remaining) [2021-11-19 13:59:53,484 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATION (13 of 105 remaining) [2021-11-19 13:59:53,484 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATION (12 of 105 remaining) [2021-11-19 13:59:53,484 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATION (11 of 105 remaining) [2021-11-19 13:59:53,484 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATION (10 of 105 remaining) [2021-11-19 13:59:53,484 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATION (9 of 105 remaining) [2021-11-19 13:59:53,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_FREE (8 of 105 remaining) [2021-11-19 13:59:53,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE (7 of 105 remaining) [2021-11-19 13:59:53,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE (6 of 105 remaining) [2021-11-19 13:59:53,485 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84REQUIRES_VIOLATION (5 of 105 remaining) [2021-11-19 13:59:53,486 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85REQUIRES_VIOLATION (4 of 105 remaining) [2021-11-19 13:59:53,486 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONMEMORY_FREE (3 of 105 remaining) [2021-11-19 13:59:53,486 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONMEMORY_FREE (2 of 105 remaining) [2021-11-19 13:59:53,486 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONMEMORY_FREE (1 of 105 remaining) [2021-11-19 13:59:53,486 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK (0 of 105 remaining) [2021-11-19 13:59:53,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-19 13:59:53,490 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-19 13:59:53,494 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-19 13:59:53,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:59:53 BoogieIcfgContainer [2021-11-19 13:59:53,526 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-19 13:59:53,527 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-19 13:59:53,527 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-19 13:59:53,527 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-19 13:59:53,528 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:59:44" (3/4) ... [2021-11-19 13:59:53,530 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-19 13:59:53,569 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9965c63-8c73-418b-bd50-0a4e809b579b/bin/utaipan-UbGMyvGFUs/witness.graphml [2021-11-19 13:59:53,569 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-19 13:59:53,570 INFO L158 Benchmark]: Toolchain (without parser) took 10746.87ms. Allocated memory was 81.8MB in the beginning and 174.1MB in the end (delta: 92.3MB). Free memory was 45.4MB in the beginning and 88.3MB in the end (delta: -42.9MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2021-11-19 13:59:53,571 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 81.8MB. Free memory was 51.6MB in the beginning and 51.6MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 13:59:53,571 INFO L158 Benchmark]: CACSL2BoogieTranslator took 556.01ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 45.2MB in the beginning and 66.2MB in the end (delta: -20.9MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2021-11-19 13:59:53,572 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.01ms. Allocated memory is still 98.6MB. Free memory was 66.2MB in the beginning and 63.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 13:59:53,572 INFO L158 Benchmark]: Boogie Preprocessor took 50.03ms. Allocated memory is still 98.6MB. Free memory was 63.5MB in the beginning and 60.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 13:59:53,572 INFO L158 Benchmark]: RCFGBuilder took 1062.90ms. Allocated memory is still 98.6MB. Free memory was 60.9MB in the beginning and 48.5MB in the end (delta: 12.3MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2021-11-19 13:59:53,573 INFO L158 Benchmark]: TraceAbstraction took 8953.37ms. Allocated memory was 98.6MB in the beginning and 174.1MB in the end (delta: 75.5MB). Free memory was 48.0MB in the beginning and 91.4MB in the end (delta: -43.4MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2021-11-19 13:59:53,573 INFO L158 Benchmark]: Witness Printer took 42.94ms. Allocated memory is still 174.1MB. Free memory was 91.4MB in the beginning and 88.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-19 13:59:53,575 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.34ms. Allocated memory is still 81.8MB. Free memory was 51.6MB in the beginning and 51.6MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 556.01ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 45.2MB in the beginning and 66.2MB in the end (delta: -20.9MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.01ms. Allocated memory is still 98.6MB. Free memory was 66.2MB in the beginning and 63.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.03ms. Allocated memory is still 98.6MB. Free memory was 63.5MB in the beginning and 60.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1062.90ms. Allocated memory is still 98.6MB. Free memory was 60.9MB in the beginning and 48.5MB in the end (delta: 12.3MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8953.37ms. Allocated memory was 98.6MB in the beginning and 174.1MB in the end (delta: 75.5MB). Free memory was 48.0MB in the beginning and 91.4MB in the end (delta: -43.4MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * Witness Printer took 42.94ms. Allocated memory is still 174.1MB. Free memory was 91.4MB in the beginning and 88.3MB in the end (delta: 3.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.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11160 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11142 mSDsluCounter, 9935 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6641 mSDsCounter, 263 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5933 IncrementalHoareTripleChecker+Invalid, 6196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 263 mSolverCounterUnsat, 3686 mSDtfsCounter, 5933 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=10, InterpolantAutomatonStates: 102, 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, 3667 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, 1752 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-19 13:59:53,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9965c63-8c73-418b-bd50-0a4e809b579b/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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)