./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrchr-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8379ce64-ed79-41ff-b796-2866f97d960c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8379ce64-ed79-41ff-b796-2866f97d960c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8379ce64-ed79-41ff-b796-2866f97d960c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8379ce64-ed79-41ff-b796-2866f97d960c/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrchr-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8379ce64-ed79-41ff-b796-2866f97d960c/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8379ce64-ed79-41ff-b796-2866f97d960c/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 b77e20ecf2782844251cc1f0f4840606114db633 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 00:32:02,983 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:32:02,984 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:32:02,989 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:32:02,990 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:32:02,990 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:32:02,991 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:32:02,992 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:32:02,992 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:32:02,993 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:32:02,993 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:32:02,993 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:32:02,994 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:32:02,994 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:32:02,995 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:32:02,995 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:32:02,996 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:32:02,996 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:32:02,997 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:32:02,998 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:32:02,999 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:32:02,999 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:32:03,000 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:32:03,000 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:32:03,001 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:32:03,001 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:32:03,002 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:32:03,002 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:32:03,002 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:32:03,003 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:32:03,003 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:32:03,003 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:32:03,003 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:32:03,003 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:32:03,004 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:32:03,004 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:32:03,004 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8379ce64-ed79-41ff-b796-2866f97d960c/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 00:32:03,012 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:32:03,012 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:32:03,012 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:32:03,012 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:32:03,012 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 00:32:03,012 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 00:32:03,013 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 00:32:03,013 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 00:32:03,013 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 00:32:03,013 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 00:32:03,013 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 00:32:03,013 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 00:32:03,013 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 00:32:03,013 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 00:32:03,013 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 00:32:03,014 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:32:03,014 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:32:03,014 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 00:32:03,014 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:32:03,014 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:32:03,014 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:32:03,014 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 00:32:03,014 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 00:32:03,014 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 00:32:03,014 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:32:03,014 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:32:03,015 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:32:03,015 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:32:03,015 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:32:03,015 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:32:03,015 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:32:03,015 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:32:03,015 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:32:03,015 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 00:32:03,015 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:32:03,015 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 00:32:03,015 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_8379ce64-ed79-41ff-b796-2866f97d960c/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 -> b77e20ecf2782844251cc1f0f4840606114db633 [2018-12-09 00:32:03,032 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:32:03,039 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:32:03,041 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:32:03,041 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:32:03,042 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:32:03,042 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8379ce64-ed79-41ff-b796-2866f97d960c/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/cstrchr-alloca_true-valid-memsafety_true-termination.i [2018-12-09 00:32:03,078 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8379ce64-ed79-41ff-b796-2866f97d960c/bin-2019/utaipan/data/b041f5ecb/00ba706087234ee6aa3c8c152c17ad64/FLAGe245f6aae [2018-12-09 00:32:03,504 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:32:03,505 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8379ce64-ed79-41ff-b796-2866f97d960c/sv-benchmarks/c/array-memsafety/cstrchr-alloca_true-valid-memsafety_true-termination.i [2018-12-09 00:32:03,510 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8379ce64-ed79-41ff-b796-2866f97d960c/bin-2019/utaipan/data/b041f5ecb/00ba706087234ee6aa3c8c152c17ad64/FLAGe245f6aae [2018-12-09 00:32:03,518 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8379ce64-ed79-41ff-b796-2866f97d960c/bin-2019/utaipan/data/b041f5ecb/00ba706087234ee6aa3c8c152c17ad64 [2018-12-09 00:32:03,520 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:32:03,521 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:32:03,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:32:03,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:32:03,523 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:32:03,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:32:03" (1/1) ... [2018-12-09 00:32:03,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630eb73f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:03, skipping insertion in model container [2018-12-09 00:32:03,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:32:03" (1/1) ... [2018-12-09 00:32:03,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:32:03,546 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:32:03,684 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:32:03,691 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:32:03,752 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:32:03,775 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:32:03,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:03 WrapperNode [2018-12-09 00:32:03,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:32:03,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:32:03,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:32:03,776 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:32:03,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:03" (1/1) ... [2018-12-09 00:32:03,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:03" (1/1) ... [2018-12-09 00:32:03,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:32:03,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:32:03,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:32:03,795 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:32:03,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:03" (1/1) ... [2018-12-09 00:32:03,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:03" (1/1) ... [2018-12-09 00:32:03,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:03" (1/1) ... [2018-12-09 00:32:03,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:03" (1/1) ... [2018-12-09 00:32:03,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:03" (1/1) ... [2018-12-09 00:32:03,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:03" (1/1) ... [2018-12-09 00:32:03,809 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:03" (1/1) ... [2018-12-09 00:32:03,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:32:03,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:32:03,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:32:03,810 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:32:03,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8379ce64-ed79-41ff-b796-2866f97d960c/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:32:03,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 00:32:03,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 00:32:03,841 INFO L130 BoogieDeclarations]: Found specification of procedure cstrchr [2018-12-09 00:32:03,841 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrchr [2018-12-09 00:32:03,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 00:32:03,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 00:32:03,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 00:32:03,841 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 00:32:03,842 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 00:32:03,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 00:32:03,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:32:03,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:32:03,972 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:32:03,972 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 00:32:03,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:32:03 BoogieIcfgContainer [2018-12-09 00:32:03,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:32:03,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:32:03,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:32:03,974 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:32:03,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:32:03" (1/3) ... [2018-12-09 00:32:03,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f76794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:32:03, skipping insertion in model container [2018-12-09 00:32:03,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:32:03" (2/3) ... [2018-12-09 00:32:03,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f76794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:32:03, skipping insertion in model container [2018-12-09 00:32:03,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:32:03" (3/3) ... [2018-12-09 00:32:03,976 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrchr-alloca_true-valid-memsafety_true-termination.i [2018-12-09 00:32:03,982 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:32:03,986 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-12-09 00:32:03,995 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-12-09 00:32:04,009 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:32:04,009 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 00:32:04,009 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:32:04,010 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:32:04,010 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:32:04,010 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:32:04,010 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:32:04,010 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:32:04,018 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-12-09 00:32:04,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 00:32:04,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:32:04,025 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:32:04,026 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:32:04,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:32:04,029 INFO L82 PathProgramCache]: Analyzing trace with hash 73489347, now seen corresponding path program 1 times [2018-12-09 00:32:04,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:32:04,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:04,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:32:04,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:04,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:32:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:32:04,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:32:04,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:32:04,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 00:32:04,118 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:32:04,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:32:04,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:32:04,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:32:04,130 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-12-09 00:32:04,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:32:04,159 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-12-09 00:32:04,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:32:04,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-09 00:32:04,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:32:04,165 INFO L225 Difference]: With dead ends: 36 [2018-12-09 00:32:04,165 INFO L226 Difference]: Without dead ends: 33 [2018-12-09 00:32:04,166 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-12-09 00:32:04,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-09 00:32:04,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-09 00:32:04,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 00:32:04,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-12-09 00:32:04,187 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 9 [2018-12-09 00:32:04,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:32:04,187 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-12-09 00:32:04,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:32:04,187 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-12-09 00:32:04,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 00:32:04,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:32:04,187 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:32:04,188 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:32:04,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:32:04,188 INFO L82 PathProgramCache]: Analyzing trace with hash 73489348, now seen corresponding path program 1 times [2018-12-09 00:32:04,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:32:04,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:04,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:32:04,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:04,189 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:32:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:32:04,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:32:04,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:32:04,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:32:04,218 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:32:04,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:32:04,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:32:04,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:32:04,219 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 4 states. [2018-12-09 00:32:04,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:32:04,231 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-12-09 00:32:04,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:32:04,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-12-09 00:32:04,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:32:04,232 INFO L225 Difference]: With dead ends: 32 [2018-12-09 00:32:04,232 INFO L226 Difference]: Without dead ends: 32 [2018-12-09 00:32:04,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:32:04,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-09 00:32:04,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-09 00:32:04,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-09 00:32:04,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-12-09 00:32:04,234 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 9 [2018-12-09 00:32:04,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:32:04,235 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-12-09 00:32:04,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:32:04,235 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-12-09 00:32:04,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 00:32:04,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:32:04,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:32:04,235 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:32:04,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:32:04,235 INFO L82 PathProgramCache]: Analyzing trace with hash -117234863, now seen corresponding path program 1 times [2018-12-09 00:32:04,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:32:04,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:04,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:32:04,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:04,236 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:32:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:32:04,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:32:04,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:32:04,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:32:04,267 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:32:04,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:32:04,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:32:04,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:32:04,268 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 5 states. [2018-12-09 00:32:04,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:32:04,311 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-12-09 00:32:04,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:32:04,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-09 00:32:04,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:32:04,312 INFO L225 Difference]: With dead ends: 29 [2018-12-09 00:32:04,312 INFO L226 Difference]: Without dead ends: 29 [2018-12-09 00:32:04,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:32:04,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-09 00:32:04,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-09 00:32:04,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-09 00:32:04,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-12-09 00:32:04,315 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 13 [2018-12-09 00:32:04,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:32:04,315 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-12-09 00:32:04,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:32:04,315 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-12-09 00:32:04,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 00:32:04,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:32:04,315 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:32:04,316 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:32:04,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:32:04,316 INFO L82 PathProgramCache]: Analyzing trace with hash -117234862, now seen corresponding path program 1 times [2018-12-09 00:32:04,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:32:04,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:04,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:32:04,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:04,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:32:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:32:04,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:32:04,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:32:04,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:32:04,364 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:32:04,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:32:04,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:32:04,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:32:04,364 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 7 states. [2018-12-09 00:32:04,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:32:04,409 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-12-09 00:32:04,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:32:04,409 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-12-09 00:32:04,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:32:04,411 INFO L225 Difference]: With dead ends: 40 [2018-12-09 00:32:04,411 INFO L226 Difference]: Without dead ends: 40 [2018-12-09 00:32:04,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:32:04,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-09 00:32:04,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-12-09 00:32:04,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 00:32:04,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-09 00:32:04,415 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 13 [2018-12-09 00:32:04,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:32:04,415 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-09 00:32:04,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:32:04,415 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-12-09 00:32:04,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 00:32:04,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:32:04,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:32:04,416 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:32:04,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:32:04,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1322983191, now seen corresponding path program 1 times [2018-12-09 00:32:04,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:32:04,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:04,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:32:04,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:04,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:32:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:32:04,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:32:04,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:32:04,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:32:04,439 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:32:04,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:32:04,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:32:04,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:32:04,439 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 3 states. [2018-12-09 00:32:04,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:32:04,447 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-12-09 00:32:04,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:32:04,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-09 00:32:04,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:32:04,448 INFO L225 Difference]: With dead ends: 38 [2018-12-09 00:32:04,448 INFO L226 Difference]: Without dead ends: 38 [2018-12-09 00:32:04,448 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-12-09 00:32:04,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-09 00:32:04,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-09 00:32:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-09 00:32:04,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-12-09 00:32:04,450 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 17 [2018-12-09 00:32:04,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:32:04,450 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-09 00:32:04,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:32:04,451 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-12-09 00:32:04,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 00:32:04,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:32:04,451 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:32:04,451 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:32:04,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:32:04,451 INFO L82 PathProgramCache]: Analyzing trace with hash -82387354, now seen corresponding path program 1 times [2018-12-09 00:32:04,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:32:04,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:04,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:32:04,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:04,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:32:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:32:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:32:04,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:32:04,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:32:04,603 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-09 00:32:04,604 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [8], [11], [12], [15], [23], [38], [39], [43], [48], [50], [51], [54], [59], [60], [61], [63] [2018-12-09 00:32:04,624 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:32:04,625 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:32:04,717 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 00:32:04,718 INFO L272 AbstractInterpreter]: Visited 19 different actions 19 times. Never merged. Never widened. Performed 128 root evaluator evaluations with a maximum evaluation depth of 5. Performed 128 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-12-09 00:32:04,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:32:04,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 00:32:04,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:32:04,730 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8379ce64-ed79-41ff-b796-2866f97d960c/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:32:04,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:32:04,737 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:32:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:32:04,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:32:04,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 00:32:04,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 00:32:04,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:32:04,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:32:04,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:32:04,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 00:32:04,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-12-09 00:32:04,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 00:32:04,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 00:32:04,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:32:04,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:32:04,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-12-09 00:32:04,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:32:04,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:32:05,128 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-09 00:32:05,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:32:05,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-09 00:32:05,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-09 00:32:05,145 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 00:32:05,146 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:32:05,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:32:05,152 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-12-09 00:32:05,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:32:05,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:32:05,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2018-12-09 00:32:05,174 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:32:05,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 00:32:05,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 00:32:05,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2018-12-09 00:32:05,175 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 17 states. [2018-12-09 00:32:05,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:32:05,612 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2018-12-09 00:32:05,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 00:32:05,613 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2018-12-09 00:32:05,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:32:05,614 INFO L225 Difference]: With dead ends: 59 [2018-12-09 00:32:05,614 INFO L226 Difference]: Without dead ends: 59 [2018-12-09 00:32:05,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2018-12-09 00:32:05,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-09 00:32:05,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2018-12-09 00:32:05,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 00:32:05,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-12-09 00:32:05,618 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 19 [2018-12-09 00:32:05,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:32:05,619 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-12-09 00:32:05,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 00:32:05,619 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-12-09 00:32:05,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 00:32:05,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:32:05,620 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] [2018-12-09 00:32:05,620 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:32:05,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:32:05,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1785413760, now seen corresponding path program 1 times [2018-12-09 00:32:05,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:32:05,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:05,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:32:05,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:05,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:32:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:32:05,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:32:05,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:32:05,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:32:05,667 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:32:05,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:32:05,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:32:05,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:32:05,667 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 4 states. [2018-12-09 00:32:05,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:32:05,701 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-12-09 00:32:05,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:32:05,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-12-09 00:32:05,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:32:05,702 INFO L225 Difference]: With dead ends: 43 [2018-12-09 00:32:05,702 INFO L226 Difference]: Without dead ends: 35 [2018-12-09 00:32:05,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:32:05,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-09 00:32:05,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-09 00:32:05,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-09 00:32:05,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-12-09 00:32:05,703 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 23 [2018-12-09 00:32:05,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:32:05,703 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-12-09 00:32:05,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:32:05,704 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-12-09 00:32:05,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 00:32:05,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:32:05,704 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:32:05,704 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr4REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-09 00:32:05,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:32:05,704 INFO L82 PathProgramCache]: Analyzing trace with hash 841939578, now seen corresponding path program 2 times [2018-12-09 00:32:05,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:32:05,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:05,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:32:05,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:32:05,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:32:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:32:05,911 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:32:05,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:32:05,912 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:32:05,912 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 00:32:05,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 00:32:05,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:32:05,912 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8379ce64-ed79-41ff-b796-2866f97d960c/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:32:05,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 00:32:05,918 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 00:32:05,929 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 00:32:05,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:32:05,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:32:05,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 00:32:05,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:32:05,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:32:05,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 00:32:05,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 00:32:05,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-09 00:32:05,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:32:05,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:32:05,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:32:05,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-12-09 00:32:06,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-09 00:32:06,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 17 treesize of output 14 [2018-12-09 00:32:06,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:32:06,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:32:06,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:32:06,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:24 [2018-12-09 00:32:06,150 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 00:32:06,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:32:06,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-09 00:32:06,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-09 00:32:06,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:32:06,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:32:06,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:32:06,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:44 [2018-12-09 00:32:06,391 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 00:32:06,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:32:06,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2018-12-09 00:32:06,405 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:32:06,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 00:32:06,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 00:32:06,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2018-12-09 00:32:06,406 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 20 states. [2018-12-09 00:32:07,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:32:07,301 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-12-09 00:32:07,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 00:32:07,301 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 25 [2018-12-09 00:32:07,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:32:07,301 INFO L225 Difference]: With dead ends: 33 [2018-12-09 00:32:07,301 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 00:32:07,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=430, Invalid=1922, Unknown=0, NotChecked=0, Total=2352 [2018-12-09 00:32:07,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 00:32:07,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 00:32:07,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 00:32:07,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 00:32:07,303 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-12-09 00:32:07,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:32:07,303 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:32:07,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 00:32:07,303 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 00:32:07,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 00:32:07,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:32:07 BoogieIcfgContainer [2018-12-09 00:32:07,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 00:32:07,307 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:32:07,307 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:32:07,307 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:32:07,308 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:32:03" (3/4) ... [2018-12-09 00:32:07,310 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 00:32:07,315 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrchr [2018-12-09 00:32:07,315 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 00:32:07,315 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 00:32:07,319 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-12-09 00:32:07,319 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 00:32:07,319 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 00:32:07,345 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8379ce64-ed79-41ff-b796-2866f97d960c/bin-2019/utaipan/witness.graphml [2018-12-09 00:32:07,345 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:32:07,346 INFO L168 Benchmark]: Toolchain (without parser) took 3825.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.1 MB). Free memory was 947.0 MB in the beginning and 825.0 MB in the end (delta: 122.1 MB). Peak memory consumption was 340.2 MB. Max. memory is 11.5 GB. [2018-12-09 00:32:07,347 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:32:07,347 INFO L168 Benchmark]: CACSL2BoogieTranslator took 254.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -179.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:32:07,347 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.34 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-09 00:32:07,348 INFO L168 Benchmark]: Boogie Preprocessor took 14.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:32:07,348 INFO L168 Benchmark]: RCFGBuilder took 162.05 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: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2018-12-09 00:32:07,348 INFO L168 Benchmark]: TraceAbstraction took 3334.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 1.1 GB in the beginning and 825.0 MB in the end (delta: 276.4 MB). Peak memory consumption was 355.1 MB. Max. memory is 11.5 GB. [2018-12-09 00:32:07,348 INFO L168 Benchmark]: Witness Printer took 38.14 ms. Allocated memory is still 1.2 GB. Free memory was 825.0 MB in the beginning and 825.0 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-12-09 00:32:07,350 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 254.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -179.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.34 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 162.05 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: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3334.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 1.1 GB in the beginning and 825.0 MB in the end (delta: 276.4 MB). Peak memory consumption was 355.1 MB. Max. memory is 11.5 GB. * Witness Printer took 38.14 ms. Allocated memory is still 1.2 GB. Free memory was 825.0 MB in the beginning and 825.0 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 37 locations, 9 error locations. SAFE Result, 3.3s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 205 SDtfs, 361 SDslu, 549 SDs, 0 SdLazy, 642 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 19 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 204 ConstructedInterpolants, 30 QuantifiedInterpolants, 38910 SizeOfPredicates, 24 NumberOfNonLiveVariables, 190 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 6/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...