./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3db0f47f-34d9-424d-936c-46ca4e25c1d5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3db0f47f-34d9-424d-936c-46ca4e25c1d5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3db0f47f-34d9-424d-936c-46ca4e25c1d5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3db0f47f-34d9-424d-936c-46ca4e25c1d5/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3db0f47f-34d9-424d-936c-46ca4e25c1d5/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3db0f47f-34d9-424d-936c-46ca4e25c1d5/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 56b28f59847d63942ec468b0c95f39e5b8c0763a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 07:20:16,795 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:20:16,796 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:20:16,804 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:20:16,804 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:20:16,805 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:20:16,805 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:20:16,807 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:20:16,808 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:20:16,808 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:20:16,809 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:20:16,809 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:20:16,810 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:20:16,810 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:20:16,811 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:20:16,812 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:20:16,812 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:20:16,813 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:20:16,815 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:20:16,816 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:20:16,817 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:20:16,817 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:20:16,819 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:20:16,819 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:20:16,819 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:20:16,820 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:20:16,821 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:20:16,821 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:20:16,822 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:20:16,823 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:20:16,823 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:20:16,823 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:20:16,823 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:20:16,823 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:20:16,824 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:20:16,825 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:20:16,825 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3db0f47f-34d9-424d-936c-46ca4e25c1d5/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-23 07:20:16,835 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:20:16,835 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:20:16,836 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 07:20:16,836 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 07:20:16,836 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 07:20:16,836 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 07:20:16,836 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 07:20:16,837 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 07:20:16,837 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 07:20:16,837 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 07:20:16,837 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 07:20:16,837 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 07:20:16,837 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 07:20:16,838 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:20:16,838 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:20:16,838 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:20:16,838 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 07:20:16,839 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 07:20:16,839 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:20:16,839 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 07:20:16,839 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:20:16,839 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 07:20:16,839 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 07:20:16,839 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 07:20:16,840 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 07:20:16,840 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 07:20:16,840 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:20:16,840 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:20:16,840 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 07:20:16,840 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 07:20:16,840 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 07:20:16,841 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 07:20:16,841 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:20:16,841 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 07:20:16,841 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 07:20:16,841 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 07:20:16,841 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 07:20:16,841 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_3db0f47f-34d9-424d-936c-46ca4e25c1d5/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 -> 56b28f59847d63942ec468b0c95f39e5b8c0763a [2018-11-23 07:20:16,866 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:20:16,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:20:16,877 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:20:16,878 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:20:16,878 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:20:16,879 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3db0f47f-34d9-424d-936c-46ca4e25c1d5/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-11-23 07:20:16,917 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3db0f47f-34d9-424d-936c-46ca4e25c1d5/bin-2019/utaipan/data/f8f6fec82/4722e5bb0d87453792491e50b52642df/FLAG256f7bbd6 [2018-11-23 07:20:17,261 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:20:17,262 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3db0f47f-34d9-424d-936c-46ca4e25c1d5/sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-11-23 07:20:17,267 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3db0f47f-34d9-424d-936c-46ca4e25c1d5/bin-2019/utaipan/data/f8f6fec82/4722e5bb0d87453792491e50b52642df/FLAG256f7bbd6 [2018-11-23 07:20:17,675 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3db0f47f-34d9-424d-936c-46ca4e25c1d5/bin-2019/utaipan/data/f8f6fec82/4722e5bb0d87453792491e50b52642df [2018-11-23 07:20:17,678 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:20:17,679 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:20:17,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:20:17,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:20:17,682 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:20:17,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:20:17" (1/1) ... [2018-11-23 07:20:17,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e0cf10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:20:17, skipping insertion in model container [2018-11-23 07:20:17,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:20:17" (1/1) ... [2018-11-23 07:20:17,690 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:20:17,701 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:20:17,805 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:20:17,811 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:20:17,821 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:20:17,829 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:20:17,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:20:17 WrapperNode [2018-11-23 07:20:17,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:20:17,830 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:20:17,830 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:20:17,830 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:20:17,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:20:17" (1/1) ... [2018-11-23 07:20:17,840 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:20:17" (1/1) ... [2018-11-23 07:20:17,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:20:17,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:20:17,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:20:17,845 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:20:17,850 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:20:17" (1/1) ... [2018-11-23 07:20:17,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:20:17" (1/1) ... [2018-11-23 07:20:17,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:20:17" (1/1) ... [2018-11-23 07:20:17,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:20:17" (1/1) ... [2018-11-23 07:20:17,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:20:17" (1/1) ... [2018-11-23 07:20:17,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:20:17" (1/1) ... [2018-11-23 07:20:17,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:20:17" (1/1) ... [2018-11-23 07:20:17,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:20:17,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:20:17,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:20:17,896 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:20:17,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:20:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3db0f47f-34d9-424d-936c-46ca4e25c1d5/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-11-23 07:20:17,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 07:20:17,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 07:20:17,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 07:20:17,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 07:20:17,936 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-23 07:20:17,936 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-23 07:20:17,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:20:17,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:20:17,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 07:20:17,937 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 07:20:17,937 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 07:20:17,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 07:20:18,085 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:20:18,086 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 07:20:18,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:20:18 BoogieIcfgContainer [2018-11-23 07:20:18,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:20:18,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 07:20:18,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 07:20:18,089 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 07:20:18,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:20:17" (1/3) ... [2018-11-23 07:20:18,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7578598f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:20:18, skipping insertion in model container [2018-11-23 07:20:18,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:20:17" (2/3) ... [2018-11-23 07:20:18,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7578598f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:20:18, skipping insertion in model container [2018-11-23 07:20:18,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:20:18" (3/3) ... [2018-11-23 07:20:18,091 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-11-23 07:20:18,097 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 07:20:18,101 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-11-23 07:20:18,110 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-11-23 07:20:18,125 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 07:20:18,126 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 07:20:18,126 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 07:20:18,126 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 07:20:18,126 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 07:20:18,126 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 07:20:18,126 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 07:20:18,126 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 07:20:18,135 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-11-23 07:20:18,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 07:20:18,140 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:20:18,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:20:18,142 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-23 07:20:18,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:20:18,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2018-11-23 07:20:18,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:20:18,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:18,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:20:18,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:18,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:20:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:20:18,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:20:18,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:20:18,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:20:18,241 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 07:20:18,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:20:18,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:20:18,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:20:18,254 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2018-11-23 07:20:18,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:20:18,308 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-11-23 07:20:18,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:20:18,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 07:20:18,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:20:18,316 INFO L225 Difference]: With dead ends: 58 [2018-11-23 07:20:18,316 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 07:20:18,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:20:18,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 07:20:18,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2018-11-23 07:20:18,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 07:20:18,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-23 07:20:18,345 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2018-11-23 07:20:18,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:20:18,346 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-23 07:20:18,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:20:18,346 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-23 07:20:18,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 07:20:18,346 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:20:18,346 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:20:18,347 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-23 07:20:18,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:20:18,347 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2018-11-23 07:20:18,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:20:18,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:18,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:20:18,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:18,348 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:20:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:20:18,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:20:18,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:20:18,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 07:20:18,378 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 07:20:18,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:20:18,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:20:18,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:20:18,379 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 3 states. [2018-11-23 07:20:18,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:20:18,408 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-23 07:20:18,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:20:18,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-23 07:20:18,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:20:18,410 INFO L225 Difference]: With dead ends: 49 [2018-11-23 07:20:18,410 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 07:20:18,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:20:18,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 07:20:18,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2018-11-23 07:20:18,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 07:20:18,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-23 07:20:18,414 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 11 [2018-11-23 07:20:18,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:20:18,414 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-23 07:20:18,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:20:18,414 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-23 07:20:18,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 07:20:18,415 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:20:18,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:20:18,415 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-23 07:20:18,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:20:18,415 INFO L82 PathProgramCache]: Analyzing trace with hash 863296133, now seen corresponding path program 1 times [2018-11-23 07:20:18,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:20:18,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:18,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:20:18,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:18,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:20:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:20:18,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:20:18,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:20:18,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 07:20:18,460 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 07:20:18,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 07:20:18,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:20:18,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:20:18,461 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2018-11-23 07:20:18,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:20:18,513 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 07:20:18,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 07:20:18,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 07:20:18,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:20:18,513 INFO L225 Difference]: With dead ends: 40 [2018-11-23 07:20:18,513 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 07:20:18,514 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-11-23 07:20:18,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 07:20:18,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 07:20:18,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 07:20:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-23 07:20:18,516 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 12 [2018-11-23 07:20:18,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:20:18,516 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-23 07:20:18,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 07:20:18,516 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 07:20:18,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 07:20:18,517 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:20:18,517 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:20:18,517 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-23 07:20:18,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:20:18,517 INFO L82 PathProgramCache]: Analyzing trace with hash 863296134, now seen corresponding path program 1 times [2018-11-23 07:20:18,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:20:18,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:18,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:20:18,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:18,518 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:20:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:20:18,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:20:18,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:20:18,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:20:18,589 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 07:20:18,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 07:20:18,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 07:20:18,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 07:20:18,590 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2018-11-23 07:20:18,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:20:18,671 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-23 07:20:18,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:20:18,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 07:20:18,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:20:18,672 INFO L225 Difference]: With dead ends: 42 [2018-11-23 07:20:18,672 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 07:20:18,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 07:20:18,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 07:20:18,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-11-23 07:20:18,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 07:20:18,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-23 07:20:18,676 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 12 [2018-11-23 07:20:18,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:20:18,677 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 07:20:18,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 07:20:18,677 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 07:20:18,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 07:20:18,677 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:20:18,678 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:20:18,678 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-23 07:20:18,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:20:18,678 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2018-11-23 07:20:18,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:20:18,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:18,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:20:18,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:18,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:20:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:20:18,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:20:18,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:20:18,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 07:20:18,752 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 07:20:18,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 07:20:18,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 07:20:18,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 07:20:18,753 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 6 states. [2018-11-23 07:20:18,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:20:18,868 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-11-23 07:20:18,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 07:20:18,868 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 07:20:18,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:20:18,869 INFO L225 Difference]: With dead ends: 60 [2018-11-23 07:20:18,869 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 07:20:18,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:20:18,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 07:20:18,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 43. [2018-11-23 07:20:18,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 07:20:18,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-23 07:20:18,872 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 15 [2018-11-23 07:20:18,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:20:18,872 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-23 07:20:18,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 07:20:18,872 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-23 07:20:18,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 07:20:18,873 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:20:18,873 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:20:18,873 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-23 07:20:18,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:20:18,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1623425863, now seen corresponding path program 1 times [2018-11-23 07:20:18,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:20:18,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:18,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:20:18,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:18,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:20:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:20:18,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:20:18,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:20:18,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 07:20:18,923 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 07:20:18,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 07:20:18,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 07:20:18,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:20:18,924 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 7 states. [2018-11-23 07:20:18,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:20:18,995 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 07:20:18,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:20:18,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 07:20:18,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:20:18,996 INFO L225 Difference]: With dead ends: 70 [2018-11-23 07:20:18,997 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 07:20:18,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-23 07:20:18,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 07:20:19,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2018-11-23 07:20:19,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 07:20:19,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-23 07:20:19,001 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2018-11-23 07:20:19,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:20:19,002 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-23 07:20:19,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 07:20:19,002 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 07:20:19,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 07:20:19,003 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:20:19,003 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-11-23 07:20:19,003 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-23 07:20:19,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:20:19,004 INFO L82 PathProgramCache]: Analyzing trace with hash 2121234189, now seen corresponding path program 1 times [2018-11-23 07:20:19,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:20:19,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:19,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:20:19,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:19,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:20:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:20:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 07:20:19,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:20:19,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 07:20:19,043 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 07:20:19,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:20:19,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:20:19,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:20:19,043 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 3 states. [2018-11-23 07:20:19,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:20:19,053 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-11-23 07:20:19,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:20:19,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 07:20:19,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:20:19,055 INFO L225 Difference]: With dead ends: 48 [2018-11-23 07:20:19,055 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 07:20:19,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:20:19,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 07:20:19,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 07:20:19,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 07:20:19,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-11-23 07:20:19,059 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 20 [2018-11-23 07:20:19,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:20:19,060 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-23 07:20:19,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:20:19,060 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-23 07:20:19,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 07:20:19,060 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:20:19,060 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-11-23 07:20:19,061 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-23 07:20:19,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:20:19,061 INFO L82 PathProgramCache]: Analyzing trace with hash 2121234190, now seen corresponding path program 1 times [2018-11-23 07:20:19,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:20:19,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:19,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:20:19,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:19,062 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:20:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:20:19,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 07:20:19,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:20:19,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 07:20:19,104 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 07:20:19,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:20:19,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:20:19,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:20:19,105 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 3 states. [2018-11-23 07:20:19,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:20:19,120 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 07:20:19,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:20:19,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 07:20:19,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:20:19,120 INFO L225 Difference]: With dead ends: 52 [2018-11-23 07:20:19,121 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 07:20:19,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:20:19,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 07:20:19,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-11-23 07:20:19,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 07:20:19,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-23 07:20:19,125 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 20 [2018-11-23 07:20:19,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:20:19,125 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-23 07:20:19,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:20:19,125 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 07:20:19,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 07:20:19,126 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:20:19,126 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, 1, 1] [2018-11-23 07:20:19,126 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-23 07:20:19,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:20:19,126 INFO L82 PathProgramCache]: Analyzing trace with hash 2011781567, now seen corresponding path program 1 times [2018-11-23 07:20:19,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:20:19,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:19,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:20:19,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:19,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:20:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:20:19,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 07:20:19,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:20:19,154 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:20:19,155 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-11-23 07:20:19,156 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [12], [13], [16], [18], [22], [23], [27], [33], [35], [37], [38], [41], [43], [47], [55], [58], [73], [74], [75], [77], [78] [2018-11-23 07:20:19,175 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 07:20:19,175 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 07:20:19,356 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 07:20:19,357 INFO L272 AbstractInterpreter]: Visited 26 different actions 95 times. Merged at 14 different actions 42 times. Widened at 1 different actions 1 times. Performed 463 root evaluator evaluations with a maximum evaluation depth of 4. Performed 463 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 4 different actions. Largest state had 21 variables. [2018-11-23 07:20:19,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:20:19,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 07:20:19,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:20:19,372 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3db0f47f-34d9-424d-936c-46ca4e25c1d5/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-11-23 07:20:19,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:20:19,385 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 07:20:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:20:19,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:20:19,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 07:20:19,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:20:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 07:20:19,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:20:19,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-23 07:20:19,454 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:20:19,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 07:20:19,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:20:19,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:20:19,455 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2018-11-23 07:20:19,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:20:19,489 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-11-23 07:20:19,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 07:20:19,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-23 07:20:19,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:20:19,490 INFO L225 Difference]: With dead ends: 74 [2018-11-23 07:20:19,491 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 07:20:19,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:20:19,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 07:20:19,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 57. [2018-11-23 07:20:19,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 07:20:19,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-11-23 07:20:19,494 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 26 [2018-11-23 07:20:19,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:20:19,494 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-11-23 07:20:19,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 07:20:19,495 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-11-23 07:20:19,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 07:20:19,495 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:20:19,495 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-11-23 07:20:19,496 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-23 07:20:19,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:20:19,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1143280978, now seen corresponding path program 1 times [2018-11-23 07:20:19,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:20:19,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:19,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:20:19,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:19,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:20:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:20:19,560 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 07:20:19,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:20:19,561 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:20:19,561 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-23 07:20:19,561 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [12], [13], [16], [18], [22], [23], [27], [35], [37], [38], [40], [41], [43], [73], [74], [75], [77], [78] [2018-11-23 07:20:19,563 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 07:20:19,563 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 07:20:19,669 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 07:20:19,669 INFO L272 AbstractInterpreter]: Visited 23 different actions 113 times. Merged at 15 different actions 54 times. Widened at 1 different actions 1 times. Performed 592 root evaluator evaluations with a maximum evaluation depth of 4. Performed 592 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 9 fixpoints after 3 different actions. Largest state had 21 variables. [2018-11-23 07:20:19,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:20:19,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 07:20:19,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:20:19,679 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3db0f47f-34d9-424d-936c-46ca4e25c1d5/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-11-23 07:20:19,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:20:19,685 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 07:20:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:20:19,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:20:19,727 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 07:20:19,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:20:19,827 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 07:20:19,852 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 07:20:19,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 11 [2018-11-23 07:20:19,852 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 07:20:19,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 07:20:19,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 07:20:19,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-23 07:20:19,853 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 6 states. [2018-11-23 07:20:19,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:20:19,929 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-11-23 07:20:19,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:20:19,930 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-23 07:20:19,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:20:19,930 INFO L225 Difference]: With dead ends: 67 [2018-11-23 07:20:19,930 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 07:20:19,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-23 07:20:19,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 07:20:19,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2018-11-23 07:20:19,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 07:20:19,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-11-23 07:20:19,933 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 31 [2018-11-23 07:20:19,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:20:19,933 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-11-23 07:20:19,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 07:20:19,933 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-11-23 07:20:19,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 07:20:19,934 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:20:19,934 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:20:19,937 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-23 07:20:19,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:20:19,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1735380924, now seen corresponding path program 1 times [2018-11-23 07:20:19,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:20:19,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:19,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:20:19,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:19,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:20:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:20:19,985 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 07:20:19,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:20:19,985 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:20:19,985 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-11-23 07:20:19,986 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [11], [12], [13], [16], [18], [22], [23], [27], [35], [37], [38], [41], [43], [73], [74], [75], [77], [78] [2018-11-23 07:20:19,987 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 07:20:19,987 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 07:20:20,058 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 07:20:20,058 INFO L272 AbstractInterpreter]: Visited 23 different actions 109 times. Merged at 14 different actions 44 times. Never widened. Performed 563 root evaluator evaluations with a maximum evaluation depth of 4. Performed 563 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 3 different actions. Largest state had 21 variables. [2018-11-23 07:20:20,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:20:20,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 07:20:20,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:20:20,071 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3db0f47f-34d9-424d-936c-46ca4e25c1d5/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-11-23 07:20:20,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:20:20,077 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 07:20:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:20:20,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:20:20,100 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 07:20:20,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:20:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 07:20:20,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:20:20,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3, 3] total 11 [2018-11-23 07:20:20,141 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:20:20,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 07:20:20,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 07:20:20,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-23 07:20:20,142 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 10 states. [2018-11-23 07:20:20,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:20:20,244 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-11-23 07:20:20,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 07:20:20,245 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-23 07:20:20,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:20:20,245 INFO L225 Difference]: With dead ends: 73 [2018-11-23 07:20:20,245 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 07:20:20,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-11-23 07:20:20,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 07:20:20,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 55. [2018-11-23 07:20:20,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 07:20:20,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-11-23 07:20:20,250 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 32 [2018-11-23 07:20:20,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:20:20,250 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-11-23 07:20:20,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 07:20:20,250 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-11-23 07:20:20,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 07:20:20,251 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:20:20,251 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:20:20,251 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-23 07:20:20,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:20:20,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1978883467, now seen corresponding path program 2 times [2018-11-23 07:20:20,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:20:20,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:20,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:20:20,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:20,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:20:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:20:20,304 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 07:20:20,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:20:20,304 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:20:20,305 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:20:20,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:20:20,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:20:20,305 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3db0f47f-34d9-424d-936c-46ca4e25c1d5/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-11-23 07:20:20,317 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 07:20:20,317 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 07:20:20,335 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 07:20:20,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:20:20,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:20:20,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 07:20:20,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 07:20:20,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-23 07:20:20,369 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:20:20,370 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-23 07:20:20,370 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 07:20:20,375 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:20:20,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 07:20:20,382 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2018-11-23 07:20:20,491 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 07:20:20,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:20:20,562 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 07:20:20,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:20:20,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 4] total 14 [2018-11-23 07:20:20,577 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 07:20:20,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 07:20:20,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 07:20:20,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-11-23 07:20:20,578 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 6 states. [2018-11-23 07:20:20,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:20:20,616 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-11-23 07:20:20,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:20:20,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-11-23 07:20:20,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:20:20,617 INFO L225 Difference]: With dead ends: 55 [2018-11-23 07:20:20,618 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 07:20:20,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-11-23 07:20:20,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 07:20:20,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-11-23 07:20:20,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 07:20:20,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-23 07:20:20,620 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 36 [2018-11-23 07:20:20,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:20:20,620 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-23 07:20:20,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 07:20:20,620 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-23 07:20:20,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 07:20:20,621 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:20:20,621 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:20:20,621 INFO L423 AbstractCegarLoop]: === Iteration 13 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-23 07:20:20,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:20:20,622 INFO L82 PathProgramCache]: Analyzing trace with hash 785624700, now seen corresponding path program 2 times [2018-11-23 07:20:20,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:20:20,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:20,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:20:20,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:20,627 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:20:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:20:20,664 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 07:20:20,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:20:20,664 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:20:20,664 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:20:20,664 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:20:20,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:20:20,664 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3db0f47f-34d9-424d-936c-46ca4e25c1d5/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-11-23 07:20:20,671 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 07:20:20,671 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 07:20:20,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-23 07:20:20,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:20:20,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:20:20,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-23 07:20:20,689 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:20:20,690 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-23 07:20:20,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:20:20,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:20:20,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 07:20:20,701 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 07:20:20,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 07:20:20,705 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2018-11-23 07:20:20,819 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 07:20:20,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:20:20,909 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 07:20:20,928 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 07:20:20,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 12 [2018-11-23 07:20:20,928 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 07:20:20,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 07:20:20,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 07:20:20,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-23 07:20:20,929 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 6 states. [2018-11-23 07:20:20,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:20:20,966 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-11-23 07:20:20,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 07:20:20,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-11-23 07:20:20,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:20:20,967 INFO L225 Difference]: With dead ends: 53 [2018-11-23 07:20:20,967 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 07:20:20,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-23 07:20:20,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 07:20:20,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-23 07:20:20,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 07:20:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-11-23 07:20:20,970 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 42 [2018-11-23 07:20:20,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:20:20,971 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-11-23 07:20:20,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 07:20:20,971 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-11-23 07:20:20,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 07:20:20,971 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:20:20,972 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:20:20,972 INFO L423 AbstractCegarLoop]: === Iteration 14 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-23 07:20:20,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:20:20,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1268642860, now seen corresponding path program 1 times [2018-11-23 07:20:20,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:20:20,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:20,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:20:20,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:20,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:20:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:20:21,010 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 07:20:21,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:20:21,011 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:20:21,011 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-11-23 07:20:21,011 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [12], [13], [16], [18], [22], [23], [27], [33], [35], [37], [38], [41], [43], [47], [55], [56], [61], [63], [72], [73], [74], [75], [77], [78] [2018-11-23 07:20:21,012 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 07:20:21,012 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 07:20:21,083 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 07:20:21,083 INFO L272 AbstractInterpreter]: Visited 29 different actions 89 times. Merged at 14 different actions 34 times. Never widened. Performed 432 root evaluator evaluations with a maximum evaluation depth of 4. Performed 432 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 4 different actions. Largest state had 21 variables. [2018-11-23 07:20:21,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:20:21,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 07:20:21,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:20:21,095 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3db0f47f-34d9-424d-936c-46ca4e25c1d5/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:20:21,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:20:21,109 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 07:20:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:20:21,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:20:21,183 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 07:20:21,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:20:21,265 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 07:20:21,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:20:21,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 12 [2018-11-23 07:20:21,285 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:20:21,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 07:20:21,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 07:20:21,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-23 07:20:21,286 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 10 states. [2018-11-23 07:20:21,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:20:21,408 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-11-23 07:20:21,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 07:20:21,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-11-23 07:20:21,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:20:21,409 INFO L225 Difference]: With dead ends: 92 [2018-11-23 07:20:21,409 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 07:20:21,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-11-23 07:20:21,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 07:20:21,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 68. [2018-11-23 07:20:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 07:20:21,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-11-23 07:20:21,415 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 45 [2018-11-23 07:20:21,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:20:21,415 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-11-23 07:20:21,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 07:20:21,416 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-11-23 07:20:21,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 07:20:21,417 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:20:21,417 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:20:21,418 INFO L423 AbstractCegarLoop]: === Iteration 15 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-23 07:20:21,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:20:21,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1277143159, now seen corresponding path program 2 times [2018-11-23 07:20:21,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:20:21,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:21,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:20:21,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:20:21,419 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:20:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:20:21,463 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-23 07:20:21,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:20:21,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:20:21,463 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:20:21,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:20:21,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:20:21,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3db0f47f-34d9-424d-936c-46ca4e25c1d5/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:20:21,473 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 07:20:21,473 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 07:20:21,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-23 07:20:21,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:20:21,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:20:21,505 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:20:21,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-23 07:20:21,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-23 07:20:21,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:20:21,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:20:21,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 07:20:21,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-23 07:20:21,542 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:20:21,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-23 07:20:21,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-23 07:20:21,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:20:21,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:20:21,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 07:20:21,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-23 07:20:21,578 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 07:20:21,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-23 07:20:21,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-23 07:20:21,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 07:20:21,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 07:20:21,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 07:20:21,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-23 07:20:22,104 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-23 07:20:22,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:20:22,143 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-23 07:20:22,157 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 07:20:22,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [6] total 12 [2018-11-23 07:20:22,157 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 07:20:22,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 07:20:22,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 07:20:22,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=99, Unknown=1, NotChecked=0, Total=132 [2018-11-23 07:20:22,158 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 6 states. [2018-11-23 07:20:22,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:20:22,199 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-11-23 07:20:22,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:20:22,200 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-11-23 07:20:22,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:20:22,200 INFO L225 Difference]: With dead ends: 67 [2018-11-23 07:20:22,200 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 07:20:22,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 132 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=118, Unknown=1, NotChecked=0, Total=156 [2018-11-23 07:20:22,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 07:20:22,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 07:20:22,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 07:20:22,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 07:20:22,201 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2018-11-23 07:20:22,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:20:22,201 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:20:22,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 07:20:22,201 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 07:20:22,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 07:20:22,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 07:20:22 BoogieIcfgContainer [2018-11-23 07:20:22,205 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 07:20:22,205 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:20:22,205 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:20:22,205 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:20:22,206 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:20:18" (3/4) ... [2018-11-23 07:20:22,208 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 07:20:22,211 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 07:20:22,211 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2018-11-23 07:20:22,211 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 07:20:22,214 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2018-11-23 07:20:22,214 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-23 07:20:22,214 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 07:20:22,214 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 07:20:22,238 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3db0f47f-34d9-424d-936c-46ca4e25c1d5/bin-2019/utaipan/witness.graphml [2018-11-23 07:20:22,239 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:20:22,239 INFO L168 Benchmark]: Toolchain (without parser) took 4561.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.9 MB). Free memory was 959.2 MB in the beginning and 1.0 GB in the end (delta: -55.3 MB). Peak memory consumption was 136.5 MB. Max. memory is 11.5 GB. [2018-11-23 07:20:22,240 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:20:22,240 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.48 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:20:22,241 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.33 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:20:22,241 INFO L168 Benchmark]: Boogie Preprocessor took 50.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 07:20:22,241 INFO L168 Benchmark]: RCFGBuilder took 190.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-23 07:20:22,242 INFO L168 Benchmark]: TraceAbstraction took 4118.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.3 MB). Peak memory consumption was 152.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:20:22,242 INFO L168 Benchmark]: Witness Printer took 33.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:20:22,244 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 150.48 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.33 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 190.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4118.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.3 MB). Peak memory consumption was 152.4 MB. Max. memory is 11.5 GB. * Witness Printer took 33.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 8 error locations. SAFE Result, 4.0s OverallTime, 15 OverallIterations, 5 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 380 SDtfs, 505 SDslu, 705 SDs, 0 SdLazy, 908 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 648 GetRequests, 528 SyntacticMatches, 18 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 126 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 682 NumberOfCodeBlocks, 587 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 936 ConstructedInterpolants, 128 QuantifiedInterpolants, 222800 SizeOfPredicates, 13 NumberOfNonLiveVariables, 680 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 29 InterpolantComputations, 15 PerfectInterpolantSequences, 521/577 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...