./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrspn-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_316a15f6-07b9-40c5-9b55-8e6f70017071/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_316a15f6-07b9-40c5-9b55-8e6f70017071/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_316a15f6-07b9-40c5-9b55-8e6f70017071/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_316a15f6-07b9-40c5-9b55-8e6f70017071/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_316a15f6-07b9-40c5-9b55-8e6f70017071/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_316a15f6-07b9-40c5-9b55-8e6f70017071/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 1f6e8c8b965f85c3429105401e9fda59f9f060cb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 13:13:58,863 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:13:58,864 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:13:58,873 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:13:58,873 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:13:58,874 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:13:58,875 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:13:58,876 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:13:58,877 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:13:58,878 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:13:58,879 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:13:58,879 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:13:58,879 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:13:58,880 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:13:58,881 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:13:58,882 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:13:58,882 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:13:58,884 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:13:58,885 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:13:58,886 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:13:58,887 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:13:58,888 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:13:58,890 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:13:58,890 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:13:58,890 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:13:58,891 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:13:58,891 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:13:58,892 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:13:58,893 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:13:58,893 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:13:58,894 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:13:58,894 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:13:58,894 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:13:58,895 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:13:58,895 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:13:58,896 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:13:58,896 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_316a15f6-07b9-40c5-9b55-8e6f70017071/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 13:13:58,906 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:13:58,907 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:13:58,907 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:13:58,907 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:13:58,908 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:13:58,908 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:13:58,908 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:13:58,908 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:13:58,908 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:13:58,908 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:13:58,909 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:13:58,909 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:13:58,909 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:13:58,909 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 13:13:58,909 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 13:13:58,909 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 13:13:58,909 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:13:58,909 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:13:58,910 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:13:58,910 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:13:58,910 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:13:58,910 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:13:58,910 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:13:58,910 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:13:58,910 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:13:58,911 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:13:58,911 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:13:58,911 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:13:58,911 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_316a15f6-07b9-40c5-9b55-8e6f70017071/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 -> 1f6e8c8b965f85c3429105401e9fda59f9f060cb [2018-11-28 13:13:58,934 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:13:58,943 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:13:58,945 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:13:58,946 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:13:58,946 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:13:58,947 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_316a15f6-07b9-40c5-9b55-8e6f70017071/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-11-28 13:13:58,986 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_316a15f6-07b9-40c5-9b55-8e6f70017071/bin-2019/uautomizer/data/7b6ab62c5/ecd0a7582068441aa38c181570f06424/FLAG79ed8ebbd [2018-11-28 13:13:59,424 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:13:59,425 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_316a15f6-07b9-40c5-9b55-8e6f70017071/sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-11-28 13:13:59,434 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_316a15f6-07b9-40c5-9b55-8e6f70017071/bin-2019/uautomizer/data/7b6ab62c5/ecd0a7582068441aa38c181570f06424/FLAG79ed8ebbd [2018-11-28 13:13:59,443 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_316a15f6-07b9-40c5-9b55-8e6f70017071/bin-2019/uautomizer/data/7b6ab62c5/ecd0a7582068441aa38c181570f06424 [2018-11-28 13:13:59,444 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:13:59,445 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 13:13:59,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:13:59,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:13:59,448 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:13:59,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:13:59" (1/1) ... [2018-11-28 13:13:59,451 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 01:13:59, skipping insertion in model container [2018-11-28 13:13:59,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:13:59" (1/1) ... [2018-11-28 13:13:59,457 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:13:59,483 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:13:59,659 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:13:59,667 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:13:59,736 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:13:59,759 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:13:59,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:59 WrapperNode [2018-11-28 13:13:59,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:13:59,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:13:59,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:13:59,760 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:13:59,767 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:59" (1/1) ... [2018-11-28 13:13:59,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:59" (1/1) ... [2018-11-28 13:13:59,778 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:59" (1/1) ... [2018-11-28 13:13:59,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:59" (1/1) ... [2018-11-28 13:13:59,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:59" (1/1) ... [2018-11-28 13:13:59,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:59" (1/1) ... [2018-11-28 13:13:59,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:59" (1/1) ... [2018-11-28 13:13:59,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:13:59,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:13:59,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:13:59,797 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:13:59,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_316a15f6-07b9-40c5-9b55-8e6f70017071/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 13:13:59,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 13:13:59,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:13:59,832 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 13:13:59,832 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 13:13:59,832 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrspn [2018-11-28 13:13:59,832 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 13:13:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 13:13:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 13:13:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 13:13:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 13:13:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 13:13:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 13:13:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 13:13:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 13:13:59,832 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 13:13:59,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 13:13:59,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 13:13:59,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 13:13:59,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 13:13:59,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 13:13:59,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 13:13:59,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 13:13:59,833 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 13:13:59,833 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 13:13:59,833 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 13:13:59,833 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 13:13:59,833 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 13:13:59,834 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 13:13:59,834 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 13:13:59,834 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 13:13:59,834 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 13:13:59,834 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 13:13:59,834 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 13:13:59,834 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 13:13:59,834 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 13:13:59,834 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 13:13:59,834 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 13:13:59,834 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 13:13:59,835 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 13:13:59,835 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 13:13:59,835 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 13:13:59,835 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 13:13:59,835 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 13:13:59,835 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 13:13:59,835 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 13:13:59,835 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 13:13:59,835 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 13:13:59,836 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 13:13:59,836 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 13:13:59,836 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 13:13:59,836 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 13:13:59,836 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 13:13:59,836 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 13:13:59,836 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 13:13:59,836 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 13:13:59,836 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 13:13:59,837 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 13:13:59,837 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 13:13:59,837 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 13:13:59,837 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 13:13:59,837 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 13:13:59,837 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 13:13:59,837 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 13:13:59,837 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 13:13:59,837 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 13:13:59,838 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 13:13:59,838 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 13:13:59,838 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 13:13:59,838 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 13:13:59,838 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 13:13:59,838 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 13:13:59,838 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 13:13:59,838 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 13:13:59,838 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 13:13:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 13:13:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 13:13:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 13:13:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 13:13:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 13:13:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 13:13:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 13:13:59,840 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 13:13:59,840 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 13:13:59,840 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 13:13:59,840 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 13:13:59,840 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 13:13:59,840 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 13:13:59,840 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 13:13:59,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 13:13:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 13:13:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 13:13:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 13:13:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 13:13:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 13:13:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 13:13:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 13:13:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 13:13:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 13:13:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 13:13:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 13:13:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 13:13:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 13:13:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 13:13:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 13:13:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 13:13:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 13:13:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 13:13:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 13:13:59,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 13:13:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure cstrspn [2018-11-28 13:13:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:13:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 13:13:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:13:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:13:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:13:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 13:13:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:14:00,133 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:14:00,133 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 13:14:00,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:14:00 BoogieIcfgContainer [2018-11-28 13:14:00,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:14:00,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:14:00,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:14:00,137 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:14:00,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:13:59" (1/3) ... [2018-11-28 13:14:00,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@720b54b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:14:00, skipping insertion in model container [2018-11-28 13:14:00,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:13:59" (2/3) ... [2018-11-28 13:14:00,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@720b54b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:14:00, skipping insertion in model container [2018-11-28 13:14:00,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:14:00" (3/3) ... [2018-11-28 13:14:00,139 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-11-28 13:14:00,148 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:14:00,154 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-11-28 13:14:00,168 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-11-28 13:14:00,184 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:14:00,185 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:14:00,185 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 13:14:00,185 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:14:00,185 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:14:00,185 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:14:00,185 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:14:00,185 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:14:00,185 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:14:00,196 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-11-28 13:14:00,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 13:14:00,203 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:14:00,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:14:00,205 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 13:14:00,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:00,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1826097680, now seen corresponding path program 1 times [2018-11-28 13:14:00,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:00,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:00,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:00,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:00,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:00,333 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 13:14:00,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:14:00,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:14:00,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:14:00,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:14:00,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:14:00,347 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2018-11-28 13:14:00,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:14:00,393 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-28 13:14:00,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:14:00,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 13:14:00,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:14:00,400 INFO L225 Difference]: With dead ends: 48 [2018-11-28 13:14:00,400 INFO L226 Difference]: Without dead ends: 45 [2018-11-28 13:14:00,401 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 13:14:00,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-28 13:14:00,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-28 13:14:00,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 13:14:00,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-11-28 13:14:00,425 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 10 [2018-11-28 13:14:00,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:14:00,425 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-11-28 13:14:00,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:14:00,425 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-11-28 13:14:00,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 13:14:00,425 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:14:00,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:14:00,426 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 13:14:00,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:00,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1826097681, now seen corresponding path program 1 times [2018-11-28 13:14:00,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:00,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:00,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:00,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:00,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:00,477 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 13:14:00,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:14:00,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:14:00,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:14:00,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:14:00,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:14:00,480 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 4 states. [2018-11-28 13:14:00,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:14:00,498 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-28 13:14:00,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:14:00,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-28 13:14:00,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:14:00,499 INFO L225 Difference]: With dead ends: 44 [2018-11-28 13:14:00,499 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 13:14:00,500 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 13:14:00,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 13:14:00,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-28 13:14:00,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 13:14:00,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-28 13:14:00,504 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 10 [2018-11-28 13:14:00,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:14:00,505 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-28 13:14:00,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:14:00,505 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-28 13:14:00,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 13:14:00,505 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:14:00,505 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:14:00,506 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 13:14:00,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:00,506 INFO L82 PathProgramCache]: Analyzing trace with hash 774453223, now seen corresponding path program 1 times [2018-11-28 13:14:00,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:00,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:00,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:00,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:00,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:00,535 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 13:14:00,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:14:00,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:14:00,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:14:00,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:14:00,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:14:00,536 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 3 states. [2018-11-28 13:14:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:14:00,560 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-28 13:14:00,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:14:00,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-28 13:14:00,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:14:00,562 INFO L225 Difference]: With dead ends: 43 [2018-11-28 13:14:00,562 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 13:14:00,562 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 13:14:00,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 13:14:00,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-28 13:14:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 13:14:00,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-28 13:14:00,566 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2018-11-28 13:14:00,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:14:00,566 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-28 13:14:00,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:14:00,567 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-28 13:14:00,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 13:14:00,567 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:14:00,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:14:00,567 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 13:14:00,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:00,568 INFO L82 PathProgramCache]: Analyzing trace with hash 774453224, now seen corresponding path program 1 times [2018-11-28 13:14:00,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:00,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:00,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:00,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:00,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:00,616 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 13:14:00,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:14:00,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:14:00,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:14:00,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:14:00,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:14:00,617 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-11-28 13:14:00,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:14:00,627 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-28 13:14:00,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:14:00,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-28 13:14:00,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:14:00,628 INFO L225 Difference]: With dead ends: 42 [2018-11-28 13:14:00,628 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 13:14:00,628 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 13:14:00,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 13:14:00,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-28 13:14:00,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 13:14:00,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-28 13:14:00,632 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 11 [2018-11-28 13:14:00,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:14:00,632 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-28 13:14:00,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:14:00,632 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-28 13:14:00,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 13:14:00,633 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:14:00,633 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:14:00,633 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 13:14:00,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:00,633 INFO L82 PathProgramCache]: Analyzing trace with hash -828291016, now seen corresponding path program 1 times [2018-11-28 13:14:00,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:00,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:00,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:00,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:00,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:00,662 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 13:14:00,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:14:00,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:14:00,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:14:00,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:14:00,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:14:00,663 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2018-11-28 13:14:00,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:14:00,730 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-28 13:14:00,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:14:00,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-28 13:14:00,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:14:00,731 INFO L225 Difference]: With dead ends: 40 [2018-11-28 13:14:00,731 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 13:14:00,731 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 13:14:00,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 13:14:00,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-28 13:14:00,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 13:14:00,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-11-28 13:14:00,734 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 14 [2018-11-28 13:14:00,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:14:00,734 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-11-28 13:14:00,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:14:00,735 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-28 13:14:00,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 13:14:00,735 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:14:00,735 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:14:00,735 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 13:14:00,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:00,735 INFO L82 PathProgramCache]: Analyzing trace with hash -828291015, now seen corresponding path program 1 times [2018-11-28 13:14:00,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:00,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:00,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:00,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:00,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:00,821 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 13:14:00,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:14:00,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:14:00,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:14:00,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:14:00,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:14:00,823 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 7 states. [2018-11-28 13:14:00,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:14:00,915 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-11-28 13:14:00,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:14:00,916 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-11-28 13:14:00,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:14:00,918 INFO L225 Difference]: With dead ends: 62 [2018-11-28 13:14:00,918 INFO L226 Difference]: Without dead ends: 62 [2018-11-28 13:14:00,918 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 13:14:00,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-28 13:14:00,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-11-28 13:14:00,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 13:14:00,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-11-28 13:14:00,922 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 14 [2018-11-28 13:14:00,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:14:00,922 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-28 13:14:00,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:14:00,922 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-28 13:14:00,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 13:14:00,923 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:14:00,924 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 13:14:00,924 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 13:14:00,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:00,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1881695426, now seen corresponding path program 1 times [2018-11-28 13:14:00,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:00,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:00,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:00,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:00,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:00,965 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 13:14:00,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:14:00,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:14:00,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:14:00,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:14:00,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:14:00,966 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 6 states. [2018-11-28 13:14:01,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:14:01,025 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-28 13:14:01,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:14:01,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-28 13:14:01,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:14:01,026 INFO L225 Difference]: With dead ends: 43 [2018-11-28 13:14:01,026 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 13:14:01,026 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 13:14:01,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 13:14:01,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-11-28 13:14:01,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 13:14:01,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-11-28 13:14:01,029 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 18 [2018-11-28 13:14:01,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:14:01,030 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-28 13:14:01,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:14:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-28 13:14:01,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 13:14:01,030 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:14:01,030 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 13:14:01,031 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 13:14:01,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:01,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1881695425, now seen corresponding path program 1 times [2018-11-28 13:14:01,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:01,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:01,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:01,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:01,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:01,122 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 13:14:01,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:14:01,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:14:01,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:14:01,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:14:01,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:14:01,123 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 8 states. [2018-11-28 13:14:01,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:14:01,205 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2018-11-28 13:14:01,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:14:01,206 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-28 13:14:01,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:14:01,206 INFO L225 Difference]: With dead ends: 55 [2018-11-28 13:14:01,206 INFO L226 Difference]: Without dead ends: 55 [2018-11-28 13:14:01,207 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 13:14:01,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-28 13:14:01,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-11-28 13:14:01,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-28 13:14:01,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-11-28 13:14:01,209 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 18 [2018-11-28 13:14:01,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:14:01,209 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-11-28 13:14:01,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:14:01,209 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-28 13:14:01,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 13:14:01,210 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:14:01,210 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 13:14:01,210 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 13:14:01,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:01,211 INFO L82 PathProgramCache]: Analyzing trace with hash -145313269, now seen corresponding path program 1 times [2018-11-28 13:14:01,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:01,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:01,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:01,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:01,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:01,260 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 13:14:01,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:14:01,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:14:01,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:14:01,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:14:01,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:14:01,261 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 4 states. [2018-11-28 13:14:01,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:14:01,309 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-28 13:14:01,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:14:01,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-28 13:14:01,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:14:01,310 INFO L225 Difference]: With dead ends: 46 [2018-11-28 13:14:01,310 INFO L226 Difference]: Without dead ends: 41 [2018-11-28 13:14:01,310 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 13:14:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-28 13:14:01,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-28 13:14:01,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 13:14:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-28 13:14:01,313 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 20 [2018-11-28 13:14:01,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:14:01,314 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-28 13:14:01,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:14:01,314 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-28 13:14:01,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 13:14:01,315 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:14:01,315 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 13:14:01,315 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 13:14:01,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:01,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1476836758, now seen corresponding path program 1 times [2018-11-28 13:14:01,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:01,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:01,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:01,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:01,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:01,337 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 13:14:01,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:14:01,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:14:01,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:14:01,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:14:01,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:14:01,338 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2018-11-28 13:14:01,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:14:01,343 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-28 13:14:01,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:14:01,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 13:14:01,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:14:01,344 INFO L225 Difference]: With dead ends: 43 [2018-11-28 13:14:01,344 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 13:14:01,344 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 13:14:01,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 13:14:01,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-28 13:14:01,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 13:14:01,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-11-28 13:14:01,347 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 22 [2018-11-28 13:14:01,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:14:01,348 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-28 13:14:01,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:14:01,348 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-28 13:14:01,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 13:14:01,348 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:14:01,349 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 13:14:01,349 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 13:14:01,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:01,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1895057779, now seen corresponding path program 1 times [2018-11-28 13:14:01,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:01,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:01,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:01,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:01,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:01,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:14:01,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:14:01,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:14:01,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:14:01,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:14:01,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:14:01,492 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 8 states. [2018-11-28 13:14:01,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:14:01,579 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-11-28 13:14:01,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:14:01,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-28 13:14:01,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:14:01,581 INFO L225 Difference]: With dead ends: 51 [2018-11-28 13:14:01,581 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 13:14:01,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:14:01,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 13:14:01,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-28 13:14:01,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 13:14:01,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-28 13:14:01,583 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 24 [2018-11-28 13:14:01,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:14:01,583 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-28 13:14:01,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:14:01,583 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-28 13:14:01,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 13:14:01,584 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:14:01,584 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 13:14:01,584 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 13:14:01,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:01,584 INFO L82 PathProgramCache]: Analyzing trace with hash -99086927, now seen corresponding path program 1 times [2018-11-28 13:14:01,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:01,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:01,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:01,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:01,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:01,673 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 13:14:01,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:14:01,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 13:14:01,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 13:14:01,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:14:01,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:14:01,674 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 10 states. [2018-11-28 13:14:01,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:14:01,776 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-11-28 13:14:01,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:14:01,776 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-28 13:14:01,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:14:01,777 INFO L225 Difference]: With dead ends: 64 [2018-11-28 13:14:01,777 INFO L226 Difference]: Without dead ends: 64 [2018-11-28 13:14:01,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-11-28 13:14:01,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-28 13:14:01,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-11-28 13:14:01,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-28 13:14:01,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2018-11-28 13:14:01,781 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 24 [2018-11-28 13:14:01,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:14:01,781 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2018-11-28 13:14:01,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 13:14:01,782 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-11-28 13:14:01,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 13:14:01,782 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:14:01,782 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 13:14:01,782 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 13:14:01,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:01,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1687434829, now seen corresponding path program 1 times [2018-11-28 13:14:01,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:01,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:01,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:01,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:01,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:01,964 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 13:14:01,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:14:01,964 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_316a15f6-07b9-40c5-9b55-8e6f70017071/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 13:14:01,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:01,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:14:02,035 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 13:14:02,038 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 13:14:02,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:02,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:14:02,052 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 13:14:02,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-11-28 13:14:02,173 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 13:14:02,178 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 13:14:02,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:14:02,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:14:02,189 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 13:14:02,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-11-28 13:14:02,281 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 13:14:02,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:14:02,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-11-28 13:14:02,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 13:14:02,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 13:14:02,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-11-28 13:14:02,305 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 19 states. [2018-11-28 13:14:03,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:14:03,233 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-11-28 13:14:03,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 13:14:03,234 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-11-28 13:14:03,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:14:03,235 INFO L225 Difference]: With dead ends: 86 [2018-11-28 13:14:03,235 INFO L226 Difference]: Without dead ends: 86 [2018-11-28 13:14:03,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2018-11-28 13:14:03,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-28 13:14:03,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2018-11-28 13:14:03,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 13:14:03,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2018-11-28 13:14:03,239 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 24 [2018-11-28 13:14:03,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:14:03,240 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2018-11-28 13:14:03,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 13:14:03,240 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2018-11-28 13:14:03,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 13:14:03,240 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:14:03,240 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 13:14:03,241 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 13:14:03,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:03,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1403727160, now seen corresponding path program 1 times [2018-11-28 13:14:03,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:03,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:03,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:03,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:03,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:03,306 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 13:14:03,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:14:03,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 13:14:03,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 13:14:03,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:14:03,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:14:03,308 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 10 states. [2018-11-28 13:14:03,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:14:03,426 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2018-11-28 13:14:03,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 13:14:03,426 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-28 13:14:03,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:14:03,426 INFO L225 Difference]: With dead ends: 69 [2018-11-28 13:14:03,426 INFO L226 Difference]: Without dead ends: 51 [2018-11-28 13:14:03,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-11-28 13:14:03,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-28 13:14:03,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-11-28 13:14:03,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-28 13:14:03,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-28 13:14:03,429 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 25 [2018-11-28 13:14:03,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:14:03,429 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-28 13:14:03,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 13:14:03,429 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-28 13:14:03,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 13:14:03,429 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:14:03,430 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 13:14:03,430 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 13:14:03,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:03,430 INFO L82 PathProgramCache]: Analyzing trace with hash -2074932103, now seen corresponding path program 1 times [2018-11-28 13:14:03,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:03,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:03,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:03,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:03,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:03,741 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 13:14:03,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:14:03,741 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_316a15f6-07b9-40c5-9b55-8e6f70017071/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 13:14:03,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:03,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:14:03,777 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 13:14:03,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:03,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:14:03,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-11-28 13:14:03,798 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 13:14:03,800 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 13:14:03,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:03,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:14:03,807 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 13:14:03,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-11-28 13:14:03,835 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 13:14:03,837 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 13:14:03,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:03,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:14:03,847 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 13:14:03,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-11-28 13:14:05,088 WARN L180 SmtUtils]: Spent 679.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-28 13:14:05,186 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 13:14:05,191 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 13:14:05,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:05,249 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 13:14:05,250 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-28 13:14:05,316 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 34 treesize of output 32 [2018-11-28 13:14:05,317 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 13:14:05,381 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 28 treesize of output 20 [2018-11-28 13:14:05,382 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:05,385 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 24 treesize of output 16 [2018-11-28 13:14:05,386 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:05,442 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 13:14:05,442 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:05,504 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 13:14:05,504 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-11-28 13:14:05,579 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 13:14:05,580 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-28 13:14:05,648 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 13:14:05,649 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:05,650 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 13:14:05,651 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:05,652 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 13:14:05,653 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:05,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-28 13:14:05,747 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 13:14:05,748 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-11-28 13:14:05,823 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 13:14:05,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:14:05,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2018-11-28 13:14:05,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-28 13:14:05,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-28 13:14:05,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2018-11-28 13:14:05,847 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 31 states. [2018-11-28 13:14:07,761 WARN L180 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 94 DAG size of output: 60 [2018-11-28 13:14:09,890 WARN L180 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 97 DAG size of output: 66 [2018-11-28 13:14:10,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:14:10,085 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2018-11-28 13:14:10,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 13:14:10,086 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 27 [2018-11-28 13:14:10,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:14:10,087 INFO L225 Difference]: With dead ends: 109 [2018-11-28 13:14:10,087 INFO L226 Difference]: Without dead ends: 109 [2018-11-28 13:14:10,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=325, Invalid=1931, Unknown=0, NotChecked=0, Total=2256 [2018-11-28 13:14:10,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-28 13:14:10,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 75. [2018-11-28 13:14:10,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-28 13:14:10,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2018-11-28 13:14:10,091 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 27 [2018-11-28 13:14:10,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:14:10,091 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2018-11-28 13:14:10,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-28 13:14:10,091 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2018-11-28 13:14:10,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 13:14:10,092 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:14:10,092 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 13:14:10,092 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 13:14:10,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:10,092 INFO L82 PathProgramCache]: Analyzing trace with hash -729755417, now seen corresponding path program 2 times [2018-11-28 13:14:10,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:10,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:10,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:10,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:10,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:10,399 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 13:14:10,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:14:10,399 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_316a15f6-07b9-40c5-9b55-8e6f70017071/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 13:14:10,408 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:14:10,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:14:10,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:14:10,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:14:10,435 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 13:14:10,452 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 13:14:10,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:14:10,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:14:10,469 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 13:14:10,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-11-28 13:14:10,494 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 13:14:10,495 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 13:14:10,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:10,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:14:10,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:14:10,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-28 13:14:10,635 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 13:14:10,641 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 13:14:10,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:14:10,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:14:10,652 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 13:14:10,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-11-28 13:14:10,731 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 13:14:10,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:14:10,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-28 13:14:10,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 13:14:10,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 13:14:10,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-11-28 13:14:10,747 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand 21 states. [2018-11-28 13:14:11,167 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2018-11-28 13:14:11,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:14:11,503 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2018-11-28 13:14:11,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 13:14:11,504 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2018-11-28 13:14:11,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:14:11,504 INFO L225 Difference]: With dead ends: 92 [2018-11-28 13:14:11,504 INFO L226 Difference]: Without dead ends: 90 [2018-11-28 13:14:11,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=199, Invalid=923, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 13:14:11,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-28 13:14:11,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 44. [2018-11-28 13:14:11,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 13:14:11,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-28 13:14:11,507 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 30 [2018-11-28 13:14:11,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:14:11,507 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-28 13:14:11,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 13:14:11,507 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-28 13:14:11,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 13:14:11,508 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:14:11,508 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 13:14:11,508 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 13:14:11,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:11,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1281582983, now seen corresponding path program 2 times [2018-11-28 13:14:11,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:11,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:11,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:11,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:14:11,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:11,744 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 13:14:11,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:14:11,745 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_316a15f6-07b9-40c5-9b55-8e6f70017071/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 13:14:11,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:14:11,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:14:11,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:14:11,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:14:11,791 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 13:14:11,794 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 13:14:11,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:11,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:14:11,806 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 13:14:11,807 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:11,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:14:11,816 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-11-28 13:14:11,839 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 13:14:11,852 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 13:14:11,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:11,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:14:11,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:14:11,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-28 13:14:11,878 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 13:14:11,880 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 13:14:11,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:11,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:14:11,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:14:11,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-11-28 13:14:12,308 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 13:14:12,311 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 13:14:12,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:12,321 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 13:14:12,321 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 13:14:12,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:14:12,339 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 13:14:12,339 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:81 [2018-11-28 13:14:12,456 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 13:14:12,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:14:12,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18] total 26 [2018-11-28 13:14:12,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-28 13:14:12,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-28 13:14:12,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2018-11-28 13:14:12,471 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 27 states. [2018-11-28 13:14:15,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:14:15,701 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-11-28 13:14:15,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-28 13:14:15,702 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 40 [2018-11-28 13:14:15,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:14:15,702 INFO L225 Difference]: With dead ends: 106 [2018-11-28 13:14:15,702 INFO L226 Difference]: Without dead ends: 106 [2018-11-28 13:14:15,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1216 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=787, Invalid=4183, Unknown=0, NotChecked=0, Total=4970 [2018-11-28 13:14:15,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-28 13:14:15,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 60. [2018-11-28 13:14:15,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-28 13:14:15,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-28 13:14:15,705 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 40 [2018-11-28 13:14:15,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:14:15,705 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-28 13:14:15,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-28 13:14:15,706 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-28 13:14:15,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 13:14:15,706 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:14:15,706 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 13:14:15,713 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION]=== [2018-11-28 13:14:15,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:14:15,713 INFO L82 PathProgramCache]: Analyzing trace with hash 178768069, now seen corresponding path program 1 times [2018-11-28 13:14:15,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:14:15,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:14:15,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:15,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:14:15,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:14:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:15,904 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 13:14:15,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:14:15,905 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_316a15f6-07b9-40c5-9b55-8e6f70017071/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 13:14:15,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:14:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:14:15,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:14:15,944 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 13:14:15,951 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 13:14:15,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:15,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:14:15,961 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 13:14:15,965 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:15,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:14:15,973 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-11-28 13:14:15,987 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 13:14:15,989 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 13:14:15,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:15,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:14:15,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:14:15,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-28 13:14:16,011 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 13:14:16,013 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 13:14:16,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:16,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:14:16,020 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 13:14:16,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-11-28 13:14:18,427 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 13:14:18,476 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 13:14:18,478 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 48 treesize of output 41 [2018-11-28 13:14:18,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:18,512 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 13:14:18,512 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:18,545 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 37 treesize of output 35 [2018-11-28 13:14:18,546 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 13:14:18,586 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 40 treesize of output 47 [2018-11-28 13:14:18,587 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-11-28 13:14:18,650 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 13:14:18,650 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-11-28 13:14:18,716 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 24 [2018-11-28 13:14:18,716 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:18,718 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 39 treesize of output 29 [2018-11-28 13:14:18,718 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:18,719 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 38 treesize of output 28 [2018-11-28 13:14:18,720 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:18,778 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 13:14:18,778 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:18,779 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 13:14:18,780 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 13:14:18,837 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 13:14:18,838 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-28 13:14:18,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-28 13:14:18,927 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 13:14:18,928 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:60, output treesize:68 [2018-11-28 13:14:19,021 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 13:14:19,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:14:19,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 32 [2018-11-28 13:14:19,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-28 13:14:19,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-28 13:14:19,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=886, Unknown=0, NotChecked=0, Total=1056 [2018-11-28 13:14:19,036 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 33 states. [2018-11-28 13:14:23,317 WARN L180 SmtUtils]: Spent 860.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2018-11-28 13:14:25,060 WARN L180 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2018-11-28 13:14:29,616 WARN L180 SmtUtils]: Spent 4.49 s on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-11-28 13:14:31,813 WARN L180 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2018-11-28 13:14:32,619 WARN L180 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2018-11-28 13:14:37,267 WARN L180 SmtUtils]: Spent 4.57 s on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-11-28 13:14:37,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:14:37,603 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-11-28 13:14:37,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-28 13:14:37,603 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 59 [2018-11-28 13:14:37,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:14:37,603 INFO L225 Difference]: With dead ends: 84 [2018-11-28 13:14:37,603 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 13:14:37,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=1160, Invalid=4242, Unknown=0, NotChecked=0, Total=5402 [2018-11-28 13:14:37,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 13:14:37,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 13:14:37,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 13:14:37,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 13:14:37,605 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2018-11-28 13:14:37,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:14:37,605 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:14:37,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-28 13:14:37,605 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:14:37,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 13:14:37,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:14:37 BoogieIcfgContainer [2018-11-28 13:14:37,609 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:14:37,609 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:14:37,609 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:14:37,610 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:14:37,610 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:14:00" (3/4) ... [2018-11-28 13:14:37,612 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 13:14:37,618 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 13:14:37,618 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-28 13:14:37,618 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-28 13:14:37,618 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 13:14:37,619 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrspn [2018-11-28 13:14:37,621 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-28 13:14:37,622 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-28 13:14:37,622 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 13:14:37,653 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_316a15f6-07b9-40c5-9b55-8e6f70017071/bin-2019/uautomizer/witness.graphml [2018-11-28 13:14:37,653 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:14:37,654 INFO L168 Benchmark]: Toolchain (without parser) took 38208.92 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 394.3 MB). Free memory was 956.0 MB in the beginning and 1.0 GB in the end (delta: -52.2 MB). Peak memory consumption was 342.0 MB. Max. memory is 11.5 GB. [2018-11-28 13:14:37,654 INFO L168 Benchmark]: CDTParser took 0.12 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 13:14:37,654 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -185.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:14:37,655 INFO L168 Benchmark]: Boogie Preprocessor took 37.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-28 13:14:37,655 INFO L168 Benchmark]: RCFGBuilder took 336.50 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: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. [2018-11-28 13:14:37,655 INFO L168 Benchmark]: TraceAbstraction took 37475.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 241.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.4 MB). Peak memory consumption was 318.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:14:37,655 INFO L168 Benchmark]: Witness Printer took 43.80 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:14:37,657 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 313.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -185.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 336.50 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: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 37475.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 241.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.4 MB). Peak memory consumption was 318.5 MB. Max. memory is 11.5 GB. * Witness Printer took 43.80 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 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 - PositiveResult [Line: 566]: 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: 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: 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: 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: 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 - 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, 37.4s OverallTime, 18 OverallIterations, 4 TraceHistogramMax, 28.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 535 SDtfs, 1815 SDslu, 1995 SDs, 0 SdLazy, 3296 SolverSat, 392 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 463 GetRequests, 139 SyntacticMatches, 6 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2743 ImplicationChecksByTransitivity, 30.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=15, 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, 18 MinimizatonAttempts, 178 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 581 NumberOfCodeBlocks, 581 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 558 ConstructedInterpolants, 106 QuantifiedInterpolants, 321757 SizeOfPredicates, 74 NumberOfNonLiveVariables, 850 ConjunctsInSsa, 194 ConjunctsInUnsatCore, 23 InterpolantComputations, 13 PerfectInterpolantSequences, 75/174 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...