./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-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_5aebc93c-3b8a-41f2-911d-353d903d9dca/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5aebc93c-3b8a-41f2-911d-353d903d9dca/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5aebc93c-3b8a-41f2-911d-353d903d9dca/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5aebc93c-3b8a-41f2-911d-353d903d9dca/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5aebc93c-3b8a-41f2-911d-353d903d9dca/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5aebc93c-3b8a-41f2-911d-353d903d9dca/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bae2699bcd2830a9f6fd8179c1786410249a39fb ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 07:51:58,845 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 07:51:58,846 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 07:51:58,852 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 07:51:58,852 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 07:51:58,853 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 07:51:58,853 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 07:51:58,854 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 07:51:58,855 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 07:51:58,855 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 07:51:58,856 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 07:51:58,856 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 07:51:58,856 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 07:51:58,857 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 07:51:58,857 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 07:51:58,858 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 07:51:58,858 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 07:51:58,859 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 07:51:58,860 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 07:51:58,861 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 07:51:58,861 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 07:51:58,862 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 07:51:58,863 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 07:51:58,863 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 07:51:58,863 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 07:51:58,864 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 07:51:58,864 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 07:51:58,865 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 07:51:58,865 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 07:51:58,866 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 07:51:58,866 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 07:51:58,866 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 07:51:58,866 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 07:51:58,866 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 07:51:58,867 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 07:51:58,867 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 07:51:58,867 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5aebc93c-3b8a-41f2-911d-353d903d9dca/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-01 07:51:58,874 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 07:51:58,874 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 07:51:58,875 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 07:51:58,875 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 07:51:58,875 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 07:51:58,875 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 07:51:58,875 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 07:51:58,875 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 07:51:58,876 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 07:51:58,876 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 07:51:58,876 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 07:51:58,876 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 07:51:58,876 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 07:51:58,876 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-01 07:51:58,876 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-01 07:51:58,876 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-01 07:51:58,876 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 07:51:58,876 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 07:51:58,876 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 07:51:58,876 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 07:51:58,877 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 07:51:58,877 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 07:51:58,877 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 07:51:58,877 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 07:51:58,877 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 07:51:58,877 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 07:51:58,877 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 07:51:58,877 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 07:51:58,877 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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_5aebc93c-3b8a-41f2-911d-353d903d9dca/bin-2019/uautomizer 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 -> Automizer 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 -> bae2699bcd2830a9f6fd8179c1786410249a39fb [2018-12-01 07:51:58,895 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 07:51:58,904 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 07:51:58,907 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 07:51:58,908 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 07:51:58,908 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 07:51:58,909 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5aebc93c-3b8a-41f2-911d-353d903d9dca/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-12-01 07:51:58,949 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5aebc93c-3b8a-41f2-911d-353d903d9dca/bin-2019/uautomizer/data/d51d9b0b8/bee1480bd6644ba28f84e57875cb0581/FLAG33f91b7a0 [2018-12-01 07:51:59,353 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 07:51:59,353 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5aebc93c-3b8a-41f2-911d-353d903d9dca/sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-12-01 07:51:59,359 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5aebc93c-3b8a-41f2-911d-353d903d9dca/bin-2019/uautomizer/data/d51d9b0b8/bee1480bd6644ba28f84e57875cb0581/FLAG33f91b7a0 [2018-12-01 07:51:59,367 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5aebc93c-3b8a-41f2-911d-353d903d9dca/bin-2019/uautomizer/data/d51d9b0b8/bee1480bd6644ba28f84e57875cb0581 [2018-12-01 07:51:59,369 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 07:51:59,370 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-01 07:51:59,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 07:51:59,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 07:51:59,372 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 07:51:59,373 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:51:59" (1/1) ... [2018-12-01 07:51:59,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25c26117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:51:59, skipping insertion in model container [2018-12-01 07:51:59,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 07:51:59" (1/1) ... [2018-12-01 07:51:59,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 07:51:59,397 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 07:51:59,538 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 07:51:59,544 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 07:51:59,608 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 07:51:59,632 INFO L195 MainTranslator]: Completed translation [2018-12-01 07:51:59,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:51:59 WrapperNode [2018-12-01 07:51:59,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 07:51:59,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 07:51:59,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 07:51:59,633 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 07:51:59,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:51:59" (1/1) ... [2018-12-01 07:51:59,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:51:59" (1/1) ... [2018-12-01 07:51:59,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:51:59" (1/1) ... [2018-12-01 07:51:59,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:51:59" (1/1) ... [2018-12-01 07:51:59,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:51:59" (1/1) ... [2018-12-01 07:51:59,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:51:59" (1/1) ... [2018-12-01 07:51:59,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:51:59" (1/1) ... [2018-12-01 07:51:59,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 07:51:59,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 07:51:59,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 07:51:59,661 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 07:51:59,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:51:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5aebc93c-3b8a-41f2-911d-353d903d9dca/bin-2019/uautomizer/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-01 07:51:59,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 07:51:59,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 07:51:59,693 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-01 07:51:59,693 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-01 07:51:59,693 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrspn [2018-12-01 07:51:59,693 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 07:51:59,694 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-01 07:51:59,694 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-01 07:51:59,694 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-01 07:51:59,694 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-01 07:51:59,694 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-01 07:51:59,694 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-01 07:51:59,694 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-01 07:51:59,694 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-01 07:51:59,694 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-01 07:51:59,694 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-01 07:51:59,694 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-01 07:51:59,694 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-01 07:51:59,694 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-01 07:51:59,694 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-01 07:51:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-01 07:51:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-01 07:51:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-01 07:51:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-01 07:51:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-01 07:51:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-01 07:51:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-01 07:51:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-01 07:51:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-01 07:51:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-01 07:51:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-01 07:51:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-01 07:51:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-01 07:51:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-01 07:51:59,696 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-01 07:51:59,696 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-01 07:51:59,696 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-01 07:51:59,696 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-01 07:51:59,696 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-01 07:51:59,696 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-01 07:51:59,696 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-01 07:51:59,696 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-01 07:51:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-01 07:51:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-01 07:51:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-01 07:51:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-01 07:51:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-01 07:51:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-01 07:51:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-01 07:51:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-01 07:51:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-01 07:51:59,698 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-01 07:51:59,698 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-01 07:51:59,698 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-01 07:51:59,698 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-01 07:51:59,698 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-01 07:51:59,698 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-01 07:51:59,698 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-01 07:51:59,699 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-01 07:51:59,699 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-01 07:51:59,699 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-01 07:51:59,699 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-01 07:51:59,699 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-01 07:51:59,699 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-01 07:51:59,699 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-01 07:51:59,699 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-01 07:51:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-01 07:51:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-01 07:51:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-01 07:51:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-01 07:51:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-01 07:51:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-01 07:51:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-01 07:51:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-01 07:51:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-01 07:51:59,701 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-01 07:51:59,701 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-01 07:51:59,701 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-01 07:51:59,701 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-01 07:51:59,701 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-01 07:51:59,701 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-01 07:51:59,701 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-01 07:51:59,701 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-01 07:51:59,701 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-01 07:51:59,702 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-01 07:51:59,702 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-01 07:51:59,702 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-01 07:51:59,702 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-01 07:51:59,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-01 07:51:59,702 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-01 07:51:59,702 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-01 07:51:59,702 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-01 07:51:59,702 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-01 07:51:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-01 07:51:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-01 07:51:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-01 07:51:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-01 07:51:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-01 07:51:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-01 07:51:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-01 07:51:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-01 07:51:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-01 07:51:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-01 07:51:59,704 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-01 07:51:59,704 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-01 07:51:59,704 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-01 07:51:59,704 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-01 07:51:59,704 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-01 07:51:59,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-01 07:51:59,704 INFO L130 BoogieDeclarations]: Found specification of procedure cstrspn [2018-12-01 07:51:59,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 07:51:59,704 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 07:51:59,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 07:51:59,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 07:51:59,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 07:51:59,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 07:51:59,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 07:51:59,913 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 07:51:59,914 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-01 07:51:59,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:51:59 BoogieIcfgContainer [2018-12-01 07:51:59,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 07:51:59,914 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 07:51:59,915 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 07:51:59,916 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 07:51:59,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 07:51:59" (1/3) ... [2018-12-01 07:51:59,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bfafe74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 07:51:59, skipping insertion in model container [2018-12-01 07:51:59,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 07:51:59" (2/3) ... [2018-12-01 07:51:59,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bfafe74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 07:51:59, skipping insertion in model container [2018-12-01 07:51:59,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:51:59" (3/3) ... [2018-12-01 07:51:59,918 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-12-01 07:51:59,925 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 07:51:59,930 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-12-01 07:51:59,940 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-12-01 07:51:59,955 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 07:51:59,956 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 07:51:59,956 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-01 07:51:59,956 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 07:51:59,956 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 07:51:59,956 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 07:51:59,956 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 07:51:59,956 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 07:51:59,956 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 07:51:59,964 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-12-01 07:51:59,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-01 07:51:59,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 07:51:59,970 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 07:51:59,972 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2018-12-01 07:51:59,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:51:59,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1015483689, now seen corresponding path program 1 times [2018-12-01 07:51:59,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 07:51:59,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 07:52:00,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:00,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 07:52:00,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:52:00,079 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-01 07:52:00,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 07:52:00,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 07:52:00,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 07:52:00,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 07:52:00,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 07:52:00,092 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2018-12-01 07:52:00,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 07:52:00,121 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-12-01 07:52:00,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 07:52:00,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-01 07:52:00,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 07:52:00,127 INFO L225 Difference]: With dead ends: 37 [2018-12-01 07:52:00,127 INFO L226 Difference]: Without dead ends: 34 [2018-12-01 07:52:00,128 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-01 07:52:00,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-01 07:52:00,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-01 07:52:00,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-01 07:52:00,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-12-01 07:52:00,148 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 10 [2018-12-01 07:52:00,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 07:52:00,149 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-12-01 07:52:00,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 07:52:00,149 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-12-01 07:52:00,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-01 07:52:00,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 07:52:00,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 07:52:00,149 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2018-12-01 07:52:00,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:52:00,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1015483690, now seen corresponding path program 1 times [2018-12-01 07:52:00,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 07:52:00,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 07:52:00,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:00,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 07:52:00,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:52:00,186 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-01 07:52:00,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 07:52:00,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 07:52:00,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 07:52:00,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 07:52:00,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 07:52:00,187 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 4 states. [2018-12-01 07:52:00,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 07:52:00,201 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-12-01 07:52:00,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 07:52:00,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-01 07:52:00,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 07:52:00,202 INFO L225 Difference]: With dead ends: 33 [2018-12-01 07:52:00,202 INFO L226 Difference]: Without dead ends: 33 [2018-12-01 07:52:00,202 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-01 07:52:00,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-01 07:52:00,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-01 07:52:00,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-01 07:52:00,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-12-01 07:52:00,205 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 10 [2018-12-01 07:52:00,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 07:52:00,205 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-12-01 07:52:00,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 07:52:00,205 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-12-01 07:52:00,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 07:52:00,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 07:52:00,205 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 07:52:00,205 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2018-12-01 07:52:00,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:52:00,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1415223278, now seen corresponding path program 1 times [2018-12-01 07:52:00,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 07:52:00,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 07:52:00,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:00,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 07:52:00,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:52:00,225 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-01 07:52:00,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 07:52:00,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 07:52:00,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 07:52:00,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 07:52:00,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 07:52:00,226 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 3 states. [2018-12-01 07:52:00,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 07:52:00,240 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-12-01 07:52:00,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 07:52:00,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-01 07:52:00,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 07:52:00,240 INFO L225 Difference]: With dead ends: 32 [2018-12-01 07:52:00,240 INFO L226 Difference]: Without dead ends: 32 [2018-12-01 07:52:00,241 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-01 07:52:00,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-01 07:52:00,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-01 07:52:00,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-01 07:52:00,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-12-01 07:52:00,243 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 11 [2018-12-01 07:52:00,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 07:52:00,243 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-12-01 07:52:00,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 07:52:00,243 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-12-01 07:52:00,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 07:52:00,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 07:52:00,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 07:52:00,243 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2018-12-01 07:52:00,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:52:00,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1415223279, now seen corresponding path program 1 times [2018-12-01 07:52:00,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 07:52:00,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 07:52:00,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:00,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 07:52:00,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:52:00,280 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-01 07:52:00,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 07:52:00,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 07:52:00,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 07:52:00,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 07:52:00,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 07:52:00,281 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 4 states. [2018-12-01 07:52:00,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 07:52:00,293 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-12-01 07:52:00,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 07:52:00,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-01 07:52:00,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 07:52:00,294 INFO L225 Difference]: With dead ends: 31 [2018-12-01 07:52:00,294 INFO L226 Difference]: Without dead ends: 31 [2018-12-01 07:52:00,295 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-01 07:52:00,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-01 07:52:00,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-01 07:52:00,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-01 07:52:00,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-12-01 07:52:00,298 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2018-12-01 07:52:00,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 07:52:00,298 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-12-01 07:52:00,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 07:52:00,298 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-12-01 07:52:00,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-01 07:52:00,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 07:52:00,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 07:52:00,299 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2018-12-01 07:52:00,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:52:00,299 INFO L82 PathProgramCache]: Analyzing trace with hash -195009075, now seen corresponding path program 1 times [2018-12-01 07:52:00,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 07:52:00,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 07:52:00,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:00,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 07:52:00,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:52:00,340 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-01 07:52:00,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 07:52:00,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 07:52:00,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 07:52:00,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 07:52:00,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 07:52:00,341 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 6 states. [2018-12-01 07:52:00,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 07:52:00,388 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-12-01 07:52:00,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 07:52:00,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-01 07:52:00,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 07:52:00,389 INFO L225 Difference]: With dead ends: 30 [2018-12-01 07:52:00,389 INFO L226 Difference]: Without dead ends: 30 [2018-12-01 07:52:00,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-01 07:52:00,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-01 07:52:00,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-01 07:52:00,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-01 07:52:00,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-12-01 07:52:00,391 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 15 [2018-12-01 07:52:00,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 07:52:00,392 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-12-01 07:52:00,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 07:52:00,392 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-12-01 07:52:00,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-01 07:52:00,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 07:52:00,392 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 07:52:00,392 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2018-12-01 07:52:00,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:52:00,392 INFO L82 PathProgramCache]: Analyzing trace with hash -195009074, now seen corresponding path program 1 times [2018-12-01 07:52:00,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 07:52:00,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 07:52:00,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:00,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 07:52:00,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:52:00,471 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-01 07:52:00,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 07:52:00,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 07:52:00,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 07:52:00,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 07:52:00,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-01 07:52:00,473 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 8 states. [2018-12-01 07:52:00,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 07:52:00,540 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-12-01 07:52:00,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 07:52:00,540 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-01 07:52:00,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 07:52:00,541 INFO L225 Difference]: With dead ends: 33 [2018-12-01 07:52:00,541 INFO L226 Difference]: Without dead ends: 33 [2018-12-01 07:52:00,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-01 07:52:00,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-01 07:52:00,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-12-01 07:52:00,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-01 07:52:00,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-12-01 07:52:00,545 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 15 [2018-12-01 07:52:00,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 07:52:00,545 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-12-01 07:52:00,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 07:52:00,545 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-12-01 07:52:00,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-01 07:52:00,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 07:52:00,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 07:52:00,546 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2018-12-01 07:52:00,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:52:00,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1575404250, now seen corresponding path program 1 times [2018-12-01 07:52:00,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 07:52:00,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 07:52:00,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:00,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 07:52:00,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:52:00,590 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-01 07:52:00,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 07:52:00,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 07:52:00,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 07:52:00,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 07:52:00,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 07:52:00,591 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 7 states. [2018-12-01 07:52:00,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 07:52:00,642 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-12-01 07:52:00,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 07:52:00,643 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-12-01 07:52:00,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 07:52:00,643 INFO L225 Difference]: With dead ends: 32 [2018-12-01 07:52:00,643 INFO L226 Difference]: Without dead ends: 32 [2018-12-01 07:52:00,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-01 07:52:00,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-01 07:52:00,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-12-01 07:52:00,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-01 07:52:00,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-12-01 07:52:00,645 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 18 [2018-12-01 07:52:00,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 07:52:00,645 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-12-01 07:52:00,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 07:52:00,646 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-12-01 07:52:00,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-01 07:52:00,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 07:52:00,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 07:52:00,646 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2018-12-01 07:52:00,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:52:00,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1575404251, now seen corresponding path program 1 times [2018-12-01 07:52:00,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 07:52:00,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 07:52:00,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:00,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 07:52:00,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:52:00,723 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-01 07:52:00,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 07:52:00,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-01 07:52:00,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 07:52:00,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 07:52:00,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-01 07:52:00,723 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 9 states. [2018-12-01 07:52:00,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 07:52:00,794 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-12-01 07:52:00,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 07:52:00,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-12-01 07:52:00,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 07:52:00,795 INFO L225 Difference]: With dead ends: 35 [2018-12-01 07:52:00,795 INFO L226 Difference]: Without dead ends: 35 [2018-12-01 07:52:00,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-01 07:52:00,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-01 07:52:00,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-12-01 07:52:00,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-01 07:52:00,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-12-01 07:52:00,797 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 18 [2018-12-01 07:52:00,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 07:52:00,798 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-12-01 07:52:00,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 07:52:00,798 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-12-01 07:52:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 07:52:00,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 07:52:00,798 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 07:52:00,798 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2018-12-01 07:52:00,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:52:00,798 INFO L82 PathProgramCache]: Analyzing trace with hash -489606055, now seen corresponding path program 1 times [2018-12-01 07:52:00,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 07:52:00,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 07:52:00,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:00,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 07:52:00,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:52:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 07:52:00,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 07:52:00,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-01 07:52:00,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-01 07:52:00,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-01 07:52:00,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-01 07:52:00,909 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 11 states. [2018-12-01 07:52:01,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 07:52:01,015 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-12-01 07:52:01,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 07:52:01,016 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-12-01 07:52:01,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 07:52:01,016 INFO L225 Difference]: With dead ends: 58 [2018-12-01 07:52:01,016 INFO L226 Difference]: Without dead ends: 58 [2018-12-01 07:52:01,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-12-01 07:52:01,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-01 07:52:01,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2018-12-01 07:52:01,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-01 07:52:01,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-12-01 07:52:01,019 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 23 [2018-12-01 07:52:01,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 07:52:01,020 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-12-01 07:52:01,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-01 07:52:01,020 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-12-01 07:52:01,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 07:52:01,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 07:52:01,020 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 07:52:01,020 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2018-12-01 07:52:01,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:52:01,021 INFO L82 PathProgramCache]: Analyzing trace with hash -489603877, now seen corresponding path program 1 times [2018-12-01 07:52:01,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 07:52:01,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 07:52:01,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:01,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 07:52:01,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:52:01,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 07:52:01,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 07:52:01,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-01 07:52:01,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-01 07:52:01,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-01 07:52:01,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-01 07:52:01,096 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 11 states. [2018-12-01 07:52:01,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 07:52:01,202 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-12-01 07:52:01,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 07:52:01,203 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-12-01 07:52:01,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 07:52:01,205 INFO L225 Difference]: With dead ends: 85 [2018-12-01 07:52:01,206 INFO L226 Difference]: Without dead ends: 85 [2018-12-01 07:52:01,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-12-01 07:52:01,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-01 07:52:01,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2018-12-01 07:52:01,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-01 07:52:01,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-12-01 07:52:01,211 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 23 [2018-12-01 07:52:01,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 07:52:01,211 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-12-01 07:52:01,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-01 07:52:01,212 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-12-01 07:52:01,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 07:52:01,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 07:52:01,212 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 07:52:01,213 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2018-12-01 07:52:01,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:52:01,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1510672231, now seen corresponding path program 1 times [2018-12-01 07:52:01,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 07:52:01,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 07:52:01,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:01,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 07:52:01,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:52:01,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 07:52:01,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 07:52:01,400 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5aebc93c-3b8a-41f2-911d-353d903d9dca/bin-2019/uautomizer/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-01 07:52:01,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 07:52:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:52:01,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 07:52:01,478 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-01 07:52:01,480 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-01 07:52:01,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 07:52:01,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 07:52:01,492 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-01 07:52:01,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-01 07:52:01,624 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 20 treesize of output 16 [2018-12-01 07:52:01,633 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 16 treesize of output 13 [2018-12-01 07:52:01,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 07:52:01,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 07:52:01,644 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-01 07:52:01,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-12-01 07:52:01,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 07:52:01,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 07:52:01,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2018-12-01 07:52:01,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-01 07:52:01,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-01 07:52:01,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-12-01 07:52:01,716 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 20 states. [2018-12-01 07:52:02,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 07:52:02,441 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2018-12-01 07:52:02,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-01 07:52:02,442 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2018-12-01 07:52:02,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 07:52:02,442 INFO L225 Difference]: With dead ends: 91 [2018-12-01 07:52:02,442 INFO L226 Difference]: Without dead ends: 91 [2018-12-01 07:52:02,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=774, Unknown=0, NotChecked=0, Total=930 [2018-12-01 07:52:02,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-01 07:52:02,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2018-12-01 07:52:02,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-01 07:52:02,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2018-12-01 07:52:02,448 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 23 [2018-12-01 07:52:02,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 07:52:02,448 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2018-12-01 07:52:02,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-01 07:52:02,448 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-12-01 07:52:02,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 07:52:02,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 07:52:02,449 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 07:52:02,449 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2018-12-01 07:52:02,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:52:02,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1195944985, now seen corresponding path program 1 times [2018-12-01 07:52:02,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 07:52:02,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 07:52:02,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:02,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 07:52:02,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:52:02,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 07:52:02,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 07:52:02,773 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5aebc93c-3b8a-41f2-911d-353d903d9dca/bin-2019/uautomizer/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-01 07:52:02,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 07:52:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:52:02,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 07:52:02,797 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-12-01 07:52:02,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 07:52:02,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 07:52:02,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-01 07:52:02,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 14 treesize of output 11 [2018-12-01 07:52:02,817 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-01 07:52:02,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 07:52:02,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 07:52:02,825 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-01 07:52:02,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-01 07:52:02,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-12-01 07:52:02,851 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-01 07:52:02,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 07:52:02,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 07:52:02,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-01 07:52:02,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-01 07:52:03,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-12-01 07:52:03,014 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 16 treesize of output 13 [2018-12-01 07:52:03,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 07:52:03,020 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 8 treesize of output 1 [2018-12-01 07:52:03,020 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 07:52:03,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 07:52:03,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 07:52:03,037 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-12-01 07:52:03,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 07:52:03,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 07:52:03,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 26 [2018-12-01 07:52:03,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-01 07:52:03,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-01 07:52:03,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2018-12-01 07:52:03,181 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 27 states. [2018-12-01 07:52:04,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 07:52:04,278 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2018-12-01 07:52:04,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-01 07:52:04,278 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 23 [2018-12-01 07:52:04,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 07:52:04,279 INFO L225 Difference]: With dead ends: 97 [2018-12-01 07:52:04,279 INFO L226 Difference]: Without dead ends: 97 [2018-12-01 07:52:04,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=174, Invalid=1232, Unknown=0, NotChecked=0, Total=1406 [2018-12-01 07:52:04,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-01 07:52:04,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2018-12-01 07:52:04,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-01 07:52:04,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2018-12-01 07:52:04,283 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 23 [2018-12-01 07:52:04,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 07:52:04,283 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2018-12-01 07:52:04,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-01 07:52:04,283 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2018-12-01 07:52:04,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-01 07:52:04,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 07:52:04,283 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] [2018-12-01 07:52:04,283 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2018-12-01 07:52:04,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:52:04,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1885053830, now seen corresponding path program 1 times [2018-12-01 07:52:04,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 07:52:04,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 07:52:04,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:04,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 07:52:04,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:52:04,310 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-01 07:52:04,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 07:52:04,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 07:52:04,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 07:52:04,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 07:52:04,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 07:52:04,311 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand 4 states. [2018-12-01 07:52:04,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 07:52:04,332 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2018-12-01 07:52:04,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 07:52:04,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-12-01 07:52:04,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 07:52:04,333 INFO L225 Difference]: With dead ends: 91 [2018-12-01 07:52:04,333 INFO L226 Difference]: Without dead ends: 68 [2018-12-01 07:52:04,333 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-01 07:52:04,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-01 07:52:04,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-01 07:52:04,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-01 07:52:04,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-12-01 07:52:04,337 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 25 [2018-12-01 07:52:04,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 07:52:04,337 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-12-01 07:52:04,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 07:52:04,337 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-12-01 07:52:04,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-01 07:52:04,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 07:52:04,338 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 07:52:04,338 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2018-12-01 07:52:04,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:52:04,338 INFO L82 PathProgramCache]: Analyzing trace with hash 680848861, now seen corresponding path program 2 times [2018-12-01 07:52:04,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 07:52:04,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 07:52:04,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:04,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 07:52:04,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:52:04,535 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 07:52:04,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 07:52:04,535 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5aebc93c-3b8a-41f2-911d-353d903d9dca/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 07:52:04,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 07:52:04,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 07:52:04,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 07:52:04,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 07:52:04,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-01 07:52:04,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-01 07:52:04,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 07:52:04,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 07:52:04,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 07:52:04,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-01 07:52:04,598 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-01 07:52:04,600 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-01 07:52:04,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 07:52:04,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 07:52:04,604 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-01 07:52:04,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-12-01 07:52:04,748 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 22 treesize of output 18 [2018-12-01 07:52:04,753 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 18 treesize of output 15 [2018-12-01 07:52:04,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 07:52:04,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 07:52:04,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 07:52:04,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-12-01 07:52:04,823 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 07:52:04,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 07:52:04,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-12-01 07:52:04,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-01 07:52:04,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-01 07:52:04,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-12-01 07:52:04,839 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 24 states. [2018-12-01 07:52:05,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 07:52:05,976 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2018-12-01 07:52:05,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-01 07:52:05,976 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2018-12-01 07:52:05,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 07:52:05,977 INFO L225 Difference]: With dead ends: 79 [2018-12-01 07:52:05,977 INFO L226 Difference]: Without dead ends: 56 [2018-12-01 07:52:05,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=223, Invalid=1109, Unknown=0, NotChecked=0, Total=1332 [2018-12-01 07:52:05,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-01 07:52:05,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 32. [2018-12-01 07:52:05,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-01 07:52:05,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-12-01 07:52:05,981 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 28 [2018-12-01 07:52:05,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 07:52:05,982 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-12-01 07:52:05,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-01 07:52:05,982 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-12-01 07:52:05,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-01 07:52:05,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 07:52:05,983 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] [2018-12-01 07:52:05,983 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION]=== [2018-12-01 07:52:05,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 07:52:05,984 INFO L82 PathProgramCache]: Analyzing trace with hash -199229532, now seen corresponding path program 2 times [2018-12-01 07:52:05,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 07:52:05,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 07:52:05,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:05,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 07:52:05,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 07:52:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 07:52:06,204 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 07:52:06,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 07:52:06,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5aebc93c-3b8a-41f2-911d-353d903d9dca/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 07:52:06,210 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-01 07:52:06,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-01 07:52:06,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-01 07:52:06,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 07:52:06,262 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-12-01 07:52:06,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 07:52:06,267 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-12-01 07:52:06,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 15 [2018-12-01 07:52:06,271 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 07:52:06,274 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 07:52:06,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 07:52:06,280 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-12-01 07:52:06,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 16 treesize of output 13 [2018-12-01 07:52:06,302 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-01 07:52:06,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 07:52:06,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 07:52:06,309 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-01 07:52:06,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-01 07:52:06,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-01 07:52:06,335 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-01 07:52:06,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 07:52:06,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 07:52:06,346 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-01 07:52:06,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-12-01 07:52:07,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2018-12-01 07:52:07,099 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 18 treesize of output 15 [2018-12-01 07:52:07,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-01 07:52:07,115 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-12-01 07:52:07,116 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 07:52:07,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 07:52:07,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 07:52:07,134 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:66, output treesize:69 [2018-12-01 07:52:07,318 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 07:52:07,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 07:52:07,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 33 [2018-12-01 07:52:07,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-01 07:52:07,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-01 07:52:07,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1023, Unknown=0, NotChecked=0, Total=1122 [2018-12-01 07:52:07,333 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 34 states. [2018-12-01 07:52:08,201 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2018-12-01 07:52:08,435 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2018-12-01 07:52:09,201 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2018-12-01 07:52:09,384 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2018-12-01 07:52:10,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 07:52:10,370 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-12-01 07:52:10,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-01 07:52:10,370 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 31 [2018-12-01 07:52:10,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 07:52:10,371 INFO L225 Difference]: With dead ends: 57 [2018-12-01 07:52:10,371 INFO L226 Difference]: Without dead ends: 0 [2018-12-01 07:52:10,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=481, Invalid=3679, Unknown=0, NotChecked=0, Total=4160 [2018-12-01 07:52:10,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-01 07:52:10,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-01 07:52:10,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-01 07:52:10,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-01 07:52:10,373 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-12-01 07:52:10,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 07:52:10,373 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 07:52:10,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-01 07:52:10,373 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-01 07:52:10,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-01 07:52:10,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 07:52:10 BoogieIcfgContainer [2018-12-01 07:52:10,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 07:52:10,378 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 07:52:10,378 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 07:52:10,378 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 07:52:10,379 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 07:51:59" (3/4) ... [2018-12-01 07:52:10,382 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-01 07:52:10,388 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-01 07:52:10,389 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-01 07:52:10,389 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-01 07:52:10,389 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-01 07:52:10,389 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrspn [2018-12-01 07:52:10,394 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-12-01 07:52:10,394 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-01 07:52:10,394 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-01 07:52:10,424 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5aebc93c-3b8a-41f2-911d-353d903d9dca/bin-2019/uautomizer/witness.graphml [2018-12-01 07:52:10,424 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 07:52:10,425 INFO L168 Benchmark]: Toolchain (without parser) took 11055.68 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 342.4 MB). Free memory was 956.0 MB in the beginning and 1.0 GB in the end (delta: -60.6 MB). Peak memory consumption was 281.8 MB. Max. memory is 11.5 GB. [2018-12-01 07:52:10,425 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 07:52:10,425 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -164.6 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-12-01 07:52:10,426 INFO L168 Benchmark]: Boogie Preprocessor took 28.43 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-01 07:52:10,426 INFO L168 Benchmark]: RCFGBuilder took 252.82 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: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2018-12-01 07:52:10,426 INFO L168 Benchmark]: TraceAbstraction took 10463.20 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 205.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.5 MB). Peak memory consumption was 263.0 MB. Max. memory is 11.5 GB. [2018-12-01 07:52:10,426 INFO L168 Benchmark]: Witness Printer took 46.55 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 07:52:10,427 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 262.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -164.6 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.43 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 252.82 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: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10463.20 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 205.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.5 MB). Peak memory consumption was 263.0 MB. Max. memory is 11.5 GB. * Witness Printer took 46.55 ms. Allocated memory is still 1.4 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: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: 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 6 procedures, 44 locations, 9 error locations. SAFE Result, 10.4s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 6.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 366 SDtfs, 798 SDslu, 1820 SDs, 0 SdLazy, 1956 SolverSat, 229 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 311 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1226 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 71 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 389 NumberOfCodeBlocks, 389 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 370 ConstructedInterpolants, 45 QuantifiedInterpolants, 106460 SizeOfPredicates, 67 NumberOfNonLiveVariables, 607 ConjunctsInSsa, 186 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 9/54 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...