./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/verifythis/elimination_max_rec.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_f07f9228-4d55-4511-8097-a2504e479697/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_f07f9228-4d55-4511-8097-a2504e479697/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f07f9228-4d55-4511-8097-a2504e479697/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f07f9228-4d55-4511-8097-a2504e479697/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/verifythis/elimination_max_rec.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f07f9228-4d55-4511-8097-a2504e479697/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f07f9228-4d55-4511-8097-a2504e479697/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 7862960b0aa057ac19174563f251d134d1269c2b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 05:53:10,958 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 05:53:10,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 05:53:10,982 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 05:53:10,983 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 05:53:10,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 05:53:10,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 05:53:10,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 05:53:10,999 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 05:53:11,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 05:53:11,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 05:53:11,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 05:53:11,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 05:53:11,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 05:53:11,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 05:53:11,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 05:53:11,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 05:53:11,007 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 05:53:11,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 05:53:11,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 05:53:11,012 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 05:53:11,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 05:53:11,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 05:53:11,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 05:53:11,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 05:53:11,018 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 05:53:11,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 05:53:11,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 05:53:11,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 05:53:11,020 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 05:53:11,020 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 05:53:11,021 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 05:53:11,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 05:53:11,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 05:53:11,023 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 05:53:11,023 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 05:53:11,024 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 05:53:11,024 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 05:53:11,024 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 05:53:11,025 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 05:53:11,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 05:53:11,026 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f07f9228-4d55-4511-8097-a2504e479697/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2020-12-09 05:53:11,045 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 05:53:11,045 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 05:53:11,046 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 05:53:11,046 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 05:53:11,046 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 05:53:11,046 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 05:53:11,046 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 05:53:11,046 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 05:53:11,046 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 05:53:11,047 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 05:53:11,047 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 05:53:11,047 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 05:53:11,047 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 05:53:11,047 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 05:53:11,047 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 05:53:11,048 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 05:53:11,048 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 05:53:11,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 05:53:11,048 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 05:53:11,048 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 05:53:11,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 05:53:11,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 05:53:11,049 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 05:53:11,049 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 05:53:11,049 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 05:53:11,049 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 05:53:11,049 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 05:53:11,049 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 05:53:11,049 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 05:53:11,049 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 05:53:11,050 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 05:53:11,050 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 05:53:11,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 05:53:11,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 05:53:11,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 05:53:11,050 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 05:53:11,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 05:53:11,050 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 05:53:11,051 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 05:53:11,051 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_f07f9228-4d55-4511-8097-a2504e479697/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_f07f9228-4d55-4511-8097-a2504e479697/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 -> 7862960b0aa057ac19174563f251d134d1269c2b [2020-12-09 05:53:11,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 05:53:11,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 05:53:11,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 05:53:11,266 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 05:53:11,267 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 05:53:11,268 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f07f9228-4d55-4511-8097-a2504e479697/bin/utaipan/../../sv-benchmarks/c/verifythis/elimination_max_rec.c [2020-12-09 05:53:11,314 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f07f9228-4d55-4511-8097-a2504e479697/bin/utaipan/data/e12c38174/bc20676bbeed43949e0d96e99eed4ae8/FLAG9143c7a7b [2020-12-09 05:53:11,675 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 05:53:11,675 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f07f9228-4d55-4511-8097-a2504e479697/sv-benchmarks/c/verifythis/elimination_max_rec.c [2020-12-09 05:53:11,680 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f07f9228-4d55-4511-8097-a2504e479697/bin/utaipan/data/e12c38174/bc20676bbeed43949e0d96e99eed4ae8/FLAG9143c7a7b [2020-12-09 05:53:11,689 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f07f9228-4d55-4511-8097-a2504e479697/bin/utaipan/data/e12c38174/bc20676bbeed43949e0d96e99eed4ae8 [2020-12-09 05:53:11,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 05:53:11,692 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 05:53:11,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 05:53:11,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 05:53:11,695 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 05:53:11,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:53:11" (1/1) ... [2020-12-09 05:53:11,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4336a96c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:53:11, skipping insertion in model container [2020-12-09 05:53:11,697 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:53:11" (1/1) ... [2020-12-09 05:53:11,703 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 05:53:11,713 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 05:53:11,804 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_f07f9228-4d55-4511-8097-a2504e479697/sv-benchmarks/c/verifythis/elimination_max_rec.c[493,506] [2020-12-09 05:53:11,815 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 05:53:11,825 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 05:53:11,834 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_f07f9228-4d55-4511-8097-a2504e479697/sv-benchmarks/c/verifythis/elimination_max_rec.c[493,506] [2020-12-09 05:53:11,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 05:53:11,851 INFO L208 MainTranslator]: Completed translation [2020-12-09 05:53:11,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:53:11 WrapperNode [2020-12-09 05:53:11,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 05:53:11,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 05:53:11,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 05:53:11,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 05:53:11,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:53:11" (1/1) ... [2020-12-09 05:53:11,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:53:11" (1/1) ... [2020-12-09 05:53:11,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 05:53:11,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 05:53:11,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 05:53:11,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 05:53:11,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:53:11" (1/1) ... [2020-12-09 05:53:11,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:53:11" (1/1) ... [2020-12-09 05:53:11,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:53:11" (1/1) ... [2020-12-09 05:53:11,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:53:11" (1/1) ... [2020-12-09 05:53:11,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:53:11" (1/1) ... [2020-12-09 05:53:11,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:53:11" (1/1) ... [2020-12-09 05:53:11,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:53:11" (1/1) ... [2020-12-09 05:53:11,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 05:53:11,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 05:53:11,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 05:53:11,897 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 05:53:11,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:53:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f07f9228-4d55-4511-8097-a2504e479697/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 05:53:11,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 05:53:11,959 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-12-09 05:53:11,959 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-12-09 05:53:11,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 05:53:11,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-09 05:53:11,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 05:53:11,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 05:53:11,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-09 05:53:11,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 05:53:12,269 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 05:53:12,270 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2020-12-09 05:53:12,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:53:12 BoogieIcfgContainer [2020-12-09 05:53:12,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 05:53:12,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 05:53:12,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 05:53:12,275 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 05:53:12,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:53:11" (1/3) ... [2020-12-09 05:53:12,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bcfb33b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:53:12, skipping insertion in model container [2020-12-09 05:53:12,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:53:11" (2/3) ... [2020-12-09 05:53:12,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bcfb33b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:53:12, skipping insertion in model container [2020-12-09 05:53:12,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:53:12" (3/3) ... [2020-12-09 05:53:12,278 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2020-12-09 05:53:12,288 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 05:53:12,291 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2020-12-09 05:53:12,302 INFO L253 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-12-09 05:53:12,320 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 05:53:12,320 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 05:53:12,320 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 05:53:12,321 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 05:53:12,321 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 05:53:12,321 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 05:53:12,321 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 05:53:12,321 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 05:53:12,334 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-12-09 05:53:12,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 05:53:12,341 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:53:12,342 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 05:53:12,342 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, 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 05:53:12,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:53:12,347 INFO L82 PathProgramCache]: Analyzing trace with hash -731280393, now seen corresponding path program 1 times [2020-12-09 05:53:12,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:53:12,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574270912] [2020-12-09 05:53:12,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:53:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:53:12,546 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 05:53:12,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574270912] [2020-12-09 05:53:12,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:53:12,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 05:53:12,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040131634] [2020-12-09 05:53:12,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 05:53:12,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:53:12,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 05:53:12,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:53:12,566 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 5 states. [2020-12-09 05:53:12,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:53:12,662 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2020-12-09 05:53:12,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 05:53:12,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2020-12-09 05:53:12,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:53:12,669 INFO L225 Difference]: With dead ends: 66 [2020-12-09 05:53:12,669 INFO L226 Difference]: Without dead ends: 65 [2020-12-09 05:53:12,671 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 05:53:12,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-12-09 05:53:12,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2020-12-09 05:53:12,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-12-09 05:53:12,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2020-12-09 05:53:12,703 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 6 [2020-12-09 05:53:12,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:53:12,704 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2020-12-09 05:53:12,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 05:53:12,704 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2020-12-09 05:53:12,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 05:53:12,705 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:53:12,705 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:53:12,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 05:53:12,705 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, 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 05:53:12,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:53:12,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1194851665, now seen corresponding path program 1 times [2020-12-09 05:53:12,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:53:12,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581440447] [2020-12-09 05:53:12,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:53:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:53:12,759 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 05:53:12,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581440447] [2020-12-09 05:53:12,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:53:12,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:53:12,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738146949] [2020-12-09 05:53:12,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 05:53:12,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:53:12,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 05:53:12,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:53:12,762 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand 5 states. [2020-12-09 05:53:12,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:53:12,814 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2020-12-09 05:53:12,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:53:12,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2020-12-09 05:53:12,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:53:12,816 INFO L225 Difference]: With dead ends: 46 [2020-12-09 05:53:12,816 INFO L226 Difference]: Without dead ends: 46 [2020-12-09 05:53:12,816 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 05:53:12,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-12-09 05:53:12,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-12-09 05:53:12,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-12-09 05:53:12,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2020-12-09 05:53:12,821 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 7 [2020-12-09 05:53:12,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:53:12,821 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2020-12-09 05:53:12,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 05:53:12,822 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2020-12-09 05:53:12,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 05:53:12,822 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:53:12,822 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:53:12,822 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 05:53:12,823 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, 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 05:53:12,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:53:12,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1194851664, now seen corresponding path program 1 times [2020-12-09 05:53:12,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:53:12,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288464856] [2020-12-09 05:53:12,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:53:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:53:12,895 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 05:53:12,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288464856] [2020-12-09 05:53:12,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:53:12,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 05:53:12,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429372548] [2020-12-09 05:53:12,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 05:53:12,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:53:12,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 05:53:12,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-09 05:53:12,898 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 6 states. [2020-12-09 05:53:13,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:53:13,007 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-12-09 05:53:13,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 05:53:13,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-12-09 05:53:13,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:53:13,009 INFO L225 Difference]: With dead ends: 52 [2020-12-09 05:53:13,009 INFO L226 Difference]: Without dead ends: 52 [2020-12-09 05:53:13,009 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 05:53:13,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-12-09 05:53:13,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2020-12-09 05:53:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-12-09 05:53:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2020-12-09 05:53:13,016 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 7 [2020-12-09 05:53:13,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:53:13,016 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2020-12-09 05:53:13,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 05:53:13,016 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2020-12-09 05:53:13,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 05:53:13,017 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:53:13,017 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:53:13,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 05:53:13,017 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, 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 05:53:13,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:53:13,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1614304061, now seen corresponding path program 1 times [2020-12-09 05:53:13,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:53:13,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858181735] [2020-12-09 05:53:13,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:53:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:53:13,091 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 05:53:13,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858181735] [2020-12-09 05:53:13,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:53:13,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 05:53:13,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109926450] [2020-12-09 05:53:13,092 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 05:53:13,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:53:13,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 05:53:13,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-09 05:53:13,093 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 7 states. [2020-12-09 05:53:13,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:53:13,192 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2020-12-09 05:53:13,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 05:53:13,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2020-12-09 05:53:13,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:53:13,194 INFO L225 Difference]: With dead ends: 51 [2020-12-09 05:53:13,194 INFO L226 Difference]: Without dead ends: 51 [2020-12-09 05:53:13,194 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 05:53:13,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-12-09 05:53:13,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2020-12-09 05:53:13,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-12-09 05:53:13,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2020-12-09 05:53:13,200 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 8 [2020-12-09 05:53:13,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:53:13,200 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2020-12-09 05:53:13,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 05:53:13,200 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2020-12-09 05:53:13,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 05:53:13,201 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:53:13,201 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:53:13,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 05:53:13,202 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, 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 05:53:13,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:53:13,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1486703209, now seen corresponding path program 1 times [2020-12-09 05:53:13,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:53:13,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152584217] [2020-12-09 05:53:13,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:53:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:53:13,230 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 05:53:13,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152584217] [2020-12-09 05:53:13,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:53:13,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 05:53:13,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881900817] [2020-12-09 05:53:13,231 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:53:13,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:53:13,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:53:13,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:53:13,232 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 3 states. [2020-12-09 05:53:13,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:53:13,239 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2020-12-09 05:53:13,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:53:13,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-12-09 05:53:13,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:53:13,240 INFO L225 Difference]: With dead ends: 44 [2020-12-09 05:53:13,240 INFO L226 Difference]: Without dead ends: 44 [2020-12-09 05:53:13,240 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 05:53:13,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-12-09 05:53:13,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-12-09 05:53:13,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-12-09 05:53:13,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2020-12-09 05:53:13,245 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 9 [2020-12-09 05:53:13,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:53:13,245 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2020-12-09 05:53:13,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:53:13,246 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2020-12-09 05:53:13,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 05:53:13,246 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:53:13,246 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:53:13,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 05:53:13,247 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, 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 05:53:13,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:53:13,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1502327290, now seen corresponding path program 1 times [2020-12-09 05:53:13,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:53:13,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845498825] [2020-12-09 05:53:13,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:53:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:53:13,306 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 05:53:13,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845498825] [2020-12-09 05:53:13,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:53:13,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:53:13,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942081914] [2020-12-09 05:53:13,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:53:13,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:53:13,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:53:13,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:53:13,308 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 4 states. [2020-12-09 05:53:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:53:13,335 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2020-12-09 05:53:13,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:53:13,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-09 05:53:13,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:53:13,336 INFO L225 Difference]: With dead ends: 43 [2020-12-09 05:53:13,336 INFO L226 Difference]: Without dead ends: 35 [2020-12-09 05:53:13,337 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 05:53:13,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-12-09 05:53:13,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-12-09 05:53:13,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-12-09 05:53:13,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-12-09 05:53:13,339 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 11 [2020-12-09 05:53:13,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:53:13,339 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-12-09 05:53:13,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:53:13,340 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-12-09 05:53:13,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 05:53:13,340 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:53:13,340 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:53:13,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 05:53:13,340 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, 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 05:53:13,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:53:13,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1580973577, now seen corresponding path program 1 times [2020-12-09 05:53:13,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:53:13,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489457427] [2020-12-09 05:53:13,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:53:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:53:13,448 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 05:53:13,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489457427] [2020-12-09 05:53:13,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845730264] [2020-12-09 05:53:13,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f07f9228-4d55-4511-8097-a2504e479697/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 05:53:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:53:13,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 24 conjunts are in the unsatisfiable core [2020-12-09 05:53:13,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:53:13,649 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 05:53:13,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:53:13,652 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-09 05:53:13,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:53:13,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:53:13,694 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:53:13,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:53:13,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:53:13,728 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:53:13,731 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:53:13,740 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:53:13,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:53:13,745 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:53:13,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:53:13,755 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:53:13,756 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:53:13,759 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:53:13,770 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 05:53:13,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:53:13,789 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:53:13,791 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:53:13,792 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:53:13,797 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:53:13,799 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:53:13,800 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:53:13,808 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 05:53:13,808 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:53:13,837 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 05:53:13,837 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:53:13,841 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 05:53:13,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [963401775] [2020-12-09 05:53:13,855 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2020-12-09 05:53:13,856 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:53:13,859 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 05:53:13,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:53:13,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 16 [2020-12-09 05:53:13,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331505654] [2020-12-09 05:53:13,861 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-09 05:53:13,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:53:13,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-09 05:53:13,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2020-12-09 05:53:13,862 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 16 states. [2020-12-09 05:53:14,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:53:14,130 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-12-09 05:53:14,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-09 05:53:14,130 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2020-12-09 05:53:14,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:53:14,131 INFO L225 Difference]: With dead ends: 39 [2020-12-09 05:53:14,131 INFO L226 Difference]: Without dead ends: 39 [2020-12-09 05:53:14,131 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2020-12-09 05:53:14,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-12-09 05:53:14,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2020-12-09 05:53:14,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-12-09 05:53:14,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-12-09 05:53:14,134 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 13 [2020-12-09 05:53:14,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:53:14,134 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-12-09 05:53:14,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-09 05:53:14,134 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-12-09 05:53:14,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 05:53:14,135 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:53:14,135 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-12-09 05:53:14,336 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-09 05:53:14,336 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, 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 05:53:14,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:53:14,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1765544670, now seen corresponding path program 1 times [2020-12-09 05:53:14,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:53:14,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318824439] [2020-12-09 05:53:14,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:53:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:53:14,474 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 05:53:14,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318824439] [2020-12-09 05:53:14,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665429602] [2020-12-09 05:53:14,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f07f9228-4d55-4511-8097-a2504e479697/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 05:53:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:53:14,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 32 conjunts are in the unsatisfiable core [2020-12-09 05:53:14,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:53:14,651 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 05:53:14,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:53:14,924 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 05:53:14,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1556845880] [2020-12-09 05:53:14,927 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 05:53:14,927 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:53:14,928 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 05:53:14,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:53:14,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2020-12-09 05:53:14,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055572621] [2020-12-09 05:53:14,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-09 05:53:14,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:53:14,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-09 05:53:14,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2020-12-09 05:53:14,930 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 22 states. [2020-12-09 05:53:16,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:53:16,207 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2020-12-09 05:53:16,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-09 05:53:16,208 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 14 [2020-12-09 05:53:16,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:53:16,209 INFO L225 Difference]: With dead ends: 80 [2020-12-09 05:53:16,209 INFO L226 Difference]: Without dead ends: 80 [2020-12-09 05:53:16,210 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=378, Invalid=1428, Unknown=0, NotChecked=0, Total=1806 [2020-12-09 05:53:16,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-12-09 05:53:16,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 60. [2020-12-09 05:53:16,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-12-09 05:53:16,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2020-12-09 05:53:16,215 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 14 [2020-12-09 05:53:16,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:53:16,215 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2020-12-09 05:53:16,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-09 05:53:16,215 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2020-12-09 05:53:16,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 05:53:16,215 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:53:16,215 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:53:16,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:53:16,417 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, 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 05:53:16,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:53:16,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1102380111, now seen corresponding path program 1 times [2020-12-09 05:53:16,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:53:16,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598880369] [2020-12-09 05:53:16,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:53:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:53:16,508 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 05:53:16,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598880369] [2020-12-09 05:53:16,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240164091] [2020-12-09 05:53:16,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f07f9228-4d55-4511-8097-a2504e479697/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 05:53:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:53:16,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 05:53:16,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:53:16,639 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 05:53:16,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:53:16,781 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 05:53:16,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [195220376] [2020-12-09 05:53:16,784 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2020-12-09 05:53:16,784 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:53:16,784 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 05:53:16,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:53:16,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2020-12-09 05:53:16,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508280444] [2020-12-09 05:53:16,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-09 05:53:16,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:53:16,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-09 05:53:16,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2020-12-09 05:53:16,787 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand 19 states. [2020-12-09 05:53:17,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:53:17,012 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2020-12-09 05:53:17,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-09 05:53:17,013 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2020-12-09 05:53:17,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:53:17,014 INFO L225 Difference]: With dead ends: 68 [2020-12-09 05:53:17,014 INFO L226 Difference]: Without dead ends: 68 [2020-12-09 05:53:17,014 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2020-12-09 05:53:17,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-12-09 05:53:17,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2020-12-09 05:53:17,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-12-09 05:53:17,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2020-12-09 05:53:17,019 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 15 [2020-12-09 05:53:17,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:53:17,019 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2020-12-09 05:53:17,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-09 05:53:17,019 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2020-12-09 05:53:17,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 05:53:17,019 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:53:17,019 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-12-09 05:53:17,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:53:17,220 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, 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 05:53:17,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:53:17,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1102690097, now seen corresponding path program 1 times [2020-12-09 05:53:17,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:53:17,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76105133] [2020-12-09 05:53:17,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:53:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:53:17,324 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 05:53:17,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76105133] [2020-12-09 05:53:17,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791011483] [2020-12-09 05:53:17,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f07f9228-4d55-4511-8097-a2504e479697/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 05:53:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:53:17,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 32 conjunts are in the unsatisfiable core [2020-12-09 05:53:17,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:53:17,507 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 05:53:17,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:53:17,775 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 05:53:17,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1412045193] [2020-12-09 05:53:17,777 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2020-12-09 05:53:17,777 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:53:17,777 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 05:53:17,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:53:17,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2020-12-09 05:53:17,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539543674] [2020-12-09 05:53:17,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-09 05:53:17,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:53:17,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-09 05:53:17,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2020-12-09 05:53:17,780 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 23 states. [2020-12-09 05:53:18,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:53:18,646 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2020-12-09 05:53:18,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 05:53:18,646 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 15 [2020-12-09 05:53:18,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:53:18,647 INFO L225 Difference]: With dead ends: 70 [2020-12-09 05:53:18,647 INFO L226 Difference]: Without dead ends: 70 [2020-12-09 05:53:18,648 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=241, Invalid=1019, Unknown=0, NotChecked=0, Total=1260 [2020-12-09 05:53:18,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-12-09 05:53:18,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 58. [2020-12-09 05:53:18,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-12-09 05:53:18,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2020-12-09 05:53:18,652 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 15 [2020-12-09 05:53:18,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:53:18,652 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2020-12-09 05:53:18,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-09 05:53:18,652 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2020-12-09 05:53:18,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 05:53:18,653 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:53:18,653 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:53:18,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:53:18,855 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, 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 05:53:18,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:53:18,856 INFO L82 PathProgramCache]: Analyzing trace with hash 185955642, now seen corresponding path program 1 times [2020-12-09 05:53:18,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:53:18,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853853714] [2020-12-09 05:53:18,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:53:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:53:19,015 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 05:53:19,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853853714] [2020-12-09 05:53:19,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344907497] [2020-12-09 05:53:19,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f07f9228-4d55-4511-8097-a2504e479697/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 05:53:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:53:19,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 21 conjunts are in the unsatisfiable core [2020-12-09 05:53:19,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:53:19,386 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 05:53:19,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:53:20,046 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 05:53:20,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [702050384] [2020-12-09 05:53:20,048 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 05:53:20,049 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:53:20,049 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 05:53:20,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:53:20,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2020-12-09 05:53:20,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714392344] [2020-12-09 05:53:20,050 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-12-09 05:53:20,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:53:20,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-12-09 05:53:20,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2020-12-09 05:53:20,050 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand 30 states. [2020-12-09 05:53:21,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:53:21,173 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2020-12-09 05:53:21,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-09 05:53:21,174 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 16 [2020-12-09 05:53:21,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:53:21,175 INFO L225 Difference]: With dead ends: 96 [2020-12-09 05:53:21,175 INFO L226 Difference]: Without dead ends: 96 [2020-12-09 05:53:21,176 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=346, Invalid=1816, Unknown=0, NotChecked=0, Total=2162 [2020-12-09 05:53:21,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-12-09 05:53:21,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 76. [2020-12-09 05:53:21,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-12-09 05:53:21,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2020-12-09 05:53:21,181 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 16 [2020-12-09 05:53:21,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:53:21,181 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2020-12-09 05:53:21,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-12-09 05:53:21,181 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2020-12-09 05:53:21,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 05:53:21,181 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:53:21,181 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 05:53:21,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-12-09 05:53:21,383 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, 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 05:53:21,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:53:21,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1685234995, now seen corresponding path program 1 times [2020-12-09 05:53:21,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:53:21,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188556142] [2020-12-09 05:53:21,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:53:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:53:21,438 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 05:53:21,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188556142] [2020-12-09 05:53:21,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752508676] [2020-12-09 05:53:21,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f07f9228-4d55-4511-8097-a2504e479697/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 05:53:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:53:21,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2020-12-09 05:53:21,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:53:25,599 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 05:53:25,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:53:52,372 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 05:53:52,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [712817135] [2020-12-09 05:53:52,374 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2020-12-09 05:53:52,374 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:53:52,375 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 05:53:52,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:53:52,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 20 [2020-12-09 05:53:52,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975712143] [2020-12-09 05:53:52,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-09 05:53:52,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:53:52,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-09 05:53:52,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=294, Unknown=13, NotChecked=0, Total=380 [2020-12-09 05:53:52,376 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 20 states. [2020-12-09 05:53:52,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:53:52,510 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2020-12-09 05:53:52,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 05:53:52,510 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 18 [2020-12-09 05:53:52,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:53:52,511 INFO L225 Difference]: With dead ends: 74 [2020-12-09 05:53:52,512 INFO L226 Difference]: Without dead ends: 68 [2020-12-09 05:53:52,512 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=121, Invalid=372, Unknown=13, NotChecked=0, Total=506 [2020-12-09 05:53:52,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-12-09 05:53:52,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-12-09 05:53:52,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-12-09 05:53:52,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2020-12-09 05:53:52,516 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 18 [2020-12-09 05:53:52,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:53:52,516 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2020-12-09 05:53:52,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-12-09 05:53:52,516 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2020-12-09 05:53:52,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-09 05:53:52,517 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:53:52,517 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 05:53:52,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:53:52,718 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, 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 05:53:52,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:53:52,720 INFO L82 PathProgramCache]: Analyzing trace with hash -875720031, now seen corresponding path program 1 times [2020-12-09 05:53:52,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:53:52,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742761617] [2020-12-09 05:53:52,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:53:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:53:53,061 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 05:53:53,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742761617] [2020-12-09 05:53:53,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080238044] [2020-12-09 05:53:53,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f07f9228-4d55-4511-8097-a2504e479697/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 05:53:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:53:53,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 23 conjunts are in the unsatisfiable core [2020-12-09 05:53:53,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:53:53,250 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 05:53:53,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:53:53,394 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 05:53:53,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1517929730] [2020-12-09 05:53:53,395 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2020-12-09 05:53:53,396 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:53:53,396 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 05:53:53,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:53:53,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6, 6] total 24 [2020-12-09 05:53:53,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387506484] [2020-12-09 05:53:53,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-12-09 05:53:53,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:53:53,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-12-09 05:53:53,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2020-12-09 05:53:53,397 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 25 states. [2020-12-09 05:53:54,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:53:54,427 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2020-12-09 05:53:54,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-09 05:53:54,427 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 30 [2020-12-09 05:53:54,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:53:54,428 INFO L225 Difference]: With dead ends: 82 [2020-12-09 05:53:54,428 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 05:53:54,428 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=274, Invalid=1706, Unknown=0, NotChecked=0, Total=1980 [2020-12-09 05:53:54,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 05:53:54,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 05:53:54,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 05:53:54,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 05:53:54,429 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2020-12-09 05:53:54,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:53:54,429 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 05:53:54,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-12-09 05:53:54,429 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 05:53:54,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 05:53:54,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:53:54,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:53:54 BoogieIcfgContainer [2020-12-09 05:53:54,641 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 05:53:54,643 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 05:53:54,643 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 05:53:54,643 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 05:53:54,644 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:53:12" (3/4) ... [2020-12-09 05:53:54,651 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 05:53:54,664 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2020-12-09 05:53:54,673 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2020-12-09 05:53:54,674 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-12-09 05:53:54,674 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-09 05:53:54,674 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 05:53:54,704 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f07f9228-4d55-4511-8097-a2504e479697/bin/utaipan/witness.graphml [2020-12-09 05:53:54,704 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 05:53:54,705 INFO L168 Benchmark]: Toolchain (without parser) took 43012.76 ms. Allocated memory was 100.7 MB in the beginning and 151.0 MB in the end (delta: 50.3 MB). Free memory was 60.9 MB in the beginning and 39.0 MB in the end (delta: 22.0 MB). Peak memory consumption was 72.9 MB. Max. memory is 16.1 GB. [2020-12-09 05:53:54,705 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 100.7 MB. Free memory is still 77.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 05:53:54,705 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.52 ms. Allocated memory is still 100.7 MB. Free memory was 60.8 MB in the beginning and 50.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-09 05:53:54,705 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.65 ms. Allocated memory is still 100.7 MB. Free memory was 50.4 MB in the beginning and 48.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 05:53:54,706 INFO L168 Benchmark]: Boogie Preprocessor took 16.72 ms. Allocated memory is still 100.7 MB. Free memory was 48.8 MB in the beginning and 47.6 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 05:53:54,706 INFO L168 Benchmark]: RCFGBuilder took 375.19 ms. Allocated memory is still 100.7 MB. Free memory was 47.6 MB in the beginning and 57.8 MB in the end (delta: -10.2 MB). Peak memory consumption was 9.0 MB. Max. memory is 16.1 GB. [2020-12-09 05:53:54,706 INFO L168 Benchmark]: TraceAbstraction took 42368.84 ms. Allocated memory was 100.7 MB in the beginning and 151.0 MB in the end (delta: 50.3 MB). Free memory was 57.5 MB in the beginning and 41.8 MB in the end (delta: 15.7 MB). Peak memory consumption was 68.1 MB. Max. memory is 16.1 GB. [2020-12-09 05:53:54,706 INFO L168 Benchmark]: Witness Printer took 61.57 ms. Allocated memory is still 151.0 MB. Free memory was 41.8 MB in the beginning and 39.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 05:53:54,708 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.17 ms. Allocated memory is still 100.7 MB. Free memory is still 77.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 158.52 ms. Allocated memory is still 100.7 MB. Free memory was 60.8 MB in the beginning and 50.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 26.65 ms. Allocated memory is still 100.7 MB. Free memory was 50.4 MB in the beginning and 48.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 16.72 ms. Allocated memory is still 100.7 MB. Free memory was 48.8 MB in the beginning and 47.6 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 375.19 ms. Allocated memory is still 100.7 MB. Free memory was 47.6 MB in the beginning and 57.8 MB in the end (delta: -10.2 MB). Peak memory consumption was 9.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 42368.84 ms. Allocated memory was 100.7 MB in the beginning and 151.0 MB in the end (delta: 50.3 MB). Free memory was 57.5 MB in the beginning and 41.8 MB in the end (delta: 15.7 MB). Peak memory consumption was 68.1 MB. Max. memory is 16.1 GB. * Witness Printer took 61.57 ms. Allocated memory is still 151.0 MB. Free memory was 41.8 MB in the beginning and 39.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 48]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 48]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 48]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 25]: 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: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: 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 - 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: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 14 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 42.3s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 222 SDtfs, 1538 SDslu, 770 SDs, 0 SdLazy, 1941 SolverSat, 357 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 425 GetRequests, 158 SyntacticMatches, 9 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1266 ImplicationChecksByTransitivity, 36.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=11, 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, 13 MinimizatonAttempts, 94 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 34.6s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 384 ConstructedInterpolants, 23 QuantifiedInterpolants, 89080 SizeOfPredicates, 117 NumberOfNonLiveVariables, 1099 ConjunctsInSsa, 175 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 29/108 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...