./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/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 440325a953e10d2173456ab8f8c8fc1313a6b958 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 22:01:27,762 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 22:01:27,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 22:01:27,772 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 22:01:27,772 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 22:01:27,773 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 22:01:27,774 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 22:01:27,776 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 22:01:27,778 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 22:01:27,779 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 22:01:27,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 22:01:27,781 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 22:01:27,781 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 22:01:27,782 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 22:01:27,783 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 22:01:27,784 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 22:01:27,784 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 22:01:27,785 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 22:01:27,787 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 22:01:27,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 22:01:27,791 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 22:01:27,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 22:01:27,792 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 22:01:27,793 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 22:01:27,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 22:01:27,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 22:01:27,796 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 22:01:27,796 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 22:01:27,796 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 22:01:27,797 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 22:01:27,797 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 22:01:27,798 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 22:01:27,798 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 22:01:27,799 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 22:01:27,800 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 22:01:27,800 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 22:01:27,800 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 22:01:27,801 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 22:01:27,801 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 22:01:27,801 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 22:01:27,802 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 22:01:27,803 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 22:01:27,814 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 22:01:27,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 22:01:27,815 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 22:01:27,815 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 22:01:27,815 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 22:01:27,815 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 22:01:27,816 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 22:01:27,816 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 22:01:27,816 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 22:01:27,816 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 22:01:27,816 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 22:01:27,816 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 22:01:27,816 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 22:01:27,816 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 22:01:27,817 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 22:01:27,817 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 22:01:27,817 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 22:01:27,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 22:01:27,817 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 22:01:27,817 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 22:01:27,818 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 22:01:27,818 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 22:01:27,818 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 22:01:27,818 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 22:01:27,818 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 22:01:27,818 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 22:01:27,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 22:01:27,818 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 22:01:27,819 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 22:01:27,819 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 22:01:27,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 22:01:27,819 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 22:01:27,819 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 22:01:27,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 22:01:27,819 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 22:01:27,820 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 22:01:27,820 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 22:01:27,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 22:01:27,820 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 22:01:27,820 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 22:01:27,820 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_df6e0fbb-d547-47bb-90c1-34cfbc32e468/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 -> 440325a953e10d2173456ab8f8c8fc1313a6b958 [2019-12-07 22:01:27,930 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 22:01:27,937 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 22:01:27,939 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 22:01:27,940 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 22:01:27,941 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 22:01:27,941 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/bin/utaipan/../../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2019-12-07 22:01:27,980 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/bin/utaipan/data/29650e94a/3d8e012b27af4ace96db8bc5752d3544/FLAGd366739e0 [2019-12-07 22:01:28,412 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 22:01:28,413 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2019-12-07 22:01:28,417 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/bin/utaipan/data/29650e94a/3d8e012b27af4ace96db8bc5752d3544/FLAGd366739e0 [2019-12-07 22:01:28,426 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/bin/utaipan/data/29650e94a/3d8e012b27af4ace96db8bc5752d3544 [2019-12-07 22:01:28,428 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 22:01:28,428 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 22:01:28,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 22:01:28,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 22:01:28,432 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 22:01:28,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:01:28" (1/1) ... [2019-12-07 22:01:28,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53e3314c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:01:28, skipping insertion in model container [2019-12-07 22:01:28,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:01:28" (1/1) ... [2019-12-07 22:01:28,439 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 22:01:28,450 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 22:01:28,556 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 22:01:28,598 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 22:01:28,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 22:01:28,630 INFO L208 MainTranslator]: Completed translation [2019-12-07 22:01:28,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:01:28 WrapperNode [2019-12-07 22:01:28,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 22:01:28,631 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 22:01:28,631 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 22:01:28,631 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 22:01:28,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:01:28" (1/1) ... [2019-12-07 22:01:28,642 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:01:28" (1/1) ... [2019-12-07 22:01:28,657 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 22:01:28,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 22:01:28,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 22:01:28,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 22:01:28,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:01:28" (1/1) ... [2019-12-07 22:01:28,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:01:28" (1/1) ... [2019-12-07 22:01:28,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:01:28" (1/1) ... [2019-12-07 22:01:28,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:01:28" (1/1) ... [2019-12-07 22:01:28,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:01:28" (1/1) ... [2019-12-07 22:01:28,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:01:28" (1/1) ... [2019-12-07 22:01:28,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:01:28" (1/1) ... [2019-12-07 22:01:28,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 22:01:28,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 22:01:28,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 22:01:28,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 22:01:28,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:01:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/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 [2019-12-07 22:01:28,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-07 22:01:28,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 22:01:28,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 22:01:28,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 22:01:28,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 22:01:28,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 22:01:28,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 22:01:29,011 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 22:01:29,011 INFO L287 CfgBuilder]: Removed 17 assume(true) statements. [2019-12-07 22:01:29,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:01:29 BoogieIcfgContainer [2019-12-07 22:01:29,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 22:01:29,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 22:01:29,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 22:01:29,015 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 22:01:29,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:01:28" (1/3) ... [2019-12-07 22:01:29,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c6f49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:01:29, skipping insertion in model container [2019-12-07 22:01:29,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:01:28" (2/3) ... [2019-12-07 22:01:29,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c6f49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:01:29, skipping insertion in model container [2019-12-07 22:01:29,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:01:29" (3/3) ... [2019-12-07 22:01:29,017 INFO L109 eAbstractionObserver]: Analyzing ICFG getNumbers4-2.c [2019-12-07 22:01:29,023 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 22:01:29,028 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-12-07 22:01:29,035 INFO L249 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-12-07 22:01:29,048 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 22:01:29,048 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 22:01:29,048 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 22:01:29,048 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 22:01:29,048 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 22:01:29,048 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 22:01:29,048 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 22:01:29,048 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 22:01:29,058 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-12-07 22:01:29,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 22:01:29,063 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:01:29,063 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 22:01:29,064 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:01:29,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:01:29,067 INFO L82 PathProgramCache]: Analyzing trace with hash 145433, now seen corresponding path program 1 times [2019-12-07 22:01:29,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:01:29,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186695703] [2019-12-07 22:01:29,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:01:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:29,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:01:29,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186695703] [2019-12-07 22:01:29,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:01:29,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 22:01:29,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564047566] [2019-12-07 22:01:29,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:01:29,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:01:29,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:01:29,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:01:29,201 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2019-12-07 22:01:29,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:01:29,237 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-12-07 22:01:29,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:01:29,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 22:01:29,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:01:29,244 INFO L225 Difference]: With dead ends: 32 [2019-12-07 22:01:29,245 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 22:01:29,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:01:29,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 22:01:29,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-07 22:01:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 22:01:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-12-07 22:01:29,267 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 3 [2019-12-07 22:01:29,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:01:29,267 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-12-07 22:01:29,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:01:29,267 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-12-07 22:01:29,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 22:01:29,267 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:01:29,268 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 22:01:29,268 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:01:29,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:01:29,268 INFO L82 PathProgramCache]: Analyzing trace with hash 145434, now seen corresponding path program 1 times [2019-12-07 22:01:29,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:01:29,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884855176] [2019-12-07 22:01:29,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:01:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:01:29,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884855176] [2019-12-07 22:01:29,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:01:29,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 22:01:29,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423972581] [2019-12-07 22:01:29,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:01:29,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:01:29,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:01:29,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:01:29,307 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 3 states. [2019-12-07 22:01:29,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:01:29,341 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-12-07 22:01:29,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:01:29,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 22:01:29,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:01:29,342 INFO L225 Difference]: With dead ends: 33 [2019-12-07 22:01:29,343 INFO L226 Difference]: Without dead ends: 33 [2019-12-07 22:01:29,343 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:01:29,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-07 22:01:29,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-12-07 22:01:29,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 22:01:29,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-12-07 22:01:29,347 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 3 [2019-12-07 22:01:29,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:01:29,347 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-12-07 22:01:29,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:01:29,347 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-12-07 22:01:29,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 22:01:29,348 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:01:29,348 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-12-07 22:01:29,348 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:01:29,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:01:29,348 INFO L82 PathProgramCache]: Analyzing trace with hash 139863302, now seen corresponding path program 1 times [2019-12-07 22:01:29,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:01:29,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409214834] [2019-12-07 22:01:29,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:01:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:29,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:01:29,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409214834] [2019-12-07 22:01:29,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174020634] [2019-12-07 22:01:29,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/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 [2019-12-07 22:01:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:29,439 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 22:01:29,444 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:01:29,477 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_50|], 8=[|v_#valid_66|]} [2019-12-07 22:01:29,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 22:01:29,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 22:01:29,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 22:01:29,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 22:01:29,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 22:01:29,506 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:01:29,506 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 35 [2019-12-07 22:01:29,507 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:01:29,538 INFO L614 ElimStorePlain]: treesize reduction 10, result has 86.1 percent of original size [2019-12-07 22:01:29,558 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:01:29,559 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 209 treesize of output 211 [2019-12-07 22:01:29,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 22:01:29,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 22:01:29,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 22:01:29,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 22:01:29,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 22:01:29,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 22:01:29,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 22:01:29,573 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 22:01:29,675 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 30 [2019-12-07 22:01:29,676 INFO L614 ElimStorePlain]: treesize reduction 686, result has 5.9 percent of original size [2019-12-07 22:01:29,677 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 22:01:29,678 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:53, output treesize:34 [2019-12-07 22:01:29,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:01:29,716 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:01:29,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:01:29,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [989058057] [2019-12-07 22:01:29,755 INFO L159 IcfgInterpreter]: Started Sifa with 4 locations of interest [2019-12-07 22:01:29,755 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 22:01:29,759 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 22:01:29,763 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 22:01:29,763 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 22:01:30,302 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 22:01:30,784 WARN L192 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 101 [2019-12-07 22:01:30,840 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 22:01:30,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 22:01:30,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-12-07 22:01:30,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823911918] [2019-12-07 22:01:30,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 22:01:30,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:01:30,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 22:01:30,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-07 22:01:30,842 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2019-12-07 22:01:30,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:01:30,945 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2019-12-07 22:01:30,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 22:01:30,945 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-12-07 22:01:30,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:01:30,947 INFO L225 Difference]: With dead ends: 53 [2019-12-07 22:01:30,947 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 22:01:30,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-07 22:01:30,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 22:01:30,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2019-12-07 22:01:30,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 22:01:30,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-12-07 22:01:30,953 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 5 [2019-12-07 22:01:30,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:01:30,953 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-12-07 22:01:30,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 22:01:30,953 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-12-07 22:01:30,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 22:01:30,954 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:01:30,954 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-12-07 22:01:31,154 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:01:31,155 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:01:31,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:01:31,156 INFO L82 PathProgramCache]: Analyzing trace with hash 552607639, now seen corresponding path program 1 times [2019-12-07 22:01:31,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:01:31,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129507144] [2019-12-07 22:01:31,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:01:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:31,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:01:31,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129507144] [2019-12-07 22:01:31,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779650633] [2019-12-07 22:01:31,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/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 [2019-12-07 22:01:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:31,246 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 22:01:31,247 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:01:31,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:01:31,254 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:01:31,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:01:31,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1760497760] [2019-12-07 22:01:31,275 INFO L159 IcfgInterpreter]: Started Sifa with 6 locations of interest [2019-12-07 22:01:31,275 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 22:01:31,276 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 22:01:31,276 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 22:01:31,276 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 22:01:31,614 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 22:01:31,983 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 101 [2019-12-07 22:01:32,175 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 57 [2019-12-07 22:01:32,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 22:01:32,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4, 4] total 11 [2019-12-07 22:01:32,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113190799] [2019-12-07 22:01:32,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 22:01:32,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:01:32,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 22:01:32,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-07 22:01:32,203 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 5 states. [2019-12-07 22:01:32,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:01:32,384 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2019-12-07 22:01:32,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 22:01:32,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-12-07 22:01:32,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:01:32,386 INFO L225 Difference]: With dead ends: 51 [2019-12-07 22:01:32,386 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 22:01:32,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-07 22:01:32,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 22:01:32,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2019-12-07 22:01:32,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 22:01:32,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-12-07 22:01:32,390 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 8 [2019-12-07 22:01:32,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:01:32,391 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-12-07 22:01:32,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 22:01:32,391 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-12-07 22:01:32,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 22:01:32,391 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:01:32,391 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-12-07 22:01:32,592 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:01:32,593 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:01:32,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:01:32,593 INFO L82 PathProgramCache]: Analyzing trace with hash -49032403, now seen corresponding path program 1 times [2019-12-07 22:01:32,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:01:32,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071594276] [2019-12-07 22:01:32,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:01:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:32,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 22:01:32,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071594276] [2019-12-07 22:01:32,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:01:32,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 22:01:32,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057027001] [2019-12-07 22:01:32,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:01:32,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:01:32,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:01:32,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:01:32,631 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2019-12-07 22:01:32,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:01:32,650 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2019-12-07 22:01:32,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:01:32,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 22:01:32,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:01:32,651 INFO L225 Difference]: With dead ends: 40 [2019-12-07 22:01:32,651 INFO L226 Difference]: Without dead ends: 40 [2019-12-07 22:01:32,651 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:01:32,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-07 22:01:32,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-12-07 22:01:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 22:01:32,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-12-07 22:01:32,654 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 9 [2019-12-07 22:01:32,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:01:32,655 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-12-07 22:01:32,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:01:32,655 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-12-07 22:01:32,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 22:01:32,655 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:01:32,656 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-12-07 22:01:32,656 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:01:32,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:01:32,656 INFO L82 PathProgramCache]: Analyzing trace with hash -49032402, now seen corresponding path program 1 times [2019-12-07 22:01:32,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:01:32,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683352946] [2019-12-07 22:01:32,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:01:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:32,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:01:32,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683352946] [2019-12-07 22:01:32,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405099923] [2019-12-07 22:01:32,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/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 [2019-12-07 22:01:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:32,709 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 22:01:32,710 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:01:32,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:01:32,715 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:01:32,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:01:32,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [140958088] [2019-12-07 22:01:32,731 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 22:01:32,731 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 22:01:32,731 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 22:01:32,732 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 22:01:32,732 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 22:01:33,028 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 22:01:33,178 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 67 [2019-12-07 22:01:33,632 WARN L192 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 101 [2019-12-07 22:01:33,831 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 57 [2019-12-07 22:01:34,052 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 63 [2019-12-07 22:01:34,052 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 22:01:34,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 22:01:34,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2019-12-07 22:01:34,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523592224] [2019-12-07 22:01:34,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 22:01:34,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:01:34,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 22:01:34,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-12-07 22:01:34,054 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 9 states. [2019-12-07 22:01:34,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:01:34,078 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-12-07 22:01:34,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 22:01:34,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-12-07 22:01:34,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:01:34,079 INFO L225 Difference]: With dead ends: 44 [2019-12-07 22:01:34,079 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 22:01:34,079 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-12-07 22:01:34,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 22:01:34,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-12-07 22:01:34,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 22:01:34,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-12-07 22:01:34,082 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 9 [2019-12-07 22:01:34,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:01:34,082 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-12-07 22:01:34,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 22:01:34,082 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-12-07 22:01:34,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 22:01:34,082 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:01:34,082 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2019-12-07 22:01:34,283 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:01:34,284 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:01:34,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:01:34,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1037019594, now seen corresponding path program 2 times [2019-12-07 22:01:34,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:01:34,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108708968] [2019-12-07 22:01:34,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:01:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:34,370 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:01:34,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108708968] [2019-12-07 22:01:34,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770248258] [2019-12-07 22:01:34,370 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/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 [2019-12-07 22:01:34,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 22:01:34,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 22:01:34,396 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 22:01:34,397 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:01:34,567 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 22:01:34,568 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:01:34,620 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 22:01:34,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-12-07 22:01:34,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 3] total 12 [2019-12-07 22:01:34,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750045264] [2019-12-07 22:01:34,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 22:01:34,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:01:34,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 22:01:34,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-07 22:01:34,621 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 5 states. [2019-12-07 22:01:34,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:01:34,668 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-12-07 22:01:34,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 22:01:34,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 22:01:34,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:01:34,669 INFO L225 Difference]: With dead ends: 42 [2019-12-07 22:01:34,669 INFO L226 Difference]: Without dead ends: 42 [2019-12-07 22:01:34,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-07 22:01:34,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-07 22:01:34,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-12-07 22:01:34,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 22:01:34,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-12-07 22:01:34,672 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 11 [2019-12-07 22:01:34,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:01:34,672 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-12-07 22:01:34,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 22:01:34,672 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-12-07 22:01:34,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 22:01:34,673 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:01:34,673 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1] [2019-12-07 22:01:34,873 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:01:34,874 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:01:34,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:01:34,874 INFO L82 PathProgramCache]: Analyzing trace with hash -342802210, now seen corresponding path program 2 times [2019-12-07 22:01:34,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:01:34,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41240411] [2019-12-07 22:01:34,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:01:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:34,927 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:01:34,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41240411] [2019-12-07 22:01:34,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456409936] [2019-12-07 22:01:34,927 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/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 [2019-12-07 22:01:34,954 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-12-07 22:01:34,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 22:01:34,954 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 22:01:34,955 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:01:35,301 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 22:01:35,301 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:01:35,338 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 22:01:35,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 22:01:35,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 14 [2019-12-07 22:01:35,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992009887] [2019-12-07 22:01:35,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 22:01:35,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:01:35,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 22:01:35,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-07 22:01:35,340 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 8 states. [2019-12-07 22:01:35,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:01:35,376 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-12-07 22:01:35,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 22:01:35,376 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-12-07 22:01:35,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:01:35,376 INFO L225 Difference]: With dead ends: 41 [2019-12-07 22:01:35,377 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 22:01:35,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 12 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-07 22:01:35,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 22:01:35,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-12-07 22:01:35,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 22:01:35,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-12-07 22:01:35,379 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 17 [2019-12-07 22:01:35,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:01:35,379 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-12-07 22:01:35,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 22:01:35,379 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-12-07 22:01:35,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 22:01:35,380 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:01:35,380 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1] [2019-12-07 22:01:35,580 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:01:35,581 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:01:35,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:01:35,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1279636754, now seen corresponding path program 1 times [2019-12-07 22:01:35,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:01:35,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446778499] [2019-12-07 22:01:35,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:01:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:35,718 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 22:01:35,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446778499] [2019-12-07 22:01:35,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838325785] [2019-12-07 22:01:35,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/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 [2019-12-07 22:01:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:35,754 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 22:01:35,755 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:01:35,762 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 22:01:35,762 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:01:35,800 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 22:01:35,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1439003769] [2019-12-07 22:01:35,801 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 22:01:35,801 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 22:01:35,801 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 22:01:35,801 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 22:01:35,801 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 22:01:36,168 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:36,175 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:36,182 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:36,273 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 22:01:36,736 WARN L192 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 101 [2019-12-07 22:01:37,041 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 22:01:37,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 22:01:37,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2019-12-07 22:01:37,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646545790] [2019-12-07 22:01:37,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 22:01:37,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:01:37,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 22:01:37,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-12-07 22:01:37,042 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 13 states. [2019-12-07 22:01:37,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:01:37,067 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-12-07 22:01:37,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 22:01:37,067 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-12-07 22:01:37,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:01:37,068 INFO L225 Difference]: With dead ends: 49 [2019-12-07 22:01:37,068 INFO L226 Difference]: Without dead ends: 49 [2019-12-07 22:01:37,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-12-07 22:01:37,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-07 22:01:37,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-12-07 22:01:37,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 22:01:37,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-12-07 22:01:37,071 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 19 [2019-12-07 22:01:37,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:01:37,071 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-12-07 22:01:37,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 22:01:37,071 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-12-07 22:01:37,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 22:01:37,071 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:01:37,071 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 2, 1, 1, 1, 1, 1] [2019-12-07 22:01:37,272 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:01:37,273 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:01:37,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:01:37,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1076246846, now seen corresponding path program 2 times [2019-12-07 22:01:37,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:01:37,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511636080] [2019-12-07 22:01:37,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:01:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:37,435 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 72 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:01:37,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511636080] [2019-12-07 22:01:37,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659944486] [2019-12-07 22:01:37,436 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/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 [2019-12-07 22:01:37,464 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 22:01:37,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 22:01:37,464 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 22:01:37,465 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:01:37,522 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-12-07 22:01:37,522 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:01:37,609 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-12-07 22:01:37,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1906396283] [2019-12-07 22:01:37,610 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 22:01:37,610 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 22:01:37,610 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 22:01:37,611 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 22:01:37,611 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 22:01:37,906 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:37,913 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:37,918 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:38,005 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 22:01:38,509 WARN L192 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 101 [2019-12-07 22:01:38,723 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-12-07 22:01:38,939 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 22:01:38,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 22:01:38,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 4] total 20 [2019-12-07 22:01:38,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000110680] [2019-12-07 22:01:38,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 22:01:38,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:01:38,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 22:01:38,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2019-12-07 22:01:38,940 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 22 states. [2019-12-07 22:01:39,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:01:39,377 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2019-12-07 22:01:39,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 22:01:39,377 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2019-12-07 22:01:39,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:01:39,378 INFO L225 Difference]: With dead ends: 61 [2019-12-07 22:01:39,378 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 22:01:39,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=486, Invalid=1236, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 22:01:39,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 22:01:39,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2019-12-07 22:01:39,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 22:01:39,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2019-12-07 22:01:39,381 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 27 [2019-12-07 22:01:39,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:01:39,382 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2019-12-07 22:01:39,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 22:01:39,382 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2019-12-07 22:01:39,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 22:01:39,382 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:01:39,382 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 2, 1, 1, 1, 1, 1] [2019-12-07 22:01:39,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:01:39,584 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:01:39,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:01:39,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1076246847, now seen corresponding path program 1 times [2019-12-07 22:01:39,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:01:39,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546569588] [2019-12-07 22:01:39,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:01:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:39,622 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 22:01:39,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546569588] [2019-12-07 22:01:39,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:01:39,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 22:01:39,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244944611] [2019-12-07 22:01:39,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:01:39,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:01:39,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:01:39,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:01:39,623 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand 3 states. [2019-12-07 22:01:39,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:01:39,640 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-12-07 22:01:39,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:01:39,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 22:01:39,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:01:39,641 INFO L225 Difference]: With dead ends: 57 [2019-12-07 22:01:39,641 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 22:01:39,641 INFO L630 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 [2019-12-07 22:01:39,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 22:01:39,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-12-07 22:01:39,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 22:01:39,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2019-12-07 22:01:39,643 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 27 [2019-12-07 22:01:39,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:01:39,644 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2019-12-07 22:01:39,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:01:39,644 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2019-12-07 22:01:39,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 22:01:39,644 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:01:39,644 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 22:01:39,644 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:01:39,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:01:39,645 INFO L82 PathProgramCache]: Analyzing trace with hash 474942607, now seen corresponding path program 1 times [2019-12-07 22:01:39,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:01:39,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908160329] [2019-12-07 22:01:39,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:01:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-12-07 22:01:39,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908160329] [2019-12-07 22:01:39,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:01:39,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 22:01:39,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626925245] [2019-12-07 22:01:39,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:01:39,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:01:39,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:01:39,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:01:39,668 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 4 states. [2019-12-07 22:01:39,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:01:39,697 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2019-12-07 22:01:39,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 22:01:39,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-12-07 22:01:39,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:01:39,698 INFO L225 Difference]: With dead ends: 56 [2019-12-07 22:01:39,698 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 22:01:39,698 INFO L630 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 [2019-12-07 22:01:39,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 22:01:39,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-12-07 22:01:39,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 22:01:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2019-12-07 22:01:39,701 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 31 [2019-12-07 22:01:39,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:01:39,701 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2019-12-07 22:01:39,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:01:39,701 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2019-12-07 22:01:39,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 22:01:39,702 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:01:39,702 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 22:01:39,702 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:01:39,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:01:39,702 INFO L82 PathProgramCache]: Analyzing trace with hash 474942608, now seen corresponding path program 1 times [2019-12-07 22:01:39,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:01:39,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490873756] [2019-12-07 22:01:39,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:01:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 22:01:39,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490873756] [2019-12-07 22:01:39,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148784648] [2019-12-07 22:01:39,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:01:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:39,797 INFO L264 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 22:01:39,798 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:01:39,818 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 22:01:39,818 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:01:39,843 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 22:01:39,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [80836876] [2019-12-07 22:01:39,844 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2019-12-07 22:01:39,844 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 22:01:39,844 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 22:01:39,844 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 22:01:39,844 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 22:01:40,124 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:40,152 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:40,158 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:40,292 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:40,314 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 22:01:40,456 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2019-12-07 22:01:40,848 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 101 [2019-12-07 22:01:41,066 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-12-07 22:01:41,271 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-12-07 22:01:41,542 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-12-07 22:01:41,612 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 22:01:41,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 22:01:41,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2019-12-07 22:01:41,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133128315] [2019-12-07 22:01:41,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 22:01:41,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:01:41,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 22:01:41,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-12-07 22:01:41,614 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 14 states. [2019-12-07 22:01:42,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:01:42,633 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-12-07 22:01:42,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 22:01:42,634 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-12-07 22:01:42,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:01:42,636 INFO L225 Difference]: With dead ends: 67 [2019-12-07 22:01:42,636 INFO L226 Difference]: Without dead ends: 67 [2019-12-07 22:01:42,637 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2019-12-07 22:01:42,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-12-07 22:01:42,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2019-12-07 22:01:42,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 22:01:42,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2019-12-07 22:01:42,643 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 31 [2019-12-07 22:01:42,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:01:42,644 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2019-12-07 22:01:42,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 22:01:42,645 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2019-12-07 22:01:42,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 22:01:42,647 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:01:42,647 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 5, 4, 4, 1, 1, 1] [2019-12-07 22:01:42,848 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:01:42,849 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:01:42,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:01:42,849 INFO L82 PathProgramCache]: Analyzing trace with hash -151826313, now seen corresponding path program 3 times [2019-12-07 22:01:42,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:01:42,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204031692] [2019-12-07 22:01:42,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:01:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:43,020 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 94 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:01:43,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204031692] [2019-12-07 22:01:43,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246979858] [2019-12-07 22:01:43,021 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:01:43,054 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 22:01:43,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 22:01:43,055 INFO L264 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 22:01:43,057 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:01:43,305 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 39 proven. 71 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 22:01:43,305 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:01:43,591 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 75 proven. 35 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 22:01:43,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1095964515] [2019-12-07 22:01:43,592 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 22:01:43,592 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 22:01:43,592 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 22:01:43,593 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 22:01:43,593 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 22:01:43,881 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:43,888 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:43,893 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:43,976 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 22:01:44,579 WARN L192 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 101 [2019-12-07 22:01:45,327 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 22:01:45,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 22:01:45,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 42 [2019-12-07 22:01:45,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188977483] [2019-12-07 22:01:45,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-07 22:01:45,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:01:45,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-07 22:01:45,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=1947, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 22:01:45,329 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 43 states. [2019-12-07 22:01:46,371 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2019-12-07 22:01:46,825 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2019-12-07 22:01:47,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:01:47,371 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2019-12-07 22:01:47,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 22:01:47,372 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 36 [2019-12-07 22:01:47,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:01:47,372 INFO L225 Difference]: With dead ends: 74 [2019-12-07 22:01:47,373 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 22:01:47,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 79 SyntacticMatches, 8 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1241 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1156, Invalid=3814, Unknown=0, NotChecked=0, Total=4970 [2019-12-07 22:01:47,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 22:01:47,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2019-12-07 22:01:47,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 22:01:47,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-12-07 22:01:47,377 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 36 [2019-12-07 22:01:47,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:01:47,377 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-12-07 22:01:47,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-07 22:01:47,377 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-12-07 22:01:47,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 22:01:47,378 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:01:47,378 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2019-12-07 22:01:47,578 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:01:47,579 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:01:47,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:01:47,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1009349205, now seen corresponding path program 1 times [2019-12-07 22:01:47,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:01:47,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309398124] [2019-12-07 22:01:47,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:01:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:47,612 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-12-07 22:01:47,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309398124] [2019-12-07 22:01:47,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:01:47,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 22:01:47,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559630212] [2019-12-07 22:01:47,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:01:47,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:01:47,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:01:47,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:01:47,613 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 3 states. [2019-12-07 22:01:47,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:01:47,627 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-12-07 22:01:47,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:01:47,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-07 22:01:47,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:01:47,628 INFO L225 Difference]: With dead ends: 61 [2019-12-07 22:01:47,628 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 22:01:47,628 INFO L630 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 [2019-12-07 22:01:47,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 22:01:47,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-12-07 22:01:47,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 22:01:47,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-12-07 22:01:47,630 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 44 [2019-12-07 22:01:47,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:01:47,630 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-12-07 22:01:47,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:01:47,631 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-12-07 22:01:47,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 22:01:47,631 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:01:47,631 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2019-12-07 22:01:47,632 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:01:47,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:01:47,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1009349204, now seen corresponding path program 1 times [2019-12-07 22:01:47,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:01:47,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756598922] [2019-12-07 22:01:47,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:01:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:47,682 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 22:01:47,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756598922] [2019-12-07 22:01:47,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294212419] [2019-12-07 22:01:47,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:01:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:47,725 INFO L264 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 22:01:47,727 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:01:47,734 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 22:01:47,734 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:01:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 22:01:47,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [372788967] [2019-12-07 22:01:47,774 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 22:01:47,774 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 22:01:47,774 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 22:01:47,774 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 22:01:47,774 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 22:01:48,091 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:48,099 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:48,106 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:48,219 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:48,240 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 22:01:48,608 WARN L192 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 101 [2019-12-07 22:01:49,094 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-12-07 22:01:49,282 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2019-12-07 22:01:49,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 22:01:49,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 9, 9] total 19 [2019-12-07 22:01:49,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991661665] [2019-12-07 22:01:49,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 22:01:49,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:01:49,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 22:01:49,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-12-07 22:01:49,284 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 8 states. [2019-12-07 22:01:49,427 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 59 [2019-12-07 22:01:49,567 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 72 [2019-12-07 22:01:49,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:01:49,673 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2019-12-07 22:01:49,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 22:01:49,673 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-12-07 22:01:49,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:01:49,674 INFO L225 Difference]: With dead ends: 62 [2019-12-07 22:01:49,674 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 22:01:49,674 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 110 SyntacticMatches, 12 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-07 22:01:49,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 22:01:49,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-07 22:01:49,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 22:01:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-12-07 22:01:49,676 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 44 [2019-12-07 22:01:49,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:01:49,676 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-12-07 22:01:49,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 22:01:49,676 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-12-07 22:01:49,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 22:01:49,676 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:01:49,676 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 22:01:49,877 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:01:49,878 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:01:49,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:01:49,879 INFO L82 PathProgramCache]: Analyzing trace with hash 678090867, now seen corresponding path program 1 times [2019-12-07 22:01:49,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:01:49,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35176217] [2019-12-07 22:01:49,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:01:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-12-07 22:01:49,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35176217] [2019-12-07 22:01:49,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633226321] [2019-12-07 22:01:49,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:01:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:49,997 INFO L264 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 22:01:49,998 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:01:50,006 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-12-07 22:01:50,006 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:01:50,042 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-12-07 22:01:50,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [708135115] [2019-12-07 22:01:50,043 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 22:01:50,043 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 22:01:50,044 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 22:01:50,044 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 22:01:50,044 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 22:01:50,303 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:50,310 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:50,315 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:50,441 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:50,619 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 22:01:50,772 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-12-07 22:01:51,157 WARN L192 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 101 [2019-12-07 22:01:51,421 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-12-07 22:01:51,688 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-12-07 22:01:52,187 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-12-07 22:01:52,468 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-12-07 22:01:52,828 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-12-07 22:01:52,829 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 22:01:52,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 22:01:52,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2019-12-07 22:01:52,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198678184] [2019-12-07 22:01:52,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 22:01:52,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:01:52,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 22:01:52,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-07 22:01:52,831 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 13 states. [2019-12-07 22:01:52,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:01:52,917 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2019-12-07 22:01:52,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 22:01:52,917 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2019-12-07 22:01:52,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:01:52,918 INFO L225 Difference]: With dead ends: 74 [2019-12-07 22:01:52,918 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 22:01:52,919 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 116 SyntacticMatches, 10 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-07 22:01:52,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 22:01:52,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-12-07 22:01:52,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 22:01:52,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2019-12-07 22:01:52,922 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 46 [2019-12-07 22:01:52,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:01:52,923 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2019-12-07 22:01:52,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 22:01:52,923 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2019-12-07 22:01:52,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 22:01:52,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:01:52,924 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 22:01:53,125 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:01:53,126 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:01:53,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:01:53,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1982107469, now seen corresponding path program 2 times [2019-12-07 22:01:53,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:01:53,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242656619] [2019-12-07 22:01:53,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:01:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:53,356 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 118 proven. 29 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 22:01:53,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242656619] [2019-12-07 22:01:53,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961550801] [2019-12-07 22:01:53,356 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:01:53,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 22:01:53,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 22:01:53,389 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 22:01:53,391 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:01:55,202 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 22:01:55,202 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:01:55,333 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 22:01:55,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-12-07 22:01:55,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [17, 4] total 25 [2019-12-07 22:01:55,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413785131] [2019-12-07 22:01:55,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 22:01:55,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:01:55,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 22:01:55,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2019-12-07 22:01:55,334 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 6 states. [2019-12-07 22:01:55,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:01:55,445 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-12-07 22:01:55,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 22:01:55,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-07 22:01:55,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:01:55,446 INFO L225 Difference]: With dead ends: 73 [2019-12-07 22:01:55,446 INFO L226 Difference]: Without dead ends: 73 [2019-12-07 22:01:55,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 55 SyntacticMatches, 51 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-12-07 22:01:55,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-12-07 22:01:55,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-12-07 22:01:55,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-12-07 22:01:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-12-07 22:01:55,448 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 58 [2019-12-07 22:01:55,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:01:55,448 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-12-07 22:01:55,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 22:01:55,449 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-12-07 22:01:55,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 22:01:55,449 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:01:55,449 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 22:01:55,650 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:01:55,650 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:01:55,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:01:55,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1315789399, now seen corresponding path program 1 times [2019-12-07 22:01:55,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:01:55,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138116255] [2019-12-07 22:01:55,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:01:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:55,784 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 22:01:55,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138116255] [2019-12-07 22:01:55,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977503012] [2019-12-07 22:01:55,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:01:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:55,835 INFO L264 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 22:01:55,836 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:01:55,858 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 22:01:55,859 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:01:55,883 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 22:01:55,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1636913632] [2019-12-07 22:01:55,884 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 22:01:55,884 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 22:01:55,884 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 22:01:55,884 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 22:01:55,884 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 22:01:56,179 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:56,186 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:56,191 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:56,304 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:56,489 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 22:01:56,657 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-12-07 22:01:57,103 WARN L192 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 101 [2019-12-07 22:01:57,508 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-12-07 22:01:58,347 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-12-07 22:01:58,737 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-12-07 22:01:58,903 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-12-07 22:01:58,904 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 22:01:58,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 22:01:58,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2019-12-07 22:01:58,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665802168] [2019-12-07 22:01:58,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 22:01:58,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:01:58,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 22:01:58,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-12-07 22:01:58,905 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 9 states. [2019-12-07 22:01:59,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:01:59,010 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2019-12-07 22:01:59,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 22:01:59,010 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-12-07 22:01:59,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:01:59,011 INFO L225 Difference]: With dead ends: 82 [2019-12-07 22:01:59,011 INFO L226 Difference]: Without dead ends: 82 [2019-12-07 22:01:59,011 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 153 SyntacticMatches, 12 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-12-07 22:01:59,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-12-07 22:01:59,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-12-07 22:01:59,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-07 22:01:59,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2019-12-07 22:01:59,013 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 59 [2019-12-07 22:01:59,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:01:59,013 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2019-12-07 22:01:59,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 22:01:59,013 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2019-12-07 22:01:59,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 22:01:59,014 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:01:59,014 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 22:01:59,214 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:01:59,215 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:01:59,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:01:59,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1486684830, now seen corresponding path program 1 times [2019-12-07 22:01:59,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:01:59,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977687553] [2019-12-07 22:01:59,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:01:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:59,254 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 22:01:59,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977687553] [2019-12-07 22:01:59,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208738997] [2019-12-07 22:01:59,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:01:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:01:59,307 INFO L264 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 22:01:59,308 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:01:59,314 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 22:01:59,314 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:01:59,329 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 22:01:59,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1611745775] [2019-12-07 22:01:59,330 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 22:01:59,330 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 22:01:59,330 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 22:01:59,330 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 22:01:59,330 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 22:01:59,603 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:59,612 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:59,636 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:59,751 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:01:59,940 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 22:02:00,079 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-12-07 22:02:00,543 WARN L192 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 101 [2019-12-07 22:02:00,901 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-12-07 22:02:01,142 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-12-07 22:02:01,745 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-12-07 22:02:02,030 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-12-07 22:02:02,386 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-12-07 22:02:02,431 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 22:02:02,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 22:02:02,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-12-07 22:02:02,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766099238] [2019-12-07 22:02:02,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 22:02:02,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:02:02,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 22:02:02,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2019-12-07 22:02:02,433 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 9 states. [2019-12-07 22:02:02,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:02:02,522 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2019-12-07 22:02:02,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 22:02:02,522 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-12-07 22:02:02,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:02:02,523 INFO L225 Difference]: With dead ends: 87 [2019-12-07 22:02:02,523 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 22:02:02,524 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 162 SyntacticMatches, 12 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2019-12-07 22:02:02,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 22:02:02,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-12-07 22:02:02,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 22:02:02,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2019-12-07 22:02:02,527 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 62 [2019-12-07 22:02:02,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:02:02,527 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2019-12-07 22:02:02,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 22:02:02,528 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2019-12-07 22:02:02,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 22:02:02,528 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:02:02,529 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 5, 5, 4, 1, 1, 1, 1] [2019-12-07 22:02:02,729 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:02:02,729 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:02:02,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:02:02,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1967891372, now seen corresponding path program 2 times [2019-12-07 22:02:02,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:02:02,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757560469] [2019-12-07 22:02:02,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:02:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:02:02,850 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 22:02:02,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757560469] [2019-12-07 22:02:02,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477905476] [2019-12-07 22:02:02,851 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/bin/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:02:02,882 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-12-07 22:02:02,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 22:02:02,883 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 22:02:02,884 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:02:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-12-07 22:02:02,938 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:02:03,043 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-12-07 22:02:03,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1585710355] [2019-12-07 22:02:03,044 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 22:02:03,044 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 22:02:03,045 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 22:02:03,045 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 22:02:03,045 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 22:02:03,336 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:02:03,343 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:02:03,349 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:02:03,455 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:02:03,636 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 22:02:03,820 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-12-07 22:02:04,244 WARN L192 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 101 [2019-12-07 22:02:04,951 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-12-07 22:02:05,102 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-12-07 22:02:05,278 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-12-07 22:02:05,279 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 22:02:05,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 22:02:05,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 15 [2019-12-07 22:02:05,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643348759] [2019-12-07 22:02:05,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 22:02:05,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:02:05,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 22:02:05,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2019-12-07 22:02:05,280 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 17 states. [2019-12-07 22:02:05,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:02:05,785 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2019-12-07 22:02:05,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 22:02:05,785 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2019-12-07 22:02:05,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:02:05,785 INFO L225 Difference]: With dead ends: 86 [2019-12-07 22:02:05,785 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 22:02:05,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 176 SyntacticMatches, 11 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 22:02:05,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 22:02:05,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-12-07 22:02:05,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-07 22:02:05,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-12-07 22:02:05,788 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 68 [2019-12-07 22:02:05,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:02:05,788 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-12-07 22:02:05,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 22:02:05,788 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2019-12-07 22:02:05,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 22:02:05,788 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:02:05,789 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2019-12-07 22:02:05,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:02:05,990 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:02:05,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:02:05,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1669390242, now seen corresponding path program 2 times [2019-12-07 22:02:05,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:02:05,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41105832] [2019-12-07 22:02:05,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:02:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:02:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 22:02:06,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41105832] [2019-12-07 22:02:06,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092317505] [2019-12-07 22:02:06,079 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/bin/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:02:06,417 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-12-07 22:02:06,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 22:02:06,419 INFO L264 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 22:02:06,420 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:02:06,455 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 28 proven. 51 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2019-12-07 22:02:06,455 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:02:06,495 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 22:02:06,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [658841984] [2019-12-07 22:02:06,495 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 22:02:06,496 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 22:02:06,496 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 22:02:06,496 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 22:02:06,496 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 22:02:06,786 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:02:06,793 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:02:06,799 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:02:06,919 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:02:07,105 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 22:02:07,248 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-12-07 22:02:07,636 WARN L192 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 101 [2019-12-07 22:02:08,395 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-12-07 22:02:08,563 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-12-07 22:02:08,605 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 22:02:08,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 22:02:08,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 9] total 17 [2019-12-07 22:02:08,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426426666] [2019-12-07 22:02:08,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 22:02:08,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:02:08,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 22:02:08,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2019-12-07 22:02:08,606 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 17 states. [2019-12-07 22:02:09,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:02:09,095 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2019-12-07 22:02:09,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 22:02:09,095 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 74 [2019-12-07 22:02:09,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:02:09,096 INFO L225 Difference]: With dead ends: 97 [2019-12-07 22:02:09,096 INFO L226 Difference]: Without dead ends: 97 [2019-12-07 22:02:09,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 191 SyntacticMatches, 16 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=312, Invalid=1020, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 22:02:09,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-07 22:02:09,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-12-07 22:02:09,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-07 22:02:09,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2019-12-07 22:02:09,099 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 74 [2019-12-07 22:02:09,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:02:09,099 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2019-12-07 22:02:09,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 22:02:09,099 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2019-12-07 22:02:09,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 22:02:09,100 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:02:09,100 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2019-12-07 22:02:09,300 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:02:09,301 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:02:09,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:02:09,301 INFO L82 PathProgramCache]: Analyzing trace with hash -681402850, now seen corresponding path program 3 times [2019-12-07 22:02:09,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:02:09,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649243911] [2019-12-07 22:02:09,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:02:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 22:02:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 22:02:09,450 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 22:02:09,450 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 22:02:09,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:02:09 BoogieIcfgContainer [2019-12-07 22:02:09,512 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 22:02:09,513 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 22:02:09,513 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 22:02:09,513 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 22:02:09,513 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:01:29" (3/4) ... [2019-12-07 22:02:09,515 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 22:02:09,567 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_df6e0fbb-d547-47bb-90c1-34cfbc32e468/bin/utaipan/witness.graphml [2019-12-07 22:02:09,567 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 22:02:09,568 INFO L168 Benchmark]: Toolchain (without parser) took 41139.74 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 372.8 MB). Free memory was 942.1 MB in the beginning and 825.4 MB in the end (delta: 116.7 MB). Peak memory consumption was 489.5 MB. Max. memory is 11.5 GB. [2019-12-07 22:02:09,568 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 959.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 22:02:09,568 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -154.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-12-07 22:02:09,569 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-12-07 22:02:09,569 INFO L168 Benchmark]: Boogie Preprocessor took 19.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2019-12-07 22:02:09,569 INFO L168 Benchmark]: RCFGBuilder took 334.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. [2019-12-07 22:02:09,569 INFO L168 Benchmark]: TraceAbstraction took 40499.57 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 273.7 MB). Free memory was 1.0 GB in the beginning and 840.6 MB in the end (delta: 209.0 MB). Peak memory consumption was 482.7 MB. Max. memory is 11.5 GB. [2019-12-07 22:02:09,569 INFO L168 Benchmark]: Witness Printer took 54.48 ms. Allocated memory is still 1.4 GB. Free memory was 840.6 MB in the beginning and 825.4 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-12-07 22:02:09,570 INFO L335 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 1.0 GB. Free memory is still 959.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 201.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -154.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 334.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 40499.57 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 273.7 MB). Free memory was 1.0 GB in the beginning and 840.6 MB in the end (delta: 209.0 MB). Peak memory consumption was 482.7 MB. Max. memory is 11.5 GB. * Witness Printer took 54.48 ms. Allocated memory is still 1.4 GB. Free memory was 840.6 MB in the beginning and 825.4 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 38]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L6] static int array[10]; [L17] static int numbers2[10]; [L36] static int numbers4[10]; [L8] int i = 0; VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L8] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L9] array[i] = i [L8] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L8] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L9] array[i] = i [L8] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L8] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L9] array[i] = i [L8] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L8] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L9] array[i] = i [L8] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L8] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L9] array[i] = i [L8] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L8] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L9] array[i] = i [L8] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L8] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L9] array[i] = i [L8] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L8] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L9] array[i] = i [L8] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L8] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L9] array[i] = i [L8] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L8] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L9] array[i] = i [L8] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L8] COND FALSE !(i < 10) [L12] return array; [L16] int* numbers = getNumbers(); [L18] int i = 0; VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L18] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L19] EXPR numbers[i] VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L18] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L19] EXPR numbers[i] VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L18] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L19] EXPR numbers[i] VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L18] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L19] EXPR numbers[i] VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L18] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L19] EXPR numbers[i] VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L18] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L19] EXPR numbers[i] VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L18] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L19] EXPR numbers[i] VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L18] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L19] EXPR numbers[i] VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L18] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L19] EXPR numbers[i] VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L18] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L19] EXPR numbers[i] VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L18] COND FALSE !(i < 10) [L21] return numbers2; [L25] int* numbers = getNumbers2(); [L26] int numbers3[10]; [L27] int i = 0; VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L27] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L28] EXPR numbers[i] VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L27] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L28] EXPR numbers[i] VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L27] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L28] EXPR numbers[i] VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L27] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L28] EXPR numbers[i] VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L27] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L28] EXPR numbers[i] VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L27] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L28] EXPR numbers[i] VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L27] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L28] EXPR numbers[i] VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L27] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L28] EXPR numbers[i] VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L27] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L28] EXPR numbers[i] VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L27] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L28] EXPR numbers[i] VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L27] COND FALSE !(i < 10) [L31] return numbers3; [L31] return numbers3; [L35] int* numbers = getNumbers3(); [L37] int i = 0; VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L37] COND TRUE i < 10 VAL [array={17:0}, numbers2={14:0}, numbers4={13:0}] [L38] numbers[i] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 17 error locations. Result: UNSAFE, OverallTime: 40.4s, OverallIterations: 23, TraceHistogramMax: 10, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 460 SDtfs, 1804 SDslu, 947 SDs, 0 SdLazy, 1603 SolverSat, 467 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1833 GetRequests, 1291 SyntacticMatches, 159 SemanticMatches, 383 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4611 ImplicationChecksByTransitivity, 25.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=22, 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, 22 MinimizatonAttempts, 46 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 1351 NumberOfCodeBlocks, 1187 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 1785 ConstructedInterpolants, 191 QuantifiedInterpolants, 614771 SizeOfPredicates, 59 NumberOfNonLiveVariables, 2521 ConjunctsInSsa, 182 ConjunctsInUnsatCore, 54 InterpolantComputations, 10 PerfectInterpolantSequences, 5579/6533 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 805, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 17, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 35, TOOLS_POST_TIME[ms]: 496, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 35, TOOLS_QUANTIFIERELIM_TIME[ms]: 489, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 104, FLUID_QUERY_TIME[ms]: 1, FLUID_QUERIES: 72, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 6, DOMAIN_JOIN_TIME[ms]: 119, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 5, DOMAIN_WIDEN_TIME[ms]: 139, DOMAIN_ISSUBSETEQ_APPLICATIONS: 8, DOMAIN_ISSUBSETEQ_TIME[ms]: 16, DOMAIN_ISBOTTOM_APPLICATIONS: 17, DOMAIN_ISBOTTOM_TIME[ms]: 23, LOOP_SUMMARIZER_APPLICATIONS: 3, LOOP_SUMMARIZER_CACHE_MISSES: 3, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 393, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 393, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 8, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 0, PATH_EXPR_TIME[ms]: 0, REGEX_TO_DAG_TIME[ms]: 0, DAG_COMPRESSION_TIME[ms]: 5, DAG_COMPRESSION_PROCESSED_NODES: 244, DAG_COMPRESSION_RETAINED_NODES: 54, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...