./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_986cd71c-d257-49b3-b70a-9ec84a735d15/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_986cd71c-d257-49b3-b70a-9ec84a735d15/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_986cd71c-d257-49b3-b70a-9ec84a735d15/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_986cd71c-d257-49b3-b70a-9ec84a735d15/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_986cd71c-d257-49b3-b70a-9ec84a735d15/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_986cd71c-d257-49b3-b70a-9ec84a735d15/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 61682d2c31dd7110d61be8ccb8e4bbb3882eca20 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:44:06,758 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:44:06,760 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:44:06,767 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:44:06,767 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:44:06,768 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:44:06,769 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:44:06,770 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:44:06,771 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:44:06,772 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:44:06,772 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:44:06,772 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:44:06,773 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:44:06,774 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:44:06,774 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:44:06,775 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:44:06,776 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:44:06,777 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:44:06,778 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:44:06,779 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:44:06,780 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:44:06,781 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:44:06,782 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:44:06,782 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:44:06,783 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:44:06,783 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:44:06,784 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:44:06,784 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:44:06,785 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:44:06,786 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:44:06,786 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:44:06,786 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:44:06,786 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:44:06,787 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:44:06,787 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:44:06,788 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:44:06,788 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_986cd71c-d257-49b3-b70a-9ec84a735d15/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 12:44:06,797 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:44:06,798 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:44:06,798 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 12:44:06,798 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 12:44:06,799 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:44:06,799 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:44:06,799 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:44:06,799 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:44:06,800 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:44:06,800 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:44:06,800 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:44:06,800 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:44:06,800 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:44:06,800 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 12:44:06,800 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 12:44:06,801 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 12:44:06,801 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 12:44:06,801 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:44:06,801 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:44:06,802 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:44:06,802 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:44:06,802 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 12:44:06,802 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 12:44:06,802 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:44:06,802 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:44:06,803 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 12:44:06,803 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:44:06,803 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 12:44:06,803 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_986cd71c-d257-49b3-b70a-9ec84a735d15/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 -> 61682d2c31dd7110d61be8ccb8e4bbb3882eca20 [2018-11-28 12:44:06,825 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:44:06,832 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:44:06,834 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:44:06,835 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:44:06,835 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:44:06,836 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_986cd71c-d257-49b3-b70a-9ec84a735d15/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-11-28 12:44:06,870 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_986cd71c-d257-49b3-b70a-9ec84a735d15/bin-2019/uautomizer/data/9831596db/6bb37c3beb2c461e96136b8399dbdc89/FLAGe21cd5fe0 [2018-11-28 12:44:07,303 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:44:07,303 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_986cd71c-d257-49b3-b70a-9ec84a735d15/sv-benchmarks/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-11-28 12:44:07,311 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_986cd71c-d257-49b3-b70a-9ec84a735d15/bin-2019/uautomizer/data/9831596db/6bb37c3beb2c461e96136b8399dbdc89/FLAGe21cd5fe0 [2018-11-28 12:44:07,320 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_986cd71c-d257-49b3-b70a-9ec84a735d15/bin-2019/uautomizer/data/9831596db/6bb37c3beb2c461e96136b8399dbdc89 [2018-11-28 12:44:07,322 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:44:07,323 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 12:44:07,324 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:44:07,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:44:07,326 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:44:07,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:44:07" (1/1) ... [2018-11-28 12:44:07,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ccf24a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:44:07, skipping insertion in model container [2018-11-28 12:44:07,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:44:07" (1/1) ... [2018-11-28 12:44:07,332 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:44:07,355 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:44:07,531 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:44:07,539 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:44:07,607 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:44:07,629 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:44:07,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:44:07 WrapperNode [2018-11-28 12:44:07,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:44:07,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:44:07,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:44:07,630 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:44:07,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:44:07" (1/1) ... [2018-11-28 12:44:07,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:44:07" (1/1) ... [2018-11-28 12:44:07,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:44:07" (1/1) ... [2018-11-28 12:44:07,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:44:07" (1/1) ... [2018-11-28 12:44:07,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:44:07" (1/1) ... [2018-11-28 12:44:07,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:44:07" (1/1) ... [2018-11-28 12:44:07,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:44:07" (1/1) ... [2018-11-28 12:44:07,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:44:07,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:44:07,666 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:44:07,666 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:44:07,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:44:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_986cd71c-d257-49b3-b70a-9ec84a735d15/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-11-28 12:44:07,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 12:44:07,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:44:07,700 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 12:44:07,700 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 12:44:07,701 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-11-28 12:44:07,701 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 12:44:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 12:44:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 12:44:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 12:44:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 12:44:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 12:44:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 12:44:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 12:44:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 12:44:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 12:44:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 12:44:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 12:44:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 12:44:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 12:44:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 12:44:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 12:44:07,703 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 12:44:07,703 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 12:44:07,703 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 12:44:07,703 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 12:44:07,703 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 12:44:07,703 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 12:44:07,703 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 12:44:07,703 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 12:44:07,703 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 12:44:07,704 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 12:44:07,704 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 12:44:07,704 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 12:44:07,704 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 12:44:07,704 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 12:44:07,704 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 12:44:07,704 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 12:44:07,704 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 12:44:07,704 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 12:44:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 12:44:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 12:44:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 12:44:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 12:44:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 12:44:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 12:44:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 12:44:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 12:44:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 12:44:07,706 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 12:44:07,706 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 12:44:07,706 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 12:44:07,706 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 12:44:07,706 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 12:44:07,706 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 12:44:07,706 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 12:44:07,706 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 12:44:07,706 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 12:44:07,706 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 12:44:07,707 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 12:44:07,707 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 12:44:07,707 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 12:44:07,707 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 12:44:07,707 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 12:44:07,707 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 12:44:07,707 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 12:44:07,707 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 12:44:07,707 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 12:44:07,708 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 12:44:07,708 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 12:44:07,708 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 12:44:07,708 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 12:44:07,708 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 12:44:07,708 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 12:44:07,708 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 12:44:07,708 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 12:44:07,708 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 12:44:07,709 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 12:44:07,709 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 12:44:07,709 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 12:44:07,709 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 12:44:07,709 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 12:44:07,709 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 12:44:07,709 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 12:44:07,709 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 12:44:07,709 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 12:44:07,710 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 12:44:07,710 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 12:44:07,710 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 12:44:07,710 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 12:44:07,710 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 12:44:07,710 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 12:44:07,710 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 12:44:07,710 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 12:44:07,711 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 12:44:07,711 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 12:44:07,711 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 12:44:07,711 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 12:44:07,711 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 12:44:07,711 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 12:44:07,711 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 12:44:07,711 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 12:44:07,712 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 12:44:07,712 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 12:44:07,712 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 12:44:07,712 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 12:44:07,712 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 12:44:07,712 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 12:44:07,712 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 12:44:07,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 12:44:07,713 INFO L130 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-11-28 12:44:07,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:44:07,713 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 12:44:07,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:44:07,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:44:07,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:44:07,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 12:44:07,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:44:08,003 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:44:08,003 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 12:44:08,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:44:08 BoogieIcfgContainer [2018-11-28 12:44:08,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:44:08,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 12:44:08,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 12:44:08,006 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 12:44:08,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:44:07" (1/3) ... [2018-11-28 12:44:08,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da143f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:44:08, skipping insertion in model container [2018-11-28 12:44:08,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:44:07" (2/3) ... [2018-11-28 12:44:08,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da143f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:44:08, skipping insertion in model container [2018-11-28 12:44:08,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:44:08" (3/3) ... [2018-11-28 12:44:08,009 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-11-28 12:44:08,015 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 12:44:08,020 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-11-28 12:44:08,029 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-11-28 12:44:08,045 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:44:08,045 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 12:44:08,045 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 12:44:08,046 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 12:44:08,046 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:44:08,046 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:44:08,046 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 12:44:08,046 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:44:08,046 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 12:44:08,057 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-11-28 12:44:08,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 12:44:08,063 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:08,064 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:44:08,065 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 12:44:08,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:08,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1879598342, now seen corresponding path program 1 times [2018-11-28 12:44:08,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:08,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:08,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:08,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:08,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:08,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:08,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:08,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:44:08,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:44:08,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:44:08,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:44:08,197 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2018-11-28 12:44:08,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:08,241 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-28 12:44:08,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:44:08,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 12:44:08,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:08,247 INFO L225 Difference]: With dead ends: 48 [2018-11-28 12:44:08,247 INFO L226 Difference]: Without dead ends: 45 [2018-11-28 12:44:08,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:44:08,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-28 12:44:08,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-28 12:44:08,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 12:44:08,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-11-28 12:44:08,269 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 10 [2018-11-28 12:44:08,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:08,269 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-11-28 12:44:08,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:44:08,269 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-11-28 12:44:08,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 12:44:08,269 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:08,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:44:08,270 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 12:44:08,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:08,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1879598343, now seen corresponding path program 1 times [2018-11-28 12:44:08,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:08,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:08,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:08,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:08,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:08,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-11-28 12:44:08,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:08,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:44:08,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:44:08,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:44:08,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:44:08,342 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 4 states. [2018-11-28 12:44:08,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:08,358 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-28 12:44:08,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:44:08,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-28 12:44:08,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:08,360 INFO L225 Difference]: With dead ends: 44 [2018-11-28 12:44:08,360 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 12:44:08,360 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-11-28 12:44:08,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 12:44:08,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-28 12:44:08,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 12:44:08,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-28 12:44:08,364 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 10 [2018-11-28 12:44:08,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:08,365 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-28 12:44:08,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:44:08,365 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-28 12:44:08,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 12:44:08,365 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:08,365 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:44:08,366 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 12:44:08,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:08,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1861993495, now seen corresponding path program 1 times [2018-11-28 12:44:08,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:08,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:08,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:08,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:08,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:08,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:08,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:08,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:44:08,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:44:08,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:44:08,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:44:08,399 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 3 states. [2018-11-28 12:44:08,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:08,424 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-28 12:44:08,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:44:08,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-28 12:44:08,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:08,425 INFO L225 Difference]: With dead ends: 43 [2018-11-28 12:44:08,425 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 12:44:08,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:44:08,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 12:44:08,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-28 12:44:08,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 12:44:08,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-28 12:44:08,429 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2018-11-28 12:44:08,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:08,429 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-28 12:44:08,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:44:08,429 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-28 12:44:08,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 12:44:08,430 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:08,430 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:44:08,430 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 12:44:08,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:08,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1861993494, now seen corresponding path program 1 times [2018-11-28 12:44:08,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:08,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:08,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:08,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:08,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:08,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:08,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:08,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:44:08,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:44:08,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:44:08,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:44:08,463 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-11-28 12:44:08,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:08,473 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-28 12:44:08,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:44:08,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-28 12:44:08,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:08,474 INFO L225 Difference]: With dead ends: 42 [2018-11-28 12:44:08,474 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 12:44:08,474 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-11-28 12:44:08,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 12:44:08,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-28 12:44:08,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 12:44:08,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-28 12:44:08,477 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 11 [2018-11-28 12:44:08,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:08,478 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-28 12:44:08,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:44:08,478 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-28 12:44:08,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 12:44:08,478 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:08,478 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:44:08,478 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 12:44:08,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:08,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1145525834, now seen corresponding path program 1 times [2018-11-28 12:44:08,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:08,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:08,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:08,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:08,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:08,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:08,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:08,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:44:08,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:44:08,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:44:08,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:44:08,522 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2018-11-28 12:44:08,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:08,601 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-28 12:44:08,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:44:08,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-28 12:44:08,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:08,602 INFO L225 Difference]: With dead ends: 40 [2018-11-28 12:44:08,602 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 12:44:08,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:44:08,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 12:44:08,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-28 12:44:08,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 12:44:08,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-11-28 12:44:08,605 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 14 [2018-11-28 12:44:08,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:08,605 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-11-28 12:44:08,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:44:08,605 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-28 12:44:08,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 12:44:08,605 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:08,606 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:44:08,606 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 12:44:08,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:08,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1145525833, now seen corresponding path program 1 times [2018-11-28 12:44:08,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:08,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:08,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:08,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:08,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:08,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:08,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:08,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:44:08,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:44:08,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:44:08,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:44:08,676 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 7 states. [2018-11-28 12:44:08,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:08,776 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-11-28 12:44:08,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:44:08,776 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-11-28 12:44:08,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:08,778 INFO L225 Difference]: With dead ends: 62 [2018-11-28 12:44:08,779 INFO L226 Difference]: Without dead ends: 62 [2018-11-28 12:44:08,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:44:08,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-28 12:44:08,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-11-28 12:44:08,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 12:44:08,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-11-28 12:44:08,784 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 14 [2018-11-28 12:44:08,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:08,784 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-28 12:44:08,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:44:08,784 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-28 12:44:08,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 12:44:08,785 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:08,785 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:44:08,785 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 12:44:08,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:08,785 INFO L82 PathProgramCache]: Analyzing trace with hash 2000279356, now seen corresponding path program 1 times [2018-11-28 12:44:08,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:08,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:08,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:08,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:08,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:08,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:08,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:08,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:44:08,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:44:08,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:44:08,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:44:08,820 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 6 states. [2018-11-28 12:44:08,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:08,871 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-28 12:44:08,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:44:08,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-28 12:44:08,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:08,872 INFO L225 Difference]: With dead ends: 43 [2018-11-28 12:44:08,872 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 12:44:08,872 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-11-28 12:44:08,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 12:44:08,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-11-28 12:44:08,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 12:44:08,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-11-28 12:44:08,875 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 18 [2018-11-28 12:44:08,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:08,875 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-28 12:44:08,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:44:08,875 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-28 12:44:08,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 12:44:08,876 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:08,876 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:44:08,876 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 12:44:08,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:08,876 INFO L82 PathProgramCache]: Analyzing trace with hash 2000279357, now seen corresponding path program 1 times [2018-11-28 12:44:08,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:08,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:08,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:08,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:08,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:08,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:08,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:08,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:44:08,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 12:44:08,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 12:44:08,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:44:08,951 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 8 states. [2018-11-28 12:44:09,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:09,032 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2018-11-28 12:44:09,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:44:09,032 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-28 12:44:09,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:09,033 INFO L225 Difference]: With dead ends: 55 [2018-11-28 12:44:09,033 INFO L226 Difference]: Without dead ends: 55 [2018-11-28 12:44:09,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:44:09,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-28 12:44:09,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-11-28 12:44:09,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-28 12:44:09,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-11-28 12:44:09,038 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 18 [2018-11-28 12:44:09,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:09,038 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-11-28 12:44:09,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 12:44:09,038 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-28 12:44:09,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 12:44:09,039 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:09,039 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:44:09,039 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 12:44:09,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:09,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1894101213, now seen corresponding path program 1 times [2018-11-28 12:44:09,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:09,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:09,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:09,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:09,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:09,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:09,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:09,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:44:09,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:44:09,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:44:09,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:44:09,081 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 4 states. [2018-11-28 12:44:09,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:09,121 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-28 12:44:09,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:44:09,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-28 12:44:09,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:09,122 INFO L225 Difference]: With dead ends: 46 [2018-11-28 12:44:09,122 INFO L226 Difference]: Without dead ends: 41 [2018-11-28 12:44:09,122 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-11-28 12:44:09,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-28 12:44:09,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-28 12:44:09,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 12:44:09,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-28 12:44:09,125 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 20 [2018-11-28 12:44:09,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:09,125 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-28 12:44:09,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:44:09,125 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-28 12:44:09,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 12:44:09,126 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:09,126 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:44:09,126 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 12:44:09,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:09,126 INFO L82 PathProgramCache]: Analyzing trace with hash 197301268, now seen corresponding path program 1 times [2018-11-28 12:44:09,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:09,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:09,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:09,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:09,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:09,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:09,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:09,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:44:09,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:44:09,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:44:09,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:44:09,158 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2018-11-28 12:44:09,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:09,163 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-28 12:44:09,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:44:09,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 12:44:09,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:09,164 INFO L225 Difference]: With dead ends: 43 [2018-11-28 12:44:09,164 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 12:44:09,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:44:09,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 12:44:09,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-28 12:44:09,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 12:44:09,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-11-28 12:44:09,166 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 22 [2018-11-28 12:44:09,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:09,167 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-28 12:44:09,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:44:09,167 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-28 12:44:09,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 12:44:09,167 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:09,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:44:09,168 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 12:44:09,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:09,168 INFO L82 PathProgramCache]: Analyzing trace with hash 622097713, now seen corresponding path program 1 times [2018-11-28 12:44:09,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:09,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:09,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:09,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:09,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:09,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:09,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:09,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 12:44:09,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 12:44:09,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 12:44:09,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:44:09,289 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 10 states. [2018-11-28 12:44:09,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:09,381 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-11-28 12:44:09,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:44:09,381 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-28 12:44:09,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:09,382 INFO L225 Difference]: With dead ends: 64 [2018-11-28 12:44:09,382 INFO L226 Difference]: Without dead ends: 64 [2018-11-28 12:44:09,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-11-28 12:44:09,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-28 12:44:09,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-11-28 12:44:09,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-28 12:44:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-11-28 12:44:09,385 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 24 [2018-11-28 12:44:09,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:09,385 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-11-28 12:44:09,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 12:44:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-11-28 12:44:09,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 12:44:09,386 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:09,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:44:09,386 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 12:44:09,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:09,386 INFO L82 PathProgramCache]: Analyzing trace with hash -966250189, now seen corresponding path program 1 times [2018-11-28 12:44:09,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:09,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:09,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:09,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:09,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:09,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:09,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:44:09,553 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_986cd71c-d257-49b3-b70a-9ec84a735d15/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-11-28 12:44:09,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:09,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:44:09,622 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-11-28 12:44:09,626 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-11-28 12:44:09,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:09,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:44:09,652 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-11-28 12:44:09,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-11-28 12:44:09,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-28 12:44:09,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-11-28 12:44:09,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 12:44:09,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:44:09,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:44:09,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-11-28 12:44:09,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:09,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:44:09,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-11-28 12:44:09,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 12:44:09,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 12:44:09,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-11-28 12:44:09,904 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 19 states. [2018-11-28 12:44:10,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:10,507 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2018-11-28 12:44:10,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 12:44:10,508 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-11-28 12:44:10,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:10,509 INFO L225 Difference]: With dead ends: 86 [2018-11-28 12:44:10,509 INFO L226 Difference]: Without dead ends: 86 [2018-11-28 12:44:10,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2018-11-28 12:44:10,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-28 12:44:10,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2018-11-28 12:44:10,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 12:44:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2018-11-28 12:44:10,514 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 24 [2018-11-28 12:44:10,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:10,514 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2018-11-28 12:44:10,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 12:44:10,516 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2018-11-28 12:44:10,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 12:44:10,516 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:10,516 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-11-28 12:44:10,516 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 12:44:10,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:10,517 INFO L82 PathProgramCache]: Analyzing trace with hash -2009352802, now seen corresponding path program 1 times [2018-11-28 12:44:10,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:10,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:10,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:10,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:10,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:10,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:10,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:10,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 12:44:10,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 12:44:10,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 12:44:10,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:44:10,590 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand 10 states. [2018-11-28 12:44:10,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:10,717 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-11-28 12:44:10,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 12:44:10,717 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-28 12:44:10,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:10,718 INFO L225 Difference]: With dead ends: 69 [2018-11-28 12:44:10,718 INFO L226 Difference]: Without dead ends: 51 [2018-11-28 12:44:10,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-11-28 12:44:10,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-28 12:44:10,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-11-28 12:44:10,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-28 12:44:10,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-11-28 12:44:10,720 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 25 [2018-11-28 12:44:10,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:10,720 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-28 12:44:10,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 12:44:10,721 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-11-28 12:44:10,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 12:44:10,723 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:10,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:44:10,724 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 12:44:10,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:10,724 INFO L82 PathProgramCache]: Analyzing trace with hash -689762273, now seen corresponding path program 1 times [2018-11-28 12:44:10,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:10,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:10,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:10,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:10,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:10,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:44:10,918 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_986cd71c-d257-49b3-b70a-9ec84a735d15/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-11-28 12:44:10,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:10,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:44:10,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 12:44:10,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:10,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:44:10,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-11-28 12:44:10,989 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-11-28 12:44:10,992 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-11-28 12:44:10,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:10,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:44:10,999 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-11-28 12:44:10,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-11-28 12:44:11,022 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-11-28 12:44:11,023 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-11-28 12:44:11,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:11,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:44:11,034 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-11-28 12:44:11,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-11-28 12:44:13,865 WARN L180 SmtUtils]: Spent 535.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-28 12:44:13,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2018-11-28 12:44:13,948 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 45 treesize of output 38 [2018-11-28 12:44:13,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:13,991 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 37 treesize of output 29 [2018-11-28 12:44:13,991 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:14,036 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 34 treesize of output 26 [2018-11-28 12:44:14,037 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:14,074 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 29 treesize of output 27 [2018-11-28 12:44:14,074 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-28 12:44:14,117 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 26 treesize of output 24 [2018-11-28 12:44:14,117 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-28 12:44:14,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2018-11-28 12:44:14,178 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-11-28 12:44:14,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2018-11-28 12:44:14,247 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-11-28 12:44:14,311 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 34 treesize of output 26 [2018-11-28 12:44:14,312 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:14,313 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 35 treesize of output 27 [2018-11-28 12:44:14,313 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:14,315 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 31 treesize of output 23 [2018-11-28 12:44:14,315 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:14,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-28 12:44:14,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:44:14,398 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-11-28 12:44:14,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:14,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:44:14,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 27 [2018-11-28 12:44:14,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-28 12:44:14,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-28 12:44:14,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2018-11-28 12:44:14,490 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 28 states. [2018-11-28 12:44:15,997 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2018-11-28 12:44:16,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:16,669 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-11-28 12:44:16,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 12:44:16,669 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-11-28 12:44:16,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:16,669 INFO L225 Difference]: With dead ends: 109 [2018-11-28 12:44:16,670 INFO L226 Difference]: Without dead ends: 109 [2018-11-28 12:44:16,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=262, Invalid=1460, Unknown=0, NotChecked=0, Total=1722 [2018-11-28 12:44:16,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-28 12:44:16,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 75. [2018-11-28 12:44:16,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-28 12:44:16,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2018-11-28 12:44:16,673 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 27 [2018-11-28 12:44:16,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:16,673 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2018-11-28 12:44:16,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-28 12:44:16,674 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2018-11-28 12:44:16,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 12:44:16,674 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:16,674 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:44:16,674 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 12:44:16,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:16,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1181155673, now seen corresponding path program 2 times [2018-11-28 12:44:16,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:16,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:16,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:16,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:16,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:16,862 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:16,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:44:16,863 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_986cd71c-d257-49b3-b70a-9ec84a735d15/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-11-28 12:44:16,869 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:44:16,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:44:16,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:44:16,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:44:16,889 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-11-28 12:44:16,902 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-11-28 12:44:16,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 12:44:16,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:44:16,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:44:16,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-11-28 12:44:16,935 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-11-28 12:44:16,936 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-11-28 12:44:16,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:16,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:44:16,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:44:16,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-28 12:44:17,041 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-11-28 12:44:17,046 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-11-28 12:44:17,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 12:44:17,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:44:17,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:44:17,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-11-28 12:44:17,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:17,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:44:17,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-28 12:44:17,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 12:44:17,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 12:44:17,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-11-28 12:44:17,151 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 21 states. [2018-11-28 12:44:17,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:17,878 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2018-11-28 12:44:17,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 12:44:17,878 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2018-11-28 12:44:17,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:17,879 INFO L225 Difference]: With dead ends: 92 [2018-11-28 12:44:17,879 INFO L226 Difference]: Without dead ends: 90 [2018-11-28 12:44:17,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=923, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 12:44:17,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-28 12:44:17,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 44. [2018-11-28 12:44:17,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 12:44:17,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-11-28 12:44:17,882 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 30 [2018-11-28 12:44:17,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:17,882 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-11-28 12:44:17,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 12:44:17,882 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-28 12:44:17,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 12:44:17,882 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:17,883 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:44:17,885 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 12:44:17,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:17,886 INFO L82 PathProgramCache]: Analyzing trace with hash 19179001, now seen corresponding path program 2 times [2018-11-28 12:44:17,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:17,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:17,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:17,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:44:17,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:18,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:44:18,062 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_986cd71c-d257-49b3-b70a-9ec84a735d15/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-11-28 12:44:18,068 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:44:18,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:44:18,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:44:18,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:44:18,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 12:44:18,126 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-11-28 12:44:18,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:18,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:44:18,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 12:44:18,160 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:18,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:44:18,165 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-11-28 12:44:18,196 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-11-28 12:44:18,198 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-11-28 12:44:18,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:18,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:44:18,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:44:18,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-28 12:44:18,228 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-11-28 12:44:18,230 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-11-28 12:44:18,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:18,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:44:18,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:44:18,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-11-28 12:44:18,674 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 46 treesize of output 40 [2018-11-28 12:44:18,683 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-11-28 12:44:18,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 12:44:18,692 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-11-28 12:44:18,693 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:18,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:44:18,713 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-11-28 12:44:18,713 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:81 [2018-11-28 12:44:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:18,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:44:18,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18] total 26 [2018-11-28 12:44:18,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-28 12:44:18,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-28 12:44:18,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2018-11-28 12:44:18,852 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 27 states. [2018-11-28 12:44:22,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:22,044 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-11-28 12:44:22,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-28 12:44:22,044 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 40 [2018-11-28 12:44:22,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:22,045 INFO L225 Difference]: With dead ends: 105 [2018-11-28 12:44:22,045 INFO L226 Difference]: Without dead ends: 105 [2018-11-28 12:44:22,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=778, Invalid=4052, Unknown=0, NotChecked=0, Total=4830 [2018-11-28 12:44:22,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-28 12:44:22,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 60. [2018-11-28 12:44:22,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-28 12:44:22,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-11-28 12:44:22,049 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 40 [2018-11-28 12:44:22,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:22,049 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-11-28 12:44:22,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-28 12:44:22,049 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-11-28 12:44:22,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 12:44:22,050 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:44:22,050 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:44:22,050 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrpbrkErr8REQUIRES_VIOLATION, cstrpbrkErr3REQUIRES_VIOLATION, cstrpbrkErr1REQUIRES_VIOLATION, cstrpbrkErr7REQUIRES_VIOLATION, cstrpbrkErr2REQUIRES_VIOLATION, cstrpbrkErr5REQUIRES_VIOLATION, cstrpbrkErr0REQUIRES_VIOLATION, cstrpbrkErr6REQUIRES_VIOLATION, cstrpbrkErr9REQUIRES_VIOLATION, cstrpbrkErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 12:44:22,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:22,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1792606315, now seen corresponding path program 1 times [2018-11-28 12:44:22,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:22,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:22,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:22,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:44:22,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:22,246 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-28 12:44:22,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:44:22,246 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_986cd71c-d257-49b3-b70a-9ec84a735d15/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:44:22,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:22,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:44:22,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 12:44:22,288 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-11-28 12:44:22,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:22,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:44:22,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 12:44:22,296 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:22,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:44:22,300 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-11-28 12:44:22,314 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 15 treesize of output 12 [2018-11-28 12:44:22,315 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 12 treesize of output 11 [2018-11-28 12:44:22,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:22,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:44:22,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:44:22,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-28 12:44:22,337 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 28 treesize of output 29 [2018-11-28 12:44:22,339 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-11-28 12:44:22,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:22,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:44:22,346 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 1 xjuncts. [2018-11-28 12:44:22,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-11-28 12:44:24,678 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 12:44:24,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 56 [2018-11-28 12:44:24,730 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 48 treesize of output 46 [2018-11-28 12:44:24,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 12:44:24,782 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 40 treesize of output 32 [2018-11-28 12:44:24,782 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:24,819 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 33 treesize of output 26 [2018-11-28 12:44:24,819 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:24,820 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 38 treesize of output 31 [2018-11-28 12:44:24,820 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:24,851 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 26 treesize of output 16 [2018-11-28 12:44:24,852 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:24,853 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 31 treesize of output 21 [2018-11-28 12:44:24,853 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:24,881 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 40 treesize of output 30 [2018-11-28 12:44:24,881 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:24,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2018-11-28 12:44:24,915 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-11-28 12:44:24,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2018-11-28 12:44:24,970 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-11-28 12:44:25,036 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 32 treesize of output 30 [2018-11-28 12:44:25,037 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-28 12:44:25,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-28 12:44:25,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:44:25,115 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:60, output treesize:68 [2018-11-28 12:44:25,208 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:44:25,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:44:25,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 32 [2018-11-28 12:44:25,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-28 12:44:25,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-28 12:44:25,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=886, Unknown=0, NotChecked=0, Total=1056 [2018-11-28 12:44:25,223 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 33 states. [2018-11-28 12:44:27,379 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2018-11-28 12:44:27,603 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-11-28 12:44:27,870 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-11-28 12:44:28,207 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2018-11-28 12:44:28,773 WARN L180 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-11-28 12:44:30,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:30,556 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2018-11-28 12:44:30,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-28 12:44:30,556 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 59 [2018-11-28 12:44:30,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:44:30,556 INFO L225 Difference]: With dead ends: 84 [2018-11-28 12:44:30,556 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 12:44:30,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1160, Invalid=4242, Unknown=0, NotChecked=0, Total=5402 [2018-11-28 12:44:30,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 12:44:30,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 12:44:30,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 12:44:30,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 12:44:30,558 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2018-11-28 12:44:30,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:44:30,558 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:44:30,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-28 12:44:30,558 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:44:30,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 12:44:30,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:44:30 BoogieIcfgContainer [2018-11-28 12:44:30,562 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 12:44:30,562 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:44:30,562 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:44:30,562 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:44:30,563 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:44:08" (3/4) ... [2018-11-28 12:44:30,565 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 12:44:30,568 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 12:44:30,569 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrpbrk [2018-11-28 12:44:30,569 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-28 12:44:30,569 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-28 12:44:30,569 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 12:44:30,572 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-28 12:44:30,572 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-28 12:44:30,572 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 12:44:30,600 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_986cd71c-d257-49b3-b70a-9ec84a735d15/bin-2019/uautomizer/witness.graphml [2018-11-28 12:44:30,600 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:44:30,601 INFO L168 Benchmark]: Toolchain (without parser) took 23278.26 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 417.9 MB). Free memory was 950.6 MB in the beginning and 1.4 GB in the end (delta: -435.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:44:30,601 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:44:30,601 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 950.6 MB in the beginning and 1.2 GB in the end (delta: -199.7 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-11-28 12:44:30,602 INFO L168 Benchmark]: Boogie Preprocessor took 35.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-28 12:44:30,602 INFO L168 Benchmark]: RCFGBuilder took 337.41 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: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:44:30,602 INFO L168 Benchmark]: TraceAbstraction took 22557.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 255.9 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -301.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:44:30,603 INFO L168 Benchmark]: Witness Printer took 38.26 ms. Allocated memory is still 1.4 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-28 12:44:30,604 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 305.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 950.6 MB in the beginning and 1.2 GB in the end (delta: -199.7 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 337.41 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: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22557.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 255.9 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -301.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 38.26 ms. Allocated memory is still 1.4 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 550]: 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: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: 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: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 55 locations, 15 error locations. SAFE Result, 22.5s OverallTime, 17 OverallIterations, 4 TraceHistogramMax, 12.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 512 SDtfs, 1703 SDslu, 1956 SDs, 0 SdLazy, 3220 SolverSat, 341 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 443 GetRequests, 135 SyntacticMatches, 6 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2702 ImplicationChecksByTransitivity, 17.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=14, 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, 17 MinimizatonAttempts, 177 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 557 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 535 ConstructedInterpolants, 106 QuantifiedInterpolants, 316055 SizeOfPredicates, 74 NumberOfNonLiveVariables, 850 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 22 InterpolantComputations, 12 PerfectInterpolantSequences, 74/173 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...