./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4099afe4d4ae3c88800047494721799286636d7a ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 16:55:35,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 16:55:35,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 16:55:35,507 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 16:55:35,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 16:55:35,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 16:55:35,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 16:55:35,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 16:55:35,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 16:55:35,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 16:55:35,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 16:55:35,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 16:55:35,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 16:55:35,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 16:55:35,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 16:55:35,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 16:55:35,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 16:55:35,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 16:55:35,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 16:55:35,523 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 16:55:35,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 16:55:35,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 16:55:35,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 16:55:35,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 16:55:35,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 16:55:35,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 16:55:35,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 16:55:35,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 16:55:35,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 16:55:35,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 16:55:35,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 16:55:35,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 16:55:35,534 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 16:55:35,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 16:55:35,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 16:55:35,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 16:55:35,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 16:55:35,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 16:55:35,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 16:55:35,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 16:55:35,538 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 16:55:35,538 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2020-12-09 16:55:35,556 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 16:55:35,556 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 16:55:35,556 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 16:55:35,556 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 16:55:35,557 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 16:55:35,557 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 16:55:35,557 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 16:55:35,557 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 16:55:35,557 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 16:55:35,557 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 16:55:35,557 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 16:55:35,557 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 16:55:35,557 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 16:55:35,558 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 16:55:35,558 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 16:55:35,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 16:55:35,558 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 16:55:35,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 16:55:35,558 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 16:55:35,559 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 16:55:35,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 16:55:35,559 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 16:55:35,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 16:55:35,559 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 16:55:35,559 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 16:55:35,559 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 16:55:35,559 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 16:55:35,559 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 16:55:35,559 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 16:55:35,560 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 16:55:35,560 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 16:55:35,560 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 16:55:35,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 16:55:35,560 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 16:55:35,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 16:55:35,560 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 16:55:35,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 16:55:35,561 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 16:55:35,561 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 16:55:35,561 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-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/bin/utaipan/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-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/bin/utaipan 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4099afe4d4ae3c88800047494721799286636d7a [2020-12-09 16:55:35,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 16:55:35,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 16:55:35,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 16:55:35,762 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 16:55:35,763 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 16:55:35,764 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/bin/utaipan/../../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2020-12-09 16:55:35,804 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/bin/utaipan/data/925d7e787/a1f49c9284eb4e50a7d1f7a3862ab7cd/FLAG9b19a5732 [2020-12-09 16:55:36,156 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 16:55:36,157 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2020-12-09 16:55:36,162 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/bin/utaipan/data/925d7e787/a1f49c9284eb4e50a7d1f7a3862ab7cd/FLAG9b19a5732 [2020-12-09 16:55:36,581 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/bin/utaipan/data/925d7e787/a1f49c9284eb4e50a7d1f7a3862ab7cd [2020-12-09 16:55:36,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 16:55:36,584 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 16:55:36,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 16:55:36,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 16:55:36,588 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 16:55:36,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:55:36" (1/1) ... [2020-12-09 16:55:36,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73b053f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:36, skipping insertion in model container [2020-12-09 16:55:36,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:55:36" (1/1) ... [2020-12-09 16:55:36,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 16:55:36,608 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 16:55:36,700 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2020-12-09 16:55:36,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 16:55:36,725 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 16:55:36,734 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2020-12-09 16:55:36,742 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 16:55:36,755 INFO L208 MainTranslator]: Completed translation [2020-12-09 16:55:36,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:36 WrapperNode [2020-12-09 16:55:36,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 16:55:36,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 16:55:36,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 16:55:36,756 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 16:55:36,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:36" (1/1) ... [2020-12-09 16:55:36,768 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:36" (1/1) ... [2020-12-09 16:55:36,784 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 16:55:36,784 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 16:55:36,784 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 16:55:36,784 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 16:55:36,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:36" (1/1) ... [2020-12-09 16:55:36,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:36" (1/1) ... [2020-12-09 16:55:36,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:36" (1/1) ... [2020-12-09 16:55:36,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:36" (1/1) ... [2020-12-09 16:55:36,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:36" (1/1) ... [2020-12-09 16:55:36,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:36" (1/1) ... [2020-12-09 16:55:36,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:36" (1/1) ... [2020-12-09 16:55:36,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 16:55:36,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 16:55:36,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 16:55:36,803 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 16:55:36,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 16:55:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 16:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-12-09 16:55:36,857 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-12-09 16:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 16:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-09 16:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 16:55:36,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 16:55:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-09 16:55:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 16:55:37,249 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 16:55:37,249 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2020-12-09 16:55:37,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:55:37 BoogieIcfgContainer [2020-12-09 16:55:37,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 16:55:37,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 16:55:37,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 16:55:37,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 16:55:37,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:55:36" (1/3) ... [2020-12-09 16:55:37,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de12ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:55:37, skipping insertion in model container [2020-12-09 16:55:37,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:36" (2/3) ... [2020-12-09 16:55:37,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de12ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:55:37, skipping insertion in model container [2020-12-09 16:55:37,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:55:37" (3/3) ... [2020-12-09 16:55:37,257 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2020-12-09 16:55:37,267 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 16:55:37,270 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2020-12-09 16:55:37,277 INFO L253 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2020-12-09 16:55:37,291 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 16:55:37,291 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 16:55:37,291 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 16:55:37,291 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 16:55:37,291 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 16:55:37,291 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 16:55:37,291 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 16:55:37,291 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 16:55:37,304 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2020-12-09 16:55:37,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 16:55:37,309 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:55:37,310 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 16:55:37,310 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2020-12-09 16:55:37,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:55:37,314 INFO L82 PathProgramCache]: Analyzing trace with hash 150466673, now seen corresponding path program 1 times [2020-12-09 16:55:37,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:55:37,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902973957] [2020-12-09 16:55:37,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:55:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:55:37,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:55:37,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902973957] [2020-12-09 16:55:37,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:55:37,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 16:55:37,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037233101] [2020-12-09 16:55:37,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 16:55:37,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:55:37,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 16:55:37,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:55:37,502 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 5 states. [2020-12-09 16:55:37,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:55:37,601 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2020-12-09 16:55:37,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 16:55:37,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2020-12-09 16:55:37,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:55:37,611 INFO L225 Difference]: With dead ends: 75 [2020-12-09 16:55:37,612 INFO L226 Difference]: Without dead ends: 74 [2020-12-09 16:55:37,613 INFO L677 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 [2020-12-09 16:55:37,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-12-09 16:55:37,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 60. [2020-12-09 16:55:37,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-12-09 16:55:37,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2020-12-09 16:55:37,653 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 6 [2020-12-09 16:55:37,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:55:37,653 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2020-12-09 16:55:37,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 16:55:37,653 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2020-12-09 16:55:37,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 16:55:37,654 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:55:37,654 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:55:37,654 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 16:55:37,655 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2020-12-09 16:55:37,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:55:37,656 INFO L82 PathProgramCache]: Analyzing trace with hash 369505278, now seen corresponding path program 1 times [2020-12-09 16:55:37,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:55:37,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646400708] [2020-12-09 16:55:37,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:55:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:55:37,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:55:37,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646400708] [2020-12-09 16:55:37,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:55:37,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 16:55:37,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993155015] [2020-12-09 16:55:37,739 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 16:55:37,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:55:37,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 16:55:37,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:55:37,741 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 5 states. [2020-12-09 16:55:37,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:55:37,811 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2020-12-09 16:55:37,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 16:55:37,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2020-12-09 16:55:37,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:55:37,813 INFO L225 Difference]: With dead ends: 53 [2020-12-09 16:55:37,813 INFO L226 Difference]: Without dead ends: 53 [2020-12-09 16:55:37,814 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 16:55:37,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-12-09 16:55:37,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-12-09 16:55:37,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-12-09 16:55:37,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2020-12-09 16:55:37,822 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 7 [2020-12-09 16:55:37,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:55:37,822 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2020-12-09 16:55:37,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 16:55:37,822 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2020-12-09 16:55:37,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 16:55:37,823 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:55:37,823 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:55:37,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 16:55:37,823 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2020-12-09 16:55:37,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:55:37,824 INFO L82 PathProgramCache]: Analyzing trace with hash 369505279, now seen corresponding path program 1 times [2020-12-09 16:55:37,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:55:37,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254809246] [2020-12-09 16:55:37,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:55:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:55:37,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:55:37,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254809246] [2020-12-09 16:55:37,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:55:37,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 16:55:37,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848467134] [2020-12-09 16:55:37,928 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 16:55:37,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:55:37,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 16:55:37,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-09 16:55:37,930 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 6 states. [2020-12-09 16:55:38,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:55:38,051 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2020-12-09 16:55:38,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 16:55:38,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-12-09 16:55:38,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:55:38,052 INFO L225 Difference]: With dead ends: 59 [2020-12-09 16:55:38,052 INFO L226 Difference]: Without dead ends: 59 [2020-12-09 16:55:38,053 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-12-09 16:55:38,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-12-09 16:55:38,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2020-12-09 16:55:38,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-12-09 16:55:38,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2020-12-09 16:55:38,059 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 7 [2020-12-09 16:55:38,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:55:38,059 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2020-12-09 16:55:38,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 16:55:38,060 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2020-12-09 16:55:38,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 16:55:38,060 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:55:38,060 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:55:38,060 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 16:55:38,060 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2020-12-09 16:55:38,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:55:38,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1429953388, now seen corresponding path program 1 times [2020-12-09 16:55:38,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:55:38,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569765007] [2020-12-09 16:55:38,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:55:38,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:55:38,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:55:38,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569765007] [2020-12-09 16:55:38,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:55:38,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 16:55:38,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041532706] [2020-12-09 16:55:38,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:55:38,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:55:38,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:55:38,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:55:38,123 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 4 states. [2020-12-09 16:55:38,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:55:38,150 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2020-12-09 16:55:38,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:55:38,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-12-09 16:55:38,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:55:38,151 INFO L225 Difference]: With dead ends: 51 [2020-12-09 16:55:38,151 INFO L226 Difference]: Without dead ends: 51 [2020-12-09 16:55:38,151 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:55:38,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-12-09 16:55:38,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-12-09 16:55:38,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-12-09 16:55:38,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2020-12-09 16:55:38,155 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 8 [2020-12-09 16:55:38,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:55:38,156 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2020-12-09 16:55:38,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:55:38,156 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2020-12-09 16:55:38,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 16:55:38,156 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:55:38,156 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:55:38,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 16:55:38,157 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2020-12-09 16:55:38,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:55:38,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1430238228, now seen corresponding path program 1 times [2020-12-09 16:55:38,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:55:38,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507089747] [2020-12-09 16:55:38,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:55:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:55:38,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:55:38,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507089747] [2020-12-09 16:55:38,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:55:38,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 16:55:38,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203870635] [2020-12-09 16:55:38,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 16:55:38,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:55:38,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 16:55:38,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-09 16:55:38,236 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 7 states. [2020-12-09 16:55:38,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:55:38,346 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2020-12-09 16:55:38,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 16:55:38,346 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2020-12-09 16:55:38,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:55:38,347 INFO L225 Difference]: With dead ends: 57 [2020-12-09 16:55:38,347 INFO L226 Difference]: Without dead ends: 57 [2020-12-09 16:55:38,347 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-12-09 16:55:38,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-12-09 16:55:38,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2020-12-09 16:55:38,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-12-09 16:55:38,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2020-12-09 16:55:38,351 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 8 [2020-12-09 16:55:38,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:55:38,352 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2020-12-09 16:55:38,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 16:55:38,352 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2020-12-09 16:55:38,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 16:55:38,352 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:55:38,352 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:55:38,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 16:55:38,352 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2020-12-09 16:55:38,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:55:38,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1378879530, now seen corresponding path program 1 times [2020-12-09 16:55:38,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:55:38,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459439380] [2020-12-09 16:55:38,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:55:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:55:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:55:38,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459439380] [2020-12-09 16:55:38,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:55:38,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 16:55:38,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126583485] [2020-12-09 16:55:38,402 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 16:55:38,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:55:38,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 16:55:38,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-09 16:55:38,403 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 8 states. [2020-12-09 16:55:38,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:55:38,458 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2020-12-09 16:55:38,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 16:55:38,458 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2020-12-09 16:55:38,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:55:38,459 INFO L225 Difference]: With dead ends: 67 [2020-12-09 16:55:38,459 INFO L226 Difference]: Without dead ends: 67 [2020-12-09 16:55:38,459 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-09 16:55:38,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-12-09 16:55:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2020-12-09 16:55:38,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-09 16:55:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2020-12-09 16:55:38,463 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 9 [2020-12-09 16:55:38,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:55:38,463 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2020-12-09 16:55:38,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 16:55:38,464 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2020-12-09 16:55:38,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 16:55:38,464 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:55:38,464 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:55:38,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 16:55:38,464 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2020-12-09 16:55:38,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:55:38,465 INFO L82 PathProgramCache]: Analyzing trace with hash 2041743046, now seen corresponding path program 1 times [2020-12-09 16:55:38,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:55:38,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543122895] [2020-12-09 16:55:38,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:55:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:55:38,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:55:38,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543122895] [2020-12-09 16:55:38,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:55:38,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-09 16:55:38,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705892282] [2020-12-09 16:55:38,588 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 16:55:38,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:55:38,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 16:55:38,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-09 16:55:38,588 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 9 states. [2020-12-09 16:55:38,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:55:38,713 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2020-12-09 16:55:38,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 16:55:38,713 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2020-12-09 16:55:38,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:55:38,714 INFO L225 Difference]: With dead ends: 65 [2020-12-09 16:55:38,714 INFO L226 Difference]: Without dead ends: 65 [2020-12-09 16:55:38,714 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-12-09 16:55:38,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-12-09 16:55:38,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2020-12-09 16:55:38,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-12-09 16:55:38,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2020-12-09 16:55:38,720 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 11 [2020-12-09 16:55:38,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:55:38,720 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2020-12-09 16:55:38,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 16:55:38,720 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2020-12-09 16:55:38,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 16:55:38,721 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:55:38,721 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:55:38,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 16:55:38,721 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2020-12-09 16:55:38,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:55:38,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1130470945, now seen corresponding path program 1 times [2020-12-09 16:55:38,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:55:38,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68689158] [2020-12-09 16:55:38,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:55:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:55:38,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:55:38,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68689158] [2020-12-09 16:55:38,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:55:38,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 16:55:38,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948904763] [2020-12-09 16:55:38,746 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:55:38,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:55:38,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:55:38,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:55:38,747 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 3 states. [2020-12-09 16:55:38,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:55:38,755 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2020-12-09 16:55:38,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:55:38,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-12-09 16:55:38,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:55:38,756 INFO L225 Difference]: With dead ends: 56 [2020-12-09 16:55:38,756 INFO L226 Difference]: Without dead ends: 56 [2020-12-09 16:55:38,756 INFO L677 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 [2020-12-09 16:55:38,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-12-09 16:55:38,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-12-09 16:55:38,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-09 16:55:38,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2020-12-09 16:55:38,760 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 12 [2020-12-09 16:55:38,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:55:38,760 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2020-12-09 16:55:38,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:55:38,761 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2020-12-09 16:55:38,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 16:55:38,761 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:55:38,761 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:55:38,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 16:55:38,761 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2020-12-09 16:55:38,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:55:38,762 INFO L82 PathProgramCache]: Analyzing trace with hash -389197131, now seen corresponding path program 1 times [2020-12-09 16:55:38,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:55:38,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182745842] [2020-12-09 16:55:38,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:55:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:55:38,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:55:38,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182745842] [2020-12-09 16:55:38,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870727297] [2020-12-09 16:55:38,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:55:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:55:38,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 24 conjunts are in the unsatisfiable core [2020-12-09 16:55:38,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:55:38,985 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 16:55:38,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:55:38,988 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 16:55:38,988 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:55:39,002 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:55:39,007 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:55:39,010 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:55:39,023 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:55:39,027 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:55:39,031 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:55:39,043 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:55:39,048 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:55:39,050 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:55:39,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:55:39,061 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:55:39,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:55:39,069 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:55:39,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:55:39,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:55:39,104 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 16:55:39,106 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 16:55:39,108 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 16:55:39,113 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 16:55:39,115 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 16:55:39,117 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 16:55:39,124 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 16:55:39,125 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 16:55:39,146 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 16:55:39,146 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 16:55:39,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:55:39,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [214369323] [2020-12-09 16:55:39,166 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2020-12-09 16:55:39,166 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 16:55:39,170 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 16:55:39,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 16:55:39,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 6] total 12 [2020-12-09 16:55:39,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430967282] [2020-12-09 16:55:39,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 16:55:39,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:55:39,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 16:55:39,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-12-09 16:55:39,172 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 12 states. [2020-12-09 16:55:39,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:55:39,458 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2020-12-09 16:55:39,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 16:55:39,459 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2020-12-09 16:55:39,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:55:39,459 INFO L225 Difference]: With dead ends: 60 [2020-12-09 16:55:39,459 INFO L226 Difference]: Without dead ends: 60 [2020-12-09 16:55:39,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2020-12-09 16:55:39,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-12-09 16:55:39,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2020-12-09 16:55:39,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-12-09 16:55:39,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2020-12-09 16:55:39,463 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2020-12-09 16:55:39,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:55:39,464 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2020-12-09 16:55:39,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 16:55:39,464 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2020-12-09 16:55:39,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 16:55:39,464 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:55:39,464 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-12-09 16:55:39,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-12-09 16:55:39,665 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2020-12-09 16:55:39,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:55:39,665 INFO L82 PathProgramCache]: Analyzing trace with hash 819796539, now seen corresponding path program 1 times [2020-12-09 16:55:39,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:55:39,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37884412] [2020-12-09 16:55:39,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:55:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:55:39,762 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:55:39,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37884412] [2020-12-09 16:55:39,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797954534] [2020-12-09 16:55:39,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:55:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:55:39,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 44 conjunts are in the unsatisfiable core [2020-12-09 16:55:39,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:55:40,071 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:55:40,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:55:40,276 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:55:40,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2012971480] [2020-12-09 16:55:40,278 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 16:55:40,279 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 16:55:40,279 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 16:55:40,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 16:55:40,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 19 [2020-12-09 16:55:40,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670350106] [2020-12-09 16:55:40,280 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-09 16:55:40,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:55:40,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-09 16:55:40,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2020-12-09 16:55:40,281 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 21 states. [2020-12-09 16:55:41,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:55:41,022 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2020-12-09 16:55:41,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-09 16:55:41,022 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 14 [2020-12-09 16:55:41,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:55:41,023 INFO L225 Difference]: With dead ends: 59 [2020-12-09 16:55:41,023 INFO L226 Difference]: Without dead ends: 59 [2020-12-09 16:55:41,024 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=196, Invalid=734, Unknown=0, NotChecked=0, Total=930 [2020-12-09 16:55:41,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-12-09 16:55:41,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2020-12-09 16:55:41,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-12-09 16:55:41,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2020-12-09 16:55:41,027 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 14 [2020-12-09 16:55:41,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:55:41,027 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2020-12-09 16:55:41,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-12-09 16:55:41,027 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2020-12-09 16:55:41,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 16:55:41,028 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:55:41,028 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:55:41,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-09 16:55:41,230 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2020-12-09 16:55:41,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:55:41,232 INFO L82 PathProgramCache]: Analyzing trace with hash 244150050, now seen corresponding path program 1 times [2020-12-09 16:55:41,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:55:41,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66392285] [2020-12-09 16:55:41,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:55:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:55:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:55:41,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66392285] [2020-12-09 16:55:41,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:55:41,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 16:55:41,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77693996] [2020-12-09 16:55:41,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:55:41,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:55:41,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:55:41,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:55:41,315 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2020-12-09 16:55:41,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:55:41,345 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2020-12-09 16:55:41,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 16:55:41,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-12-09 16:55:41,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:55:41,346 INFO L225 Difference]: With dead ends: 52 [2020-12-09 16:55:41,346 INFO L226 Difference]: Without dead ends: 42 [2020-12-09 16:55:41,347 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:55:41,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-12-09 16:55:41,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-12-09 16:55:41,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-12-09 16:55:41,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2020-12-09 16:55:41,350 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 14 [2020-12-09 16:55:41,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:55:41,351 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2020-12-09 16:55:41,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:55:41,351 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-12-09 16:55:41,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 16:55:41,351 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:55:41,352 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:55:41,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 16:55:41,352 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2020-12-09 16:55:41,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:55:41,352 INFO L82 PathProgramCache]: Analyzing trace with hash -355822342, now seen corresponding path program 1 times [2020-12-09 16:55:41,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:55:41,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861421003] [2020-12-09 16:55:41,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:55:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:55:41,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:55:41,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861421003] [2020-12-09 16:55:41,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794386796] [2020-12-09 16:55:41,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:55:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:55:41,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-09 16:55:41,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:55:41,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:55:41,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:55:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:55:41,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [378815119] [2020-12-09 16:55:41,689 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2020-12-09 16:55:41,689 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 16:55:41,689 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 16:55:41,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 16:55:41,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2020-12-09 16:55:41,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853592126] [2020-12-09 16:55:41,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-09 16:55:41,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:55:41,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-09 16:55:41,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2020-12-09 16:55:41,690 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 15 states. [2020-12-09 16:55:41,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:55:41,896 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2020-12-09 16:55:41,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 16:55:41,897 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2020-12-09 16:55:41,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:55:41,897 INFO L225 Difference]: With dead ends: 47 [2020-12-09 16:55:41,897 INFO L226 Difference]: Without dead ends: 47 [2020-12-09 16:55:41,898 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2020-12-09 16:55:41,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-12-09 16:55:41,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2020-12-09 16:55:41,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-12-09 16:55:41,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2020-12-09 16:55:41,900 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 15 [2020-12-09 16:55:41,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:55:41,900 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2020-12-09 16:55:41,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-09 16:55:41,900 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2020-12-09 16:55:41,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 16:55:41,901 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:55:41,901 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-12-09 16:55:42,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-12-09 16:55:42,102 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2020-12-09 16:55:42,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:55:42,104 INFO L82 PathProgramCache]: Analyzing trace with hash -356111056, now seen corresponding path program 1 times [2020-12-09 16:55:42,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:55:42,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677738852] [2020-12-09 16:55:42,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:55:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:55:42,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:55:42,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677738852] [2020-12-09 16:55:42,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772212455] [2020-12-09 16:55:42,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:55:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:55:42,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 36 conjunts are in the unsatisfiable core [2020-12-09 16:55:42,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:55:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 16:55:42,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:55:42,593 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 16:55:42,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [289986137] [2020-12-09 16:55:42,595 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 16:55:42,595 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 16:55:42,596 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 16:55:42,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 16:55:42,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2020-12-09 16:55:42,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141820785] [2020-12-09 16:55:42,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-09 16:55:42,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:55:42,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-09 16:55:42,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2020-12-09 16:55:42,597 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 18 states. [2020-12-09 16:55:43,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:55:43,364 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2020-12-09 16:55:43,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-09 16:55:43,364 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2020-12-09 16:55:43,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:55:43,365 INFO L225 Difference]: With dead ends: 46 [2020-12-09 16:55:43,365 INFO L226 Difference]: Without dead ends: 46 [2020-12-09 16:55:43,366 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2020-12-09 16:55:43,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-12-09 16:55:43,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2020-12-09 16:55:43,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-12-09 16:55:43,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2020-12-09 16:55:43,369 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 15 [2020-12-09 16:55:43,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:55:43,369 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2020-12-09 16:55:43,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-09 16:55:43,370 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2020-12-09 16:55:43,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 16:55:43,370 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:55:43,370 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:55:43,571 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:55:43,572 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2020-12-09 16:55:43,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:55:43,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1854410087, now seen corresponding path program 1 times [2020-12-09 16:55:43,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:55:43,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117662818] [2020-12-09 16:55:43,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:55:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:55:43,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:55:43,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117662818] [2020-12-09 16:55:43,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904846218] [2020-12-09 16:55:43,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:55:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:55:43,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 16:55:43,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:55:43,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:55:43,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:55:44,129 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-12-09 16:55:44,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:55:44,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1578604053] [2020-12-09 16:55:44,215 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 16:55:44,215 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 16:55:44,215 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 16:55:44,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 16:55:44,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2020-12-09 16:55:44,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650011457] [2020-12-09 16:55:44,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-12-09 16:55:44,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:55:44,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-12-09 16:55:44,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2020-12-09 16:55:44,217 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 29 states. [2020-12-09 16:55:45,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:55:45,135 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2020-12-09 16:55:45,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-09 16:55:45,136 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 16 [2020-12-09 16:55:45,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:55:45,136 INFO L225 Difference]: With dead ends: 59 [2020-12-09 16:55:45,136 INFO L226 Difference]: Without dead ends: 59 [2020-12-09 16:55:45,137 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=326, Invalid=1744, Unknown=0, NotChecked=0, Total=2070 [2020-12-09 16:55:45,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-12-09 16:55:45,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2020-12-09 16:55:45,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-12-09 16:55:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2020-12-09 16:55:45,140 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 16 [2020-12-09 16:55:45,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:55:45,140 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2020-12-09 16:55:45,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-12-09 16:55:45,140 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2020-12-09 16:55:45,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 16:55:45,140 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:55:45,141 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:55:45,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-09 16:55:45,341 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2020-12-09 16:55:45,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:55:45,342 INFO L82 PathProgramCache]: Analyzing trace with hash -323312068, now seen corresponding path program 1 times [2020-12-09 16:55:45,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:55:45,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290995644] [2020-12-09 16:55:45,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:55:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:55:45,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:55:45,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290995644] [2020-12-09 16:55:45,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198545093] [2020-12-09 16:55:45,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:55:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:55:45,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 28 conjunts are in the unsatisfiable core [2020-12-09 16:55:45,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:55:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:55:49,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:56:16,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:56:16,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [86899040] [2020-12-09 16:56:16,305 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2020-12-09 16:56:16,305 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 16:56:16,305 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 16:56:16,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 16:56:16,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 20 [2020-12-09 16:56:16,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112733336] [2020-12-09 16:56:16,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-09 16:56:16,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:56:16,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-09 16:56:16,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=293, Unknown=14, NotChecked=0, Total=380 [2020-12-09 16:56:16,307 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 20 states. [2020-12-09 16:56:16,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:56:16,464 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2020-12-09 16:56:16,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 16:56:16,465 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 18 [2020-12-09 16:56:16,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:56:16,465 INFO L225 Difference]: With dead ends: 47 [2020-12-09 16:56:16,465 INFO L226 Difference]: Without dead ends: 47 [2020-12-09 16:56:16,465 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 30.8s TimeCoverageRelationStatistics Valid=121, Invalid=371, Unknown=14, NotChecked=0, Total=506 [2020-12-09 16:56:16,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-12-09 16:56:16,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-12-09 16:56:16,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-12-09 16:56:16,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2020-12-09 16:56:16,467 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 18 [2020-12-09 16:56:16,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:56:16,468 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-12-09 16:56:16,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-12-09 16:56:16,468 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-12-09 16:56:16,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 16:56:16,468 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:56:16,468 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:56:16,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:56:16,670 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2020-12-09 16:56:16,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:56:16,671 INFO L82 PathProgramCache]: Analyzing trace with hash 191201078, now seen corresponding path program 2 times [2020-12-09 16:56:16,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:56:16,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614115719] [2020-12-09 16:56:16,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:56:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:56:16,770 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:56:16,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614115719] [2020-12-09 16:56:16,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155753374] [2020-12-09 16:56:16,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:56:16,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-09 16:56:16,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 16:56:16,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 38 conjunts are in the unsatisfiable core [2020-12-09 16:56:16,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:56:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 16:56:17,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:56:17,252 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:56:17,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [672342464] [2020-12-09 16:56:17,254 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2020-12-09 16:56:17,254 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 16:56:17,254 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 16:56:17,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 16:56:17,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 16 [2020-12-09 16:56:17,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132602039] [2020-12-09 16:56:17,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 16:56:17,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:56:17,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 16:56:17,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2020-12-09 16:56:17,256 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 17 states. [2020-12-09 16:56:17,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:56:17,551 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2020-12-09 16:56:17,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 16:56:17,551 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2020-12-09 16:56:17,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:56:17,552 INFO L225 Difference]: With dead ends: 47 [2020-12-09 16:56:17,552 INFO L226 Difference]: Without dead ends: 47 [2020-12-09 16:56:17,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2020-12-09 16:56:17,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-12-09 16:56:17,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2020-12-09 16:56:17,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-12-09 16:56:17,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2020-12-09 16:56:17,554 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 22 [2020-12-09 16:56:17,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:56:17,555 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2020-12-09 16:56:17,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 16:56:17,555 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2020-12-09 16:56:17,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 16:56:17,555 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:56:17,556 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:56:17,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-09 16:56:17,757 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2020-12-09 16:56:17,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:56:17,759 INFO L82 PathProgramCache]: Analyzing trace with hash -2078122104, now seen corresponding path program 1 times [2020-12-09 16:56:17,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:56:17,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310106974] [2020-12-09 16:56:17,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:56:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:56:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:56:17,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310106974] [2020-12-09 16:56:17,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723294329] [2020-12-09 16:56:17,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:56:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:56:18,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 21 conjunts are in the unsatisfiable core [2020-12-09 16:56:18,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:56:18,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:56:18,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:56:18,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:56:18,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [547795122] [2020-12-09 16:56:18,258 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2020-12-09 16:56:18,258 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 16:56:18,258 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 16:56:18,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 16:56:18,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 18 [2020-12-09 16:56:18,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464280201] [2020-12-09 16:56:18,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-09 16:56:18,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:56:18,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-09 16:56:18,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2020-12-09 16:56:18,260 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 19 states. [2020-12-09 16:56:18,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:56:18,765 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2020-12-09 16:56:18,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-09 16:56:18,765 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2020-12-09 16:56:18,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:56:18,766 INFO L225 Difference]: With dead ends: 53 [2020-12-09 16:56:18,766 INFO L226 Difference]: Without dead ends: 53 [2020-12-09 16:56:18,766 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2020-12-09 16:56:18,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-12-09 16:56:18,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2020-12-09 16:56:18,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-12-09 16:56:18,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2020-12-09 16:56:18,769 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 23 [2020-12-09 16:56:18,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:56:18,769 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2020-12-09 16:56:18,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-09 16:56:18,769 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2020-12-09 16:56:18,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 16:56:18,770 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:56:18,770 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:56:18,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-09 16:56:18,971 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2020-12-09 16:56:18,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:56:18,972 INFO L82 PathProgramCache]: Analyzing trace with hash 84527608, now seen corresponding path program 1 times [2020-12-09 16:56:18,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:56:18,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457022176] [2020-12-09 16:56:18,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:56:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:56:19,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:56:19,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457022176] [2020-12-09 16:56:19,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662912119] [2020-12-09 16:56:19,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:56:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:56:19,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 24 conjunts are in the unsatisfiable core [2020-12-09 16:56:19,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:56:27,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 16:56:27,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:56:36,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 16:56:36,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 16:56:36,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14, 7] total 22 [2020-12-09 16:56:36,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148617018] [2020-12-09 16:56:36,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 16:56:36,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:56:36,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 16:56:36,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=391, Unknown=7, NotChecked=0, Total=462 [2020-12-09 16:56:36,673 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 5 states. [2020-12-09 16:56:56,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:56:56,819 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2020-12-09 16:56:56,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 16:56:56,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-12-09 16:56:56,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:56:56,820 INFO L225 Difference]: With dead ends: 43 [2020-12-09 16:56:56,820 INFO L226 Difference]: Without dead ends: 32 [2020-12-09 16:56:56,820 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 35.6s TimeCoverageRelationStatistics Valid=75, Invalid=463, Unknown=14, NotChecked=0, Total=552 [2020-12-09 16:56:56,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-12-09 16:56:56,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-12-09 16:56:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-12-09 16:56:56,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-12-09 16:56:56,822 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 25 [2020-12-09 16:56:56,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:56:56,822 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-12-09 16:56:56,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 16:56:56,822 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-12-09 16:56:56,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-09 16:56:56,823 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:56:56,823 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:56:57,023 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-09 16:56:57,025 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, checkErr2REQUIRES_VIOLATION, checkErr0ASSERT_VIOLATIONMEMORY_LEAK, checkErr8REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr9ASSERT_VIOLATIONMEMORY_LEAK, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2020-12-09 16:56:57,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:56:57,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1203823591, now seen corresponding path program 1 times [2020-12-09 16:56:57,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:56:57,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134939700] [2020-12-09 16:56:57,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:56:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:56:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:56:57,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134939700] [2020-12-09 16:56:57,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940451033] [2020-12-09 16:56:57,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:56:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:56:57,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 33 conjunts are in the unsatisfiable core [2020-12-09 16:56:57,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:57:04,282 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:57:04,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:57:04,566 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 16:57:04,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1973922293] [2020-12-09 16:57:04,567 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2020-12-09 16:57:04,567 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 16:57:04,568 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 16:57:04,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 16:57:04,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 6] total 32 [2020-12-09 16:57:04,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994281264] [2020-12-09 16:57:04,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-12-09 16:57:04,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:57:04,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-12-09 16:57:04,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=973, Unknown=3, NotChecked=0, Total=1056 [2020-12-09 16:57:04,569 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 33 states. [2020-12-09 16:57:08,314 WARN L197 SmtUtils]: Spent 3.68 s on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2020-12-09 16:57:12,396 WARN L197 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2020-12-09 16:57:28,593 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2020-12-09 16:57:28,770 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2020-12-09 16:57:29,010 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2020-12-09 16:57:29,303 WARN L197 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 84 [2020-12-09 16:57:29,493 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 59 [2020-12-09 16:57:31,558 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 59 [2020-12-09 16:57:33,856 WARN L197 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2020-12-09 16:57:33,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:57:33,916 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-12-09 16:57:33,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-09 16:57:33,916 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 30 [2020-12-09 16:57:33,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:57:33,917 INFO L225 Difference]: With dead ends: 31 [2020-12-09 16:57:33,917 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 16:57:33,918 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 34.0s TimeCoverageRelationStatistics Valid=298, Invalid=2240, Unknown=12, NotChecked=0, Total=2550 [2020-12-09 16:57:33,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 16:57:33,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 16:57:33,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 16:57:33,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 16:57:33,918 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2020-12-09 16:57:33,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:57:33,918 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 16:57:33,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-12-09 16:57:33,919 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 16:57:33,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 16:57:34,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:57:34,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:57:34 BoogieIcfgContainer [2020-12-09 16:57:34,126 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 16:57:34,127 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 16:57:34,127 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 16:57:34,127 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 16:57:34,127 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:55:37" (3/4) ... [2020-12-09 16:57:34,129 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 16:57:34,133 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2020-12-09 16:57:34,136 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2020-12-09 16:57:34,137 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2020-12-09 16:57:34,137 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-12-09 16:57:34,137 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 16:57:34,164 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d5e41d60-e4e6-46a1-a14b-3696dbf37bb4/bin/utaipan/witness.graphml [2020-12-09 16:57:34,164 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 16:57:34,165 INFO L168 Benchmark]: Toolchain (without parser) took 117580.52 ms. Allocated memory was 92.3 MB in the beginning and 134.2 MB in the end (delta: 41.9 MB). Free memory was 52.0 MB in the beginning and 43.8 MB in the end (delta: 8.2 MB). Peak memory consumption was 51.6 MB. Max. memory is 16.1 GB. [2020-12-09 16:57:34,165 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 92.3 MB. Free memory is still 68.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 16:57:34,165 INFO L168 Benchmark]: CACSL2BoogieTranslator took 170.54 ms. Allocated memory is still 92.3 MB. Free memory was 51.7 MB in the beginning and 65.7 MB in the end (delta: -13.9 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.1 GB. [2020-12-09 16:57:34,165 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.44 ms. Allocated memory is still 92.3 MB. Free memory was 65.7 MB in the beginning and 63.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 16:57:34,166 INFO L168 Benchmark]: Boogie Preprocessor took 18.16 ms. Allocated memory is still 92.3 MB. Free memory was 63.9 MB in the beginning and 62.6 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 16:57:34,166 INFO L168 Benchmark]: RCFGBuilder took 448.28 ms. Allocated memory is still 92.3 MB. Free memory was 62.4 MB in the beginning and 41.5 MB in the end (delta: 20.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-12-09 16:57:34,166 INFO L168 Benchmark]: TraceAbstraction took 116873.99 ms. Allocated memory was 92.3 MB in the beginning and 134.2 MB in the end (delta: 41.9 MB). Free memory was 41.1 MB in the beginning and 47.8 MB in the end (delta: -6.7 MB). Peak memory consumption was 36.5 MB. Max. memory is 16.1 GB. [2020-12-09 16:57:34,166 INFO L168 Benchmark]: Witness Printer took 37.37 ms. Allocated memory is still 134.2 MB. Free memory was 47.8 MB in the beginning and 43.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 16:57:34,168 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.12 ms. Allocated memory is still 92.3 MB. Free memory is still 68.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 170.54 ms. Allocated memory is still 92.3 MB. Free memory was 51.7 MB in the beginning and 65.7 MB in the end (delta: -13.9 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 27.44 ms. Allocated memory is still 92.3 MB. Free memory was 65.7 MB in the beginning and 63.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 18.16 ms. Allocated memory is still 92.3 MB. Free memory was 63.9 MB in the beginning and 62.6 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 448.28 ms. Allocated memory is still 92.3 MB. Free memory was 62.4 MB in the beginning and 41.5 MB in the end (delta: 20.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 116873.99 ms. Allocated memory was 92.3 MB in the beginning and 134.2 MB in the end (delta: 41.9 MB). Free memory was 41.1 MB in the beginning and 47.8 MB in the end (delta: -6.7 MB). Peak memory consumption was 36.5 MB. Max. memory is 16.1 GB. * Witness Printer took 37.37 ms. Allocated memory is still 134.2 MB. Free memory was 47.8 MB in the beginning and 43.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 48]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 40]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 49]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 49]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 19 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 116.8s, OverallIterations: 19, TraceHistogramMax: 3, AutomataDifference: 54.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 409 SDtfs, 1596 SDslu, 1473 SDs, 0 SdLazy, 2724 SolverSat, 274 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 618 GetRequests, 278 SyntacticMatches, 16 SemanticMatches, 324 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1179 ImplicationChecksByTransitivity, 105.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 87 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 59.5s InterpolantComputationTime, 464 NumberOfCodeBlocks, 464 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 616 ConstructedInterpolants, 72 QuantifiedInterpolants, 200980 SizeOfPredicates, 169 NumberOfNonLiveVariables, 1769 ConjunctsInSsa, 285 ConjunctsInUnsatCore, 39 InterpolantComputations, 10 PerfectInterpolantSequences, 49/165 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 correct! Received shutdown request...