./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a77c4ee2-0a40-405c-a04b-49fd389c0461/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a77c4ee2-0a40-405c-a04b-49fd389c0461/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a77c4ee2-0a40-405c-a04b-49fd389c0461/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a77c4ee2-0a40-405c-a04b-49fd389c0461/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a77c4ee2-0a40-405c-a04b-49fd389c0461/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a77c4ee2-0a40-405c-a04b-49fd389c0461/bin-2019/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 986c31897144a5b76f321e97eaa1d3383cce25ed ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 18:53:54,119 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 18:53:54,120 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 18:53:54,126 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 18:53:54,126 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 18:53:54,127 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 18:53:54,127 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 18:53:54,128 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 18:53:54,129 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 18:53:54,130 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 18:53:54,130 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 18:53:54,130 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 18:53:54,131 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 18:53:54,131 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 18:53:54,132 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 18:53:54,132 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 18:53:54,132 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 18:53:54,133 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 18:53:54,134 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 18:53:54,135 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 18:53:54,136 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 18:53:54,136 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 18:53:54,138 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 18:53:54,138 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 18:53:54,138 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 18:53:54,138 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 18:53:54,139 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 18:53:54,139 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 18:53:54,140 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 18:53:54,140 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 18:53:54,141 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 18:53:54,141 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 18:53:54,141 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 18:53:54,141 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 18:53:54,142 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 18:53:54,142 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 18:53:54,142 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a77c4ee2-0a40-405c-a04b-49fd389c0461/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 18:53:54,150 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 18:53:54,150 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 18:53:54,151 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 18:53:54,151 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 18:53:54,151 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 18:53:54,151 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 18:53:54,151 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 18:53:54,151 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 18:53:54,151 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 18:53:54,151 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 18:53:54,152 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 18:53:54,152 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 18:53:54,152 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 18:53:54,152 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 18:53:54,152 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 18:53:54,152 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 18:53:54,152 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 18:53:54,152 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 18:53:54,153 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 18:53:54,153 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 18:53:54,153 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 18:53:54,153 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 18:53:54,153 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 18:53:54,153 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 18:53:54,153 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 18:53:54,153 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 18:53:54,153 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 18:53:54,153 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 18:53:54,154 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 18:53:54,154 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 18:53:54,154 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 18:53:54,154 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 18:53:54,154 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 18:53:54,154 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 18:53:54,154 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 18:53:54,154 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 18:53:54,154 INFO L133 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/working_dir_a77c4ee2-0a40-405c-a04b-49fd389c0461/bin-2019/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 -> 986c31897144a5b76f321e97eaa1d3383cce25ed [2018-12-09 18:53:54,171 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 18:53:54,178 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 18:53:54,180 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 18:53:54,181 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 18:53:54,181 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 18:53:54,182 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a77c4ee2-0a40-405c-a04b-49fd389c0461/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i [2018-12-09 18:53:54,216 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a77c4ee2-0a40-405c-a04b-49fd389c0461/bin-2019/utaipan/data/49e39fbd3/768d78266f644789b59f68e151ea94ff/FLAGcc3540d15 [2018-12-09 18:53:54,552 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 18:53:54,552 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a77c4ee2-0a40-405c-a04b-49fd389c0461/sv-benchmarks/c/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i [2018-12-09 18:53:54,558 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a77c4ee2-0a40-405c-a04b-49fd389c0461/bin-2019/utaipan/data/49e39fbd3/768d78266f644789b59f68e151ea94ff/FLAGcc3540d15 [2018-12-09 18:53:54,566 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a77c4ee2-0a40-405c-a04b-49fd389c0461/bin-2019/utaipan/data/49e39fbd3/768d78266f644789b59f68e151ea94ff [2018-12-09 18:53:54,567 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 18:53:54,568 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 18:53:54,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 18:53:54,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 18:53:54,571 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 18:53:54,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:53:54" (1/1) ... [2018-12-09 18:53:54,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68649384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:53:54, skipping insertion in model container [2018-12-09 18:53:54,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:53:54" (1/1) ... [2018-12-09 18:53:54,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 18:53:54,595 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 18:53:54,735 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 18:53:54,742 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 18:53:54,805 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 18:53:54,824 INFO L195 MainTranslator]: Completed translation [2018-12-09 18:53:54,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:53:54 WrapperNode [2018-12-09 18:53:54,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 18:53:54,825 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 18:53:54,825 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 18:53:54,825 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 18:53:54,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:53:54" (1/1) ... [2018-12-09 18:53:54,837 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:53:54" (1/1) ... [2018-12-09 18:53:54,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 18:53:54,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 18:53:54,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 18:53:54,842 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 18:53:54,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:53:54" (1/1) ... [2018-12-09 18:53:54,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:53:54" (1/1) ... [2018-12-09 18:53:54,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:53:54" (1/1) ... [2018-12-09 18:53:54,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:53:54" (1/1) ... [2018-12-09 18:53:54,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:53:54" (1/1) ... [2018-12-09 18:53:54,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:53:54" (1/1) ... [2018-12-09 18:53:54,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:53:54" (1/1) ... [2018-12-09 18:53:54,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 18:53:54,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 18:53:54,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 18:53:54,859 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 18:53:54,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:53:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a77c4ee2-0a40-405c-a04b-49fd389c0461/bin-2019/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 [2018-12-09 18:53:54,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 18:53:54,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 18:53:54,891 INFO L130 BoogieDeclarations]: Found specification of procedure diff [2018-12-09 18:53:54,891 INFO L138 BoogieDeclarations]: Found implementation of procedure diff [2018-12-09 18:53:54,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 18:53:54,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 18:53:54,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 18:53:54,891 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 18:53:54,891 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 18:53:54,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 18:53:54,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 18:53:54,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 18:53:55,053 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 18:53:55,053 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 18:53:55,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:53:55 BoogieIcfgContainer [2018-12-09 18:53:55,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 18:53:55,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 18:53:55,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 18:53:55,057 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 18:53:55,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:53:54" (1/3) ... [2018-12-09 18:53:55,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c1de95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:53:55, skipping insertion in model container [2018-12-09 18:53:55,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:53:54" (2/3) ... [2018-12-09 18:53:55,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c1de95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:53:55, skipping insertion in model container [2018-12-09 18:53:55,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:53:55" (3/3) ... [2018-12-09 18:53:55,060 INFO L112 eAbstractionObserver]: Analyzing ICFG diff-alloca_true-valid-memsafety_true-termination.i [2018-12-09 18:53:55,068 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 18:53:55,073 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-12-09 18:53:55,082 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-12-09 18:53:55,098 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 18:53:55,099 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 18:53:55,099 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 18:53:55,099 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 18:53:55,099 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 18:53:55,099 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 18:53:55,099 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 18:53:55,099 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 18:53:55,111 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-12-09 18:53:55,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 18:53:55,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:53:55,117 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:53:55,119 INFO L423 AbstractCegarLoop]: === Iteration 1 === [diffErr4REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 18:53:55,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:53:55,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1229933401, now seen corresponding path program 1 times [2018-12-09 18:53:55,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:53:55,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:55,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:53:55,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:55,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:53:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:53:55,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:53:55,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:53:55,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:53:55,263 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:53:55,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:53:55,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:53:55,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:53:55,275 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 5 states. [2018-12-09 18:53:55,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:53:55,341 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-12-09 18:53:55,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:53:55,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-09 18:53:55,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:53:55,347 INFO L225 Difference]: With dead ends: 35 [2018-12-09 18:53:55,347 INFO L226 Difference]: Without dead ends: 32 [2018-12-09 18:53:55,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 18:53:55,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-09 18:53:55,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-09 18:53:55,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-09 18:53:55,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-12-09 18:53:55,371 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 14 [2018-12-09 18:53:55,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:53:55,371 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-09 18:53:55,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:53:55,371 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-12-09 18:53:55,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 18:53:55,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:53:55,372 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:53:55,372 INFO L423 AbstractCegarLoop]: === Iteration 2 === [diffErr4REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 18:53:55,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:53:55,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1229933400, now seen corresponding path program 1 times [2018-12-09 18:53:55,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:53:55,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:55,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:53:55,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:55,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:53:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:53:55,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:53:55,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:53:55,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 18:53:55,444 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:53:55,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 18:53:55,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 18:53:55,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 18:53:55,446 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 6 states. [2018-12-09 18:53:55,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:53:55,494 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2018-12-09 18:53:55,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 18:53:55,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-12-09 18:53:55,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:53:55,496 INFO L225 Difference]: With dead ends: 48 [2018-12-09 18:53:55,496 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 18:53:55,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 18:53:55,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 18:53:55,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2018-12-09 18:53:55,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 18:53:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2018-12-09 18:53:55,499 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 14 [2018-12-09 18:53:55,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:53:55,500 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-12-09 18:53:55,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 18:53:55,500 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2018-12-09 18:53:55,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 18:53:55,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:53:55,500 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:53:55,500 INFO L423 AbstractCegarLoop]: === Iteration 3 === [diffErr4REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 18:53:55,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:53:55,500 INFO L82 PathProgramCache]: Analyzing trace with hash 526770230, now seen corresponding path program 1 times [2018-12-09 18:53:55,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:53:55,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:55,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:53:55,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:55,501 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:53:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:53:55,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:53:55,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:53:55,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:53:55,539 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:53:55,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:53:55,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:53:55,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:53:55,540 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 5 states. [2018-12-09 18:53:55,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:53:55,573 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2018-12-09 18:53:55,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:53:55,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-12-09 18:53:55,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:53:55,574 INFO L225 Difference]: With dead ends: 38 [2018-12-09 18:53:55,574 INFO L226 Difference]: Without dead ends: 38 [2018-12-09 18:53:55,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 18:53:55,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-09 18:53:55,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-09 18:53:55,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-09 18:53:55,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2018-12-09 18:53:55,578 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 15 [2018-12-09 18:53:55,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:53:55,578 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2018-12-09 18:53:55,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:53:55,578 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2018-12-09 18:53:55,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 18:53:55,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:53:55,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:53:55,579 INFO L423 AbstractCegarLoop]: === Iteration 4 === [diffErr4REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 18:53:55,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:53:55,579 INFO L82 PathProgramCache]: Analyzing trace with hash 526770231, now seen corresponding path program 1 times [2018-12-09 18:53:55,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:53:55,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:55,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:53:55,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:55,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:53:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:53:55,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:53:55,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:53:55,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 18:53:55,642 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:53:55,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 18:53:55,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 18:53:55,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 18:53:55,643 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand 7 states. [2018-12-09 18:53:55,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:53:55,697 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2018-12-09 18:53:55,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 18:53:55,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-09 18:53:55,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:53:55,698 INFO L225 Difference]: With dead ends: 60 [2018-12-09 18:53:55,698 INFO L226 Difference]: Without dead ends: 60 [2018-12-09 18:53:55,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-09 18:53:55,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-09 18:53:55,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 46. [2018-12-09 18:53:55,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 18:53:55,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2018-12-09 18:53:55,703 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 15 [2018-12-09 18:53:55,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:53:55,703 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2018-12-09 18:53:55,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 18:53:55,703 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2018-12-09 18:53:55,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 18:53:55,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:53:55,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:53:55,704 INFO L423 AbstractCegarLoop]: === Iteration 5 === [diffErr4REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 18:53:55,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:53:55,704 INFO L82 PathProgramCache]: Analyzing trace with hash -850800739, now seen corresponding path program 1 times [2018-12-09 18:53:55,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:53:55,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:55,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:53:55,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:55,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:53:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:53:55,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:53:55,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:53:55,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 18:53:55,732 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:53:55,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:53:55,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:53:55,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:53:55,733 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. Second operand 5 states. [2018-12-09 18:53:55,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:53:55,759 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2018-12-09 18:53:55,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:53:55,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-09 18:53:55,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:53:55,760 INFO L225 Difference]: With dead ends: 54 [2018-12-09 18:53:55,760 INFO L226 Difference]: Without dead ends: 52 [2018-12-09 18:53:55,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 18:53:55,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-09 18:53:55,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2018-12-09 18:53:55,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 18:53:55,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2018-12-09 18:53:55,763 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 16 [2018-12-09 18:53:55,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:53:55,763 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2018-12-09 18:53:55,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:53:55,763 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2018-12-09 18:53:55,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 18:53:55,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:53:55,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:53:55,764 INFO L423 AbstractCegarLoop]: === Iteration 6 === [diffErr4REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 18:53:55,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:53:55,764 INFO L82 PathProgramCache]: Analyzing trace with hash -850034819, now seen corresponding path program 1 times [2018-12-09 18:53:55,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:53:55,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:55,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:53:55,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:55,765 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:53:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:53:55,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:53:55,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:53:55,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:53:55,787 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:53:55,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:53:55,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:53:55,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:53:55,788 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand 5 states. [2018-12-09 18:53:55,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:53:55,809 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2018-12-09 18:53:55,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:53:55,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-09 18:53:55,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:53:55,810 INFO L225 Difference]: With dead ends: 45 [2018-12-09 18:53:55,810 INFO L226 Difference]: Without dead ends: 45 [2018-12-09 18:53:55,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 18:53:55,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-09 18:53:55,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-09 18:53:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 18:53:55,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2018-12-09 18:53:55,813 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 16 [2018-12-09 18:53:55,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:53:55,814 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2018-12-09 18:53:55,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:53:55,814 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2018-12-09 18:53:55,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 18:53:55,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:53:55,814 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:53:55,814 INFO L423 AbstractCegarLoop]: === Iteration 7 === [diffErr4REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 18:53:55,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:53:55,815 INFO L82 PathProgramCache]: Analyzing trace with hash -850034818, now seen corresponding path program 1 times [2018-12-09 18:53:55,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:53:55,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:55,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:53:55,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:55,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:53:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:53:55,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:53:55,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:53:55,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 18:53:55,846 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:53:55,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 18:53:55,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 18:53:55,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 18:53:55,846 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand 6 states. [2018-12-09 18:53:55,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:53:55,880 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2018-12-09 18:53:55,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 18:53:55,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-12-09 18:53:55,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:53:55,882 INFO L225 Difference]: With dead ends: 54 [2018-12-09 18:53:55,882 INFO L226 Difference]: Without dead ends: 54 [2018-12-09 18:53:55,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-09 18:53:55,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-09 18:53:55,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2018-12-09 18:53:55,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 18:53:55,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2018-12-09 18:53:55,885 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 16 [2018-12-09 18:53:55,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:53:55,885 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2018-12-09 18:53:55,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 18:53:55,885 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2018-12-09 18:53:55,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 18:53:55,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:53:55,886 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:53:55,886 INFO L423 AbstractCegarLoop]: === Iteration 8 === [diffErr4REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 18:53:55,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:53:55,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1014008751, now seen corresponding path program 1 times [2018-12-09 18:53:55,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:53:55,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:55,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:53:55,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:55,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:53:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:53:55,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:53:55,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:53:55,937 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:53:55,938 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-09 18:53:55,939 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [14], [23], [24], [27], [29], [34], [57], [60], [66], [70], [75], [76], [77], [79] [2018-12-09 18:53:55,959 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:53:55,959 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:53:56,113 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:53:56,114 INFO L272 AbstractInterpreter]: Visited 17 different actions 37 times. Merged at 5 different actions 20 times. Never widened. Performed 364 root evaluator evaluations with a maximum evaluation depth of 4. Performed 364 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 35 variables. [2018-12-09 18:53:56,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:53:56,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:53:56,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:53:56,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a77c4ee2-0a40-405c-a04b-49fd389c0461/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:53:56,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:53:56,128 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:53:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:53:56,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:53:56,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:53:56,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:53:56,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:53:56,258 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 18:53:56,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 14 [2018-12-09 18:53:56,258 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:53:56,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 18:53:56,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 18:53:56,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-12-09 18:53:56,259 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand 7 states. [2018-12-09 18:53:56,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:53:56,317 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2018-12-09 18:53:56,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 18:53:56,318 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-12-09 18:53:56,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:53:56,318 INFO L225 Difference]: With dead ends: 91 [2018-12-09 18:53:56,318 INFO L226 Difference]: Without dead ends: 91 [2018-12-09 18:53:56,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-12-09 18:53:56,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-09 18:53:56,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 73. [2018-12-09 18:53:56,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-09 18:53:56,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 97 transitions. [2018-12-09 18:53:56,322 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 97 transitions. Word has length 19 [2018-12-09 18:53:56,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:53:56,322 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 97 transitions. [2018-12-09 18:53:56,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 18:53:56,322 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 97 transitions. [2018-12-09 18:53:56,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 18:53:56,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:53:56,323 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:53:56,323 INFO L423 AbstractCegarLoop]: === Iteration 9 === [diffErr4REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 18:53:56,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:53:56,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1272174189, now seen corresponding path program 1 times [2018-12-09 18:53:56,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:53:56,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:56,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:53:56,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:56,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:53:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:53:56,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:53:56,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:53:56,377 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:53:56,377 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-09 18:53:56,378 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [14], [23], [24], [27], [29], [34], [57], [60], [68], [70], [75], [76], [77], [79] [2018-12-09 18:53:56,379 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:53:56,379 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:53:56,416 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:53:56,416 INFO L272 AbstractInterpreter]: Visited 17 different actions 32 times. Merged at 5 different actions 15 times. Never widened. Performed 310 root evaluator evaluations with a maximum evaluation depth of 4. Performed 310 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 35 variables. [2018-12-09 18:53:56,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:53:56,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:53:56,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:53:56,418 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a77c4ee2-0a40-405c-a04b-49fd389c0461/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:53:56,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:53:56,424 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:53:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:53:56,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:53:56,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:53:56,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-09 18:53:56,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:53:56,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:53:56,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 18:53:56,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:53:56,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:53:56,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-09 18:53:56,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-09 18:53:56,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-12-09 18:53:56,505 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 18:53:56,516 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:53:56,520 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:53:56,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 18:53:56,531 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2018-12-09 18:53:56,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:53:56,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:53:56,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:53:56,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:53:56,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2018-12-09 18:53:56,854 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:53:56,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 18:53:56,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 18:53:56,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-12-09 18:53:56,855 INFO L87 Difference]: Start difference. First operand 73 states and 97 transitions. Second operand 14 states. [2018-12-09 18:53:57,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:53:57,109 INFO L93 Difference]: Finished difference Result 109 states and 144 transitions. [2018-12-09 18:53:57,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 18:53:57,110 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2018-12-09 18:53:57,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:53:57,110 INFO L225 Difference]: With dead ends: 109 [2018-12-09 18:53:57,111 INFO L226 Difference]: Without dead ends: 109 [2018-12-09 18:53:57,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2018-12-09 18:53:57,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-09 18:53:57,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 64. [2018-12-09 18:53:57,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-09 18:53:57,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 82 transitions. [2018-12-09 18:53:57,114 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 82 transitions. Word has length 19 [2018-12-09 18:53:57,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:53:57,114 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 82 transitions. [2018-12-09 18:53:57,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 18:53:57,115 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2018-12-09 18:53:57,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 18:53:57,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:53:57,115 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:53:57,115 INFO L423 AbstractCegarLoop]: === Iteration 10 === [diffErr4REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 18:53:57,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:53:57,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1367610372, now seen corresponding path program 1 times [2018-12-09 18:53:57,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:53:57,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:57,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:53:57,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:57,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:53:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:53:57,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:53:57,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:53:57,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:53:57,134 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:53:57,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:53:57,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:53:57,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:53:57,135 INFO L87 Difference]: Start difference. First operand 64 states and 82 transitions. Second operand 4 states. [2018-12-09 18:53:57,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:53:57,152 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2018-12-09 18:53:57,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:53:57,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-09 18:53:57,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:53:57,153 INFO L225 Difference]: With dead ends: 86 [2018-12-09 18:53:57,153 INFO L226 Difference]: Without dead ends: 86 [2018-12-09 18:53:57,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:53:57,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-09 18:53:57,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 66. [2018-12-09 18:53:57,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-09 18:53:57,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2018-12-09 18:53:57,156 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 20 [2018-12-09 18:53:57,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:53:57,157 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2018-12-09 18:53:57,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:53:57,157 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2018-12-09 18:53:57,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 18:53:57,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:53:57,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:53:57,157 INFO L423 AbstractCegarLoop]: === Iteration 11 === [diffErr4REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 18:53:57,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:53:57,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1369457414, now seen corresponding path program 1 times [2018-12-09 18:53:57,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:53:57,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:57,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:53:57,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:57,158 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:53:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:53:57,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 18:53:57,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:53:57,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 18:53:57,190 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:53:57,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 18:53:57,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 18:53:57,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 18:53:57,190 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand 6 states. [2018-12-09 18:53:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:53:57,227 INFO L93 Difference]: Finished difference Result 98 states and 123 transitions. [2018-12-09 18:53:57,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 18:53:57,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-09 18:53:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:53:57,228 INFO L225 Difference]: With dead ends: 98 [2018-12-09 18:53:57,228 INFO L226 Difference]: Without dead ends: 98 [2018-12-09 18:53:57,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 18:53:57,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-09 18:53:57,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2018-12-09 18:53:57,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-09 18:53:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 117 transitions. [2018-12-09 18:53:57,233 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 117 transitions. Word has length 20 [2018-12-09 18:53:57,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:53:57,233 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 117 transitions. [2018-12-09 18:53:57,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 18:53:57,233 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 117 transitions. [2018-12-09 18:53:57,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 18:53:57,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:53:57,234 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:53:57,234 INFO L423 AbstractCegarLoop]: === Iteration 12 === [diffErr4REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 18:53:57,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:53:57,235 INFO L82 PathProgramCache]: Analyzing trace with hash 22153541, now seen corresponding path program 1 times [2018-12-09 18:53:57,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:53:57,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:57,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:53:57,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:57,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:53:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:53:57,284 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:53:57,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:53:57,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:53:57,284 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-09 18:53:57,284 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [14], [21], [23], [24], [26], [27], [32], [50], [52], [57], [60], [66], [70], [75], [76], [77], [79] [2018-12-09 18:53:57,285 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:53:57,285 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:53:57,306 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:53:57,306 INFO L272 AbstractInterpreter]: Visited 20 different actions 24 times. Merged at 3 different actions 3 times. Never widened. Performed 201 root evaluator evaluations with a maximum evaluation depth of 4. Performed 201 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 35 variables. [2018-12-09 18:53:57,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:53:57,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:53:57,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:53:57,307 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a77c4ee2-0a40-405c-a04b-49fd389c0461/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:53:57,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:53:57,313 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:53:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:53:57,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:53:57,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 18:53:57,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:53:57,380 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 18:53:57,396 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 18:53:57,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [8] total 13 [2018-12-09 18:53:57,396 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:53:57,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 18:53:57,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 18:53:57,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-12-09 18:53:57,397 INFO L87 Difference]: Start difference. First operand 90 states and 117 transitions. Second operand 6 states. [2018-12-09 18:53:57,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:53:57,436 INFO L93 Difference]: Finished difference Result 136 states and 168 transitions. [2018-12-09 18:53:57,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 18:53:57,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-09 18:53:57,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:53:57,436 INFO L225 Difference]: With dead ends: 136 [2018-12-09 18:53:57,437 INFO L226 Difference]: Without dead ends: 136 [2018-12-09 18:53:57,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-12-09 18:53:57,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-09 18:53:57,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 129. [2018-12-09 18:53:57,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-09 18:53:57,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 162 transitions. [2018-12-09 18:53:57,442 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 162 transitions. Word has length 22 [2018-12-09 18:53:57,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:53:57,442 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 162 transitions. [2018-12-09 18:53:57,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 18:53:57,442 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 162 transitions. [2018-12-09 18:53:57,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 18:53:57,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:53:57,443 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:53:57,443 INFO L423 AbstractCegarLoop]: === Iteration 13 === [diffErr4REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 18:53:57,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:53:57,443 INFO L82 PathProgramCache]: Analyzing trace with hash -998914813, now seen corresponding path program 1 times [2018-12-09 18:53:57,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:53:57,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:57,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:53:57,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:57,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:53:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:53:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:53:57,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:53:57,517 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:53:57,517 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-09 18:53:57,517 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [14], [21], [23], [24], [26], [27], [32], [50], [52], [57], [62], [66], [70], [75], [76], [77], [79] [2018-12-09 18:53:57,518 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:53:57,519 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:53:57,565 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:53:57,565 INFO L272 AbstractInterpreter]: Visited 20 different actions 42 times. Merged at 9 different actions 19 times. Widened at 1 different actions 1 times. Performed 328 root evaluator evaluations with a maximum evaluation depth of 4. Performed 328 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 3 different actions. Largest state had 35 variables. [2018-12-09 18:53:57,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:53:57,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:53:57,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:53:57,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a77c4ee2-0a40-405c-a04b-49fd389c0461/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:53:57,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:53:57,580 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:53:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:53:57,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:53:57,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:53:57,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-09 18:53:57,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:53:57,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:53:57,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 18:53:57,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:53:57,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:53:57,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-09 18:53:57,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-09 18:53:57,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-12-09 18:53:57,645 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 18:53:57,652 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:53:57,656 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:53:57,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 18:53:57,665 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2018-12-09 18:53:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:53:57,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:53:57,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:53:57,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:53:57,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2018-12-09 18:53:57,963 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:53:57,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 18:53:57,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 18:53:57,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-12-09 18:53:57,963 INFO L87 Difference]: Start difference. First operand 129 states and 162 transitions. Second operand 15 states. [2018-12-09 18:53:58,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:53:58,312 INFO L93 Difference]: Finished difference Result 161 states and 192 transitions. [2018-12-09 18:53:58,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 18:53:58,313 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-12-09 18:53:58,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:53:58,313 INFO L225 Difference]: With dead ends: 161 [2018-12-09 18:53:58,313 INFO L226 Difference]: Without dead ends: 161 [2018-12-09 18:53:58,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=516, Unknown=0, NotChecked=0, Total=702 [2018-12-09 18:53:58,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-09 18:53:58,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 113. [2018-12-09 18:53:58,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-09 18:53:58,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 135 transitions. [2018-12-09 18:53:58,317 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 135 transitions. Word has length 22 [2018-12-09 18:53:58,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:53:58,317 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 135 transitions. [2018-12-09 18:53:58,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 18:53:58,317 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2018-12-09 18:53:58,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 18:53:58,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:53:58,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:53:58,318 INFO L423 AbstractCegarLoop]: === Iteration 14 === [diffErr4REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 18:53:58,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:53:58,318 INFO L82 PathProgramCache]: Analyzing trace with hash -186093318, now seen corresponding path program 1 times [2018-12-09 18:53:58,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:53:58,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:58,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:53:58,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:58,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:53:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:53:58,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 18:53:58,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:53:58,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 18:53:58,361 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:53:58,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 18:53:58,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 18:53:58,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 18:53:58,362 INFO L87 Difference]: Start difference. First operand 113 states and 135 transitions. Second operand 6 states. [2018-12-09 18:53:58,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:53:58,407 INFO L93 Difference]: Finished difference Result 128 states and 152 transitions. [2018-12-09 18:53:58,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 18:53:58,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-12-09 18:53:58,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:53:58,408 INFO L225 Difference]: With dead ends: 128 [2018-12-09 18:53:58,408 INFO L226 Difference]: Without dead ends: 71 [2018-12-09 18:53:58,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-09 18:53:58,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-09 18:53:58,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2018-12-09 18:53:58,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-09 18:53:58,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2018-12-09 18:53:58,410 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 24 [2018-12-09 18:53:58,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:53:58,410 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2018-12-09 18:53:58,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 18:53:58,410 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2018-12-09 18:53:58,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 18:53:58,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:53:58,411 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:53:58,411 INFO L423 AbstractCegarLoop]: === Iteration 15 === [diffErr4REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr5REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-12-09 18:53:58,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:53:58,411 INFO L82 PathProgramCache]: Analyzing trace with hash 807818761, now seen corresponding path program 1 times [2018-12-09 18:53:58,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:53:58,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:58,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:53:58,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:53:58,412 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:53:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:53:58,497 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 18:53:58,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:53:58,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:53:58,498 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-12-09 18:53:58,498 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [14], [21], [23], [24], [27], [34], [41], [42], [45], [47], [48], [52], [57], [62], [66], [70], [75], [76], [77], [79] [2018-12-09 18:53:58,499 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:53:58,499 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:53:58,547 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:53:58,547 INFO L272 AbstractInterpreter]: Visited 23 different actions 58 times. Merged at 12 different actions 32 times. Widened at 1 different actions 1 times. Performed 475 root evaluator evaluations with a maximum evaluation depth of 4. Performed 475 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 5 fixpoints after 3 different actions. Largest state had 38 variables. [2018-12-09 18:53:58,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:53:58,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:53:58,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:53:58,549 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a77c4ee2-0a40-405c-a04b-49fd389c0461/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:53:58,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:53:58,555 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:53:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:53:58,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:53:58,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-09 18:53:58,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 27 [2018-12-09 18:53:58,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 22 [2018-12-09 18:53:58,604 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 18:53:58,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 38 [2018-12-09 18:53:58,638 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-12-09 18:53:58,664 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-09 18:53:58,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 18:53:58,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-09 18:53:58,696 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:22, output treesize:62 [2018-12-09 18:53:58,829 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 18:53:58,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:53:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 18:53:58,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:53:58,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2018-12-09 18:53:58,941 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:53:58,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 18:53:58,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 18:53:58,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2018-12-09 18:53:58,942 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 16 states. [2018-12-09 18:53:59,248 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2018-12-09 18:53:59,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:53:59,499 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2018-12-09 18:53:59,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 18:53:59,499 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-12-09 18:53:59,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:53:59,499 INFO L225 Difference]: With dead ends: 100 [2018-12-09 18:53:59,499 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 18:53:59,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=177, Invalid=693, Unknown=0, NotChecked=0, Total=870 [2018-12-09 18:53:59,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 18:53:59,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 18:53:59,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 18:53:59,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 18:53:59,501 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-12-09 18:53:59,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:53:59,501 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 18:53:59,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 18:53:59,501 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 18:53:59,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 18:53:59,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:53:59 BoogieIcfgContainer [2018-12-09 18:53:59,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 18:53:59,505 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 18:53:59,505 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 18:53:59,505 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 18:53:59,505 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:53:55" (3/4) ... [2018-12-09 18:53:59,507 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 18:53:59,511 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 18:53:59,511 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure diff [2018-12-09 18:53:59,511 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 18:53:59,514 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2018-12-09 18:53:59,514 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-12-09 18:53:59,514 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-09 18:53:59,541 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a77c4ee2-0a40-405c-a04b-49fd389c0461/bin-2019/utaipan/witness.graphml [2018-12-09 18:53:59,541 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 18:53:59,542 INFO L168 Benchmark]: Toolchain (without parser) took 4974.01 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 282.1 MB). Free memory was 953.4 MB in the beginning and 1.1 GB in the end (delta: -185.7 MB). Peak memory consumption was 96.4 MB. Max. memory is 11.5 GB. [2018-12-09 18:53:59,542 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 18:53:59,542 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 953.4 MB in the beginning and 1.1 GB in the end (delta: -141.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-09 18:53:59,543 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 18:53:59,543 INFO L168 Benchmark]: Boogie Preprocessor took 16.72 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 18:53:59,543 INFO L168 Benchmark]: RCFGBuilder took 194.52 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: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2018-12-09 18:53:59,543 INFO L168 Benchmark]: TraceAbstraction took 4450.57 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 170.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -79.6 MB). Peak memory consumption was 90.8 MB. Max. memory is 11.5 GB. [2018-12-09 18:53:59,543 INFO L168 Benchmark]: Witness Printer took 36.55 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2018-12-09 18:53:59,545 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 255.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 953.4 MB in the beginning and 1.1 GB in the end (delta: -141.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.72 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 194.52 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: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4450.57 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 170.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -79.6 MB). Peak memory consumption was 90.8 MB. Max. memory is 11.5 GB. * Witness Printer took 36.55 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 558]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 37 locations, 9 error locations. SAFE Result, 4.4s OverallTime, 15 OverallIterations, 2 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 419 SDtfs, 944 SDslu, 1158 SDs, 0 SdLazy, 845 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 351 GetRequests, 192 SyntacticMatches, 9 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 188 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 396 NumberOfCodeBlocks, 396 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 484 ConstructedInterpolants, 61 QuantifiedInterpolants, 105401 SizeOfPredicates, 51 NumberOfNonLiveVariables, 771 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 25 InterpolantComputations, 14 PerfectInterpolantSequences, 35/91 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...