./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 bd1b17fffb471392e4e5cb414f885f337c434a14 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 22:43:18,091 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 22:43:18,093 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 22:43:18,114 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 22:43:18,114 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 22:43:18,115 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 22:43:18,117 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 22:43:18,119 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 22:43:18,121 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 22:43:18,122 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 22:43:18,123 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 22:43:18,123 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 22:43:18,125 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 22:43:18,125 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 22:43:18,127 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 22:43:18,128 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 22:43:18,129 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 22:43:18,130 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 22:43:18,133 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 22:43:18,134 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 22:43:18,136 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 22:43:18,137 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 22:43:18,140 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 22:43:18,140 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 22:43:18,140 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 22:43:18,141 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 22:43:18,142 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 22:43:18,144 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 22:43:18,144 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 22:43:18,146 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 22:43:18,146 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 22:43:18,147 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 22:43:18,147 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 22:43:18,147 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 22:43:18,149 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 22:43:18,150 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 22:43:18,150 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 22:43:18,170 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 22:43:18,170 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 22:43:18,171 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 22:43:18,171 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 22:43:18,172 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 22:43:18,172 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 22:43:18,172 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 22:43:18,172 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 22:43:18,172 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 22:43:18,173 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 22:43:18,174 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 22:43:18,174 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 22:43:18,174 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 22:43:18,174 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 22:43:18,174 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 22:43:18,174 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 22:43:18,175 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 22:43:18,175 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 22:43:18,175 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 22:43:18,175 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 22:43:18,175 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 22:43:18,177 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 22:43:18,177 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 22:43:18,177 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:43:18,177 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 22:43:18,178 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 22:43:18,178 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 22:43:18,178 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 22:43:18,178 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> bd1b17fffb471392e4e5cb414f885f337c434a14 [2018-11-28 22:43:18,216 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 22:43:18,229 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 22:43:18,233 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 22:43:18,235 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 22:43:18,235 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 22:43:18,236 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:43:18,316 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0ba301a0/25c84b1f642040cbbc0b6487c590f8ac/FLAG7821c6a65 [2018-11-28 22:43:18,833 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 22:43:18,836 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:43:18,850 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0ba301a0/25c84b1f642040cbbc0b6487c590f8ac/FLAG7821c6a65 [2018-11-28 22:43:19,141 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0ba301a0/25c84b1f642040cbbc0b6487c590f8ac [2018-11-28 22:43:19,149 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 22:43:19,150 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 22:43:19,151 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 22:43:19,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 22:43:19,155 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 22:43:19,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:43:19" (1/1) ... [2018-11-28 22:43:19,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57c5a119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:19, skipping insertion in model container [2018-11-28 22:43:19,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:43:19" (1/1) ... [2018-11-28 22:43:19,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 22:43:19,216 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 22:43:19,563 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:43:19,577 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 22:43:19,644 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:43:19,709 INFO L195 MainTranslator]: Completed translation [2018-11-28 22:43:19,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:19 WrapperNode [2018-11-28 22:43:19,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 22:43:19,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 22:43:19,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 22:43:19,712 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 22:43:19,801 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:19" (1/1) ... [2018-11-28 22:43:19,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:19" (1/1) ... [2018-11-28 22:43:19,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:19" (1/1) ... [2018-11-28 22:43:19,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:19" (1/1) ... [2018-11-28 22:43:19,839 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:19" (1/1) ... [2018-11-28 22:43:19,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:19" (1/1) ... [2018-11-28 22:43:19,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:19" (1/1) ... [2018-11-28 22:43:19,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 22:43:19,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 22:43:19,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 22:43:19,870 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 22:43:19,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 22:43:19,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 22:43:19,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 22:43:19,947 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-28 22:43:19,947 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-28 22:43:19,947 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcmp [2018-11-28 22:43:19,947 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 22:43:19,947 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-28 22:43:19,947 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-28 22:43:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 22:43:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 22:43:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 22:43:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 22:43:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 22:43:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 22:43:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 22:43:19,949 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 22:43:19,949 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 22:43:19,949 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 22:43:19,949 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 22:43:19,949 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 22:43:19,949 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 22:43:19,949 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 22:43:19,950 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 22:43:19,950 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 22:43:19,950 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 22:43:19,950 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 22:43:19,950 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 22:43:19,950 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 22:43:19,951 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 22:43:19,952 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 22:43:19,952 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 22:43:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 22:43:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 22:43:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 22:43:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 22:43:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 22:43:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 22:43:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 22:43:19,953 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 22:43:19,955 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 22:43:19,955 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 22:43:19,955 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 22:43:19,955 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 22:43:19,955 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 22:43:19,955 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 22:43:19,955 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 22:43:19,956 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 22:43:19,956 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 22:43:19,956 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 22:43:19,956 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 22:43:19,956 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 22:43:19,956 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 22:43:19,956 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 22:43:19,956 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 22:43:19,957 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 22:43:19,958 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 22:43:19,958 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 22:43:19,958 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 22:43:19,959 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 22:43:19,959 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 22:43:19,959 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 22:43:19,959 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 22:43:19,959 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 22:43:19,959 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 22:43:19,959 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 22:43:19,961 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 22:43:19,961 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 22:43:19,961 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 22:43:19,961 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 22:43:19,961 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 22:43:19,961 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 22:43:19,961 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 22:43:19,962 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 22:43:19,962 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 22:43:19,962 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 22:43:19,962 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 22:43:19,962 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 22:43:19,962 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 22:43:19,962 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 22:43:19,962 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 22:43:19,964 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 22:43:19,964 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 22:43:19,964 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 22:43:19,965 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 22:43:19,965 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 22:43:19,965 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 22:43:19,965 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 22:43:19,965 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 22:43:19,965 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 22:43:19,966 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 22:43:19,967 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 22:43:19,967 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 22:43:19,967 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 22:43:19,967 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 22:43:19,967 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 22:43:19,968 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 22:43:19,968 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 22:43:19,968 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 22:43:19,968 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 22:43:19,968 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 22:43:19,968 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 22:43:19,968 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 22:43:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 22:43:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 22:43:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 22:43:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 22:43:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 22:43:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 22:43:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 22:43:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcmp [2018-11-28 22:43:19,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 22:43:19,972 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 22:43:19,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 22:43:19,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 22:43:19,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 22:43:19,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 22:43:19,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 22:43:20,741 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 22:43:20,742 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 22:43:20,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:43:20 BoogieIcfgContainer [2018-11-28 22:43:20,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 22:43:20,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 22:43:20,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 22:43:20,748 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 22:43:20,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:43:19" (1/3) ... [2018-11-28 22:43:20,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f78dc3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:43:20, skipping insertion in model container [2018-11-28 22:43:20,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:43:19" (2/3) ... [2018-11-28 22:43:20,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f78dc3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:43:20, skipping insertion in model container [2018-11-28 22:43:20,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:43:20" (3/3) ... [2018-11-28 22:43:20,753 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-11-28 22:43:20,764 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 22:43:20,773 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-11-28 22:43:20,792 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-11-28 22:43:20,825 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 22:43:20,825 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 22:43:20,826 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 22:43:20,826 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 22:43:20,826 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 22:43:20,826 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 22:43:20,826 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 22:43:20,827 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 22:43:20,827 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 22:43:20,843 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-11-28 22:43:20,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:43:20,853 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:20,855 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:20,857 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:20,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:20,865 INFO L82 PathProgramCache]: Analyzing trace with hash 290107144, now seen corresponding path program 1 times [2018-11-28 22:43:20,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:20,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:20,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:20,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:20,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:21,083 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 22:43:21,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:21,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:43:21,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:43:21,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:43:21,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:43:21,106 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2018-11-28 22:43:21,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:21,295 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-11-28 22:43:21,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:43:21,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 22:43:21,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:21,307 INFO L225 Difference]: With dead ends: 47 [2018-11-28 22:43:21,307 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 22:43:21,309 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 22:43:21,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 22:43:21,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-28 22:43:21,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 22:43:21,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-28 22:43:21,347 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 10 [2018-11-28 22:43:21,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:21,348 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-28 22:43:21,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:43:21,348 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-28 22:43:21,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:43:21,349 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:21,349 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:21,349 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:21,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:21,351 INFO L82 PathProgramCache]: Analyzing trace with hash 290107145, now seen corresponding path program 1 times [2018-11-28 22:43:21,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:21,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:21,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:21,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:21,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:21,446 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 22:43:21,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:21,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:43:21,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:43:21,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:43:21,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:43:21,450 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 4 states. [2018-11-28 22:43:21,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:21,520 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-11-28 22:43:21,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:43:21,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-28 22:43:21,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:21,522 INFO L225 Difference]: With dead ends: 43 [2018-11-28 22:43:21,522 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 22:43:21,523 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 22:43:21,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 22:43:21,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-28 22:43:21,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 22:43:21,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-28 22:43:21,530 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 10 [2018-11-28 22:43:21,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:21,531 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-28 22:43:21,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:43:21,531 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-28 22:43:21,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 22:43:21,531 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:21,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:21,533 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:21,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:21,533 INFO L82 PathProgramCache]: Analyzing trace with hash 403386909, now seen corresponding path program 1 times [2018-11-28 22:43:21,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:21,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:21,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:21,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:21,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:21,592 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 22:43:21,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:21,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:43:21,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:43:21,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:43:21,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:43:21,595 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 3 states. [2018-11-28 22:43:21,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:21,687 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-28 22:43:21,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:43:21,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-28 22:43:21,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:21,689 INFO L225 Difference]: With dead ends: 42 [2018-11-28 22:43:21,689 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 22:43:21,690 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 22:43:21,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 22:43:21,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-28 22:43:21,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 22:43:21,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-28 22:43:21,696 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 11 [2018-11-28 22:43:21,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:21,696 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-28 22:43:21,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:43:21,696 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-28 22:43:21,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 22:43:21,697 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:21,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:21,697 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:21,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:21,698 INFO L82 PathProgramCache]: Analyzing trace with hash 403386910, now seen corresponding path program 1 times [2018-11-28 22:43:21,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:21,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:21,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:21,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:21,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:21,789 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 22:43:21,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:21,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:43:21,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:43:21,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:43:21,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:43:21,793 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 4 states. [2018-11-28 22:43:21,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:21,841 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-28 22:43:21,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:43:21,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-28 22:43:21,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:21,843 INFO L225 Difference]: With dead ends: 41 [2018-11-28 22:43:21,844 INFO L226 Difference]: Without dead ends: 41 [2018-11-28 22:43:21,844 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 22:43:21,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-28 22:43:21,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-28 22:43:21,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 22:43:21,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-28 22:43:21,850 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 11 [2018-11-28 22:43:21,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:21,850 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-28 22:43:21,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:43:21,851 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-28 22:43:21,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 22:43:21,851 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:21,851 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:21,852 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:21,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:21,852 INFO L82 PathProgramCache]: Analyzing trace with hash -19041991, now seen corresponding path program 1 times [2018-11-28 22:43:21,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:21,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:21,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:21,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:21,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:21,934 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 22:43:21,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:21,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:43:21,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:43:21,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:43:21,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:43:21,936 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2018-11-28 22:43:22,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:22,129 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-28 22:43:22,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:43:22,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-28 22:43:22,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:22,131 INFO L225 Difference]: With dead ends: 38 [2018-11-28 22:43:22,132 INFO L226 Difference]: Without dead ends: 38 [2018-11-28 22:43:22,132 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 22:43:22,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-28 22:43:22,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-28 22:43:22,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 22:43:22,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-28 22:43:22,138 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 14 [2018-11-28 22:43:22,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:22,139 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-28 22:43:22,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:43:22,139 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-28 22:43:22,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 22:43:22,140 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:22,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:22,140 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:22,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:22,140 INFO L82 PathProgramCache]: Analyzing trace with hash -19041990, now seen corresponding path program 1 times [2018-11-28 22:43:22,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:22,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:22,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:22,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:22,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:22,331 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 22:43:22,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:22,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:43:22,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:43:22,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:43:22,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:43:22,333 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 7 states. [2018-11-28 22:43:22,568 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-28 22:43:22,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:22,926 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-11-28 22:43:22,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:43:22,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-11-28 22:43:22,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:22,930 INFO L225 Difference]: With dead ends: 57 [2018-11-28 22:43:22,930 INFO L226 Difference]: Without dead ends: 57 [2018-11-28 22:43:22,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:43:22,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-28 22:43:22,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2018-11-28 22:43:22,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 22:43:22,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-11-28 22:43:22,939 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 14 [2018-11-28 22:43:22,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:22,940 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-11-28 22:43:22,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:43:22,940 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-28 22:43:22,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 22:43:22,941 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:22,941 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 22:43:22,943 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:22,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:22,943 INFO L82 PathProgramCache]: Analyzing trace with hash -2083064079, now seen corresponding path program 1 times [2018-11-28 22:43:22,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:22,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:22,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:22,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:22,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:22,993 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 22:43:22,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:22,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:43:22,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:43:22,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:43:22,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:43:22,994 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 3 states. [2018-11-28 22:43:23,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:23,030 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-11-28 22:43:23,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:43:23,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-28 22:43:23,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:23,033 INFO L225 Difference]: With dead ends: 48 [2018-11-28 22:43:23,033 INFO L226 Difference]: Without dead ends: 48 [2018-11-28 22:43:23,033 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 22:43:23,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-28 22:43:23,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-28 22:43:23,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-28 22:43:23,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-11-28 22:43:23,040 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 18 [2018-11-28 22:43:23,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:23,041 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-11-28 22:43:23,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:43:23,041 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-11-28 22:43:23,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 22:43:23,043 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:23,043 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 22:43:23,043 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:23,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:23,043 INFO L82 PathProgramCache]: Analyzing trace with hash -2083073153, now seen corresponding path program 1 times [2018-11-28 22:43:23,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:23,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:23,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:23,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:23,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:23,117 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 22:43:23,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:23,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:43:23,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:43:23,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:43:23,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:43:23,118 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 5 states. [2018-11-28 22:43:23,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:23,273 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-28 22:43:23,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:43:23,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-28 22:43:23,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:23,275 INFO L225 Difference]: With dead ends: 46 [2018-11-28 22:43:23,276 INFO L226 Difference]: Without dead ends: 46 [2018-11-28 22:43:23,276 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 22:43:23,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-28 22:43:23,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-28 22:43:23,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 22:43:23,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-11-28 22:43:23,283 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 18 [2018-11-28 22:43:23,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:23,283 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-11-28 22:43:23,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:43:23,283 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-28 22:43:23,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 22:43:23,285 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:23,285 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 22:43:23,286 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:23,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:23,286 INFO L82 PathProgramCache]: Analyzing trace with hash -2083073152, now seen corresponding path program 1 times [2018-11-28 22:43:23,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:23,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:23,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:23,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:23,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:23,420 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 22:43:23,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:23,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:43:23,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:43:23,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:43:23,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:43:23,422 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 7 states. [2018-11-28 22:43:23,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:23,604 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-11-28 22:43:23,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:43:23,606 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-28 22:43:23,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:23,607 INFO L225 Difference]: With dead ends: 53 [2018-11-28 22:43:23,608 INFO L226 Difference]: Without dead ends: 53 [2018-11-28 22:43:23,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:43:23,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-28 22:43:23,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-11-28 22:43:23,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-28 22:43:23,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-28 22:43:23,613 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 18 [2018-11-28 22:43:23,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:23,613 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-28 22:43:23,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:43:23,613 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-28 22:43:23,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 22:43:23,614 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:23,614 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] [2018-11-28 22:43:23,614 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:23,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:23,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1150149187, now seen corresponding path program 1 times [2018-11-28 22:43:23,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:23,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:23,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:23,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:23,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:23,953 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 22:43:23,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:23,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 22:43:23,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 22:43:23,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 22:43:23,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:43:23,954 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 9 states. [2018-11-28 22:43:24,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:24,160 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-11-28 22:43:24,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 22:43:24,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-11-28 22:43:24,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:24,163 INFO L225 Difference]: With dead ends: 69 [2018-11-28 22:43:24,163 INFO L226 Difference]: Without dead ends: 69 [2018-11-28 22:43:24,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-11-28 22:43:24,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-28 22:43:24,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-11-28 22:43:24,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-28 22:43:24,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2018-11-28 22:43:24,170 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 21 [2018-11-28 22:43:24,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:24,171 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2018-11-28 22:43:24,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 22:43:24,171 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-11-28 22:43:24,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 22:43:24,172 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:24,172 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] [2018-11-28 22:43:24,173 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:24,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:24,173 INFO L82 PathProgramCache]: Analyzing trace with hash -129714491, now seen corresponding path program 1 times [2018-11-28 22:43:24,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:24,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:24,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:24,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:24,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:24,565 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 22:43:24,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:43:24,565 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 22:43:24,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:24,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:43:24,762 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 11 treesize of output 8 [2018-11-28 22:43:24,769 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 8 treesize of output 7 [2018-11-28 22:43:24,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:24,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:24,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:24,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-28 22:43:25,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-11-28 22:43:25,480 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 26 treesize of output 19 [2018-11-28 22:43:25,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:25,506 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 19 treesize of output 12 [2018-11-28 22:43:25,506 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:25,598 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 22 treesize of output 12 [2018-11-28 22:43:25,599 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:25,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:43:25,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:25,657 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:30, output treesize:8 [2018-11-28 22:43:25,751 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 22:43:25,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 22:43:25,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 21 [2018-11-28 22:43:25,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 22:43:25,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 22:43:25,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-11-28 22:43:25,772 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand 21 states. [2018-11-28 22:43:26,522 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-11-28 22:43:27,742 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-11-28 22:43:28,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:28,423 INFO L93 Difference]: Finished difference Result 146 states and 162 transitions. [2018-11-28 22:43:28,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-28 22:43:28,424 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-11-28 22:43:28,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:28,426 INFO L225 Difference]: With dead ends: 146 [2018-11-28 22:43:28,426 INFO L226 Difference]: Without dead ends: 146 [2018-11-28 22:43:28,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=305, Invalid=1587, Unknown=0, NotChecked=0, Total=1892 [2018-11-28 22:43:28,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-28 22:43:28,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 95. [2018-11-28 22:43:28,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-28 22:43:28,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2018-11-28 22:43:28,436 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 21 [2018-11-28 22:43:28,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:28,440 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2018-11-28 22:43:28,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 22:43:28,440 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2018-11-28 22:43:28,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 22:43:28,441 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:28,441 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:28,443 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:28,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:28,444 INFO L82 PathProgramCache]: Analyzing trace with hash -824303671, now seen corresponding path program 1 times [2018-11-28 22:43:28,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:28,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:28,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:28,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:28,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:28,801 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 11 [2018-11-28 22:43:29,135 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-11-28 22:43:29,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:29,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:43:29,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 22:43:29,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:29,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:43:29,480 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 22:43:29,483 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 22:43:29,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:29,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:29,501 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 22:43:29,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-11-28 22:43:30,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2018-11-28 22:43:30,128 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 22:43:30,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:43:30,200 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 25 treesize of output 31 [2018-11-28 22:43:30,203 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-28 22:43:30,283 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 19 treesize of output 12 [2018-11-28 22:43:30,284 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:30,287 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 23 treesize of output 16 [2018-11-28 22:43:30,287 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:30,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-28 22:43:30,414 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 22:43:30,415 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:49, output treesize:66 [2018-11-28 22:43:30,577 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:30,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:43:30,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2018-11-28 22:43:30,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-28 22:43:30,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-28 22:43:30,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-11-28 22:43:30,598 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand 23 states. [2018-11-28 22:43:31,793 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2018-11-28 22:43:31,968 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2018-11-28 22:43:33,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:33,022 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2018-11-28 22:43:33,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 22:43:33,023 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2018-11-28 22:43:33,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:33,025 INFO L225 Difference]: With dead ends: 124 [2018-11-28 22:43:33,025 INFO L226 Difference]: Without dead ends: 124 [2018-11-28 22:43:33,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=213, Invalid=1047, Unknown=0, NotChecked=0, Total=1260 [2018-11-28 22:43:33,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-28 22:43:33,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 93. [2018-11-28 22:43:33,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-28 22:43:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2018-11-28 22:43:33,040 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 25 [2018-11-28 22:43:33,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:33,040 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2018-11-28 22:43:33,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-28 22:43:33,040 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2018-11-28 22:43:33,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 22:43:33,042 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:33,043 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 22:43:33,043 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:33,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:33,044 INFO L82 PathProgramCache]: Analyzing trace with hash -67902013, now seen corresponding path program 1 times [2018-11-28 22:43:33,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:33,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:33,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:33,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:33,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:33,266 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 22:43:33,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:43:33,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:43:33,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:43:33,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:43:33,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:43:33,267 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 4 states. [2018-11-28 22:43:33,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:33,358 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2018-11-28 22:43:33,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:43:33,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-28 22:43:33,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:33,359 INFO L225 Difference]: With dead ends: 92 [2018-11-28 22:43:33,360 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 22:43:33,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:43:33,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 22:43:33,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-28 22:43:33,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 22:43:33,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-11-28 22:43:33,370 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 27 [2018-11-28 22:43:33,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:33,371 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-11-28 22:43:33,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:43:33,371 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-11-28 22:43:33,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 22:43:33,375 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:33,375 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:33,375 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:33,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:33,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1792296282, now seen corresponding path program 1 times [2018-11-28 22:43:33,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:33,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:33,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:33,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:33,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:34,151 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:34,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:43:34,151 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 22:43:34,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:34,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:43:34,319 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 22:43:34,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 22:43:34,346 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 22:43:34,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:34,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:34,372 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 22:43:34,372 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:34,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:34,378 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-11-28 22:43:34,401 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 22:43:34,402 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 22:43:34,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:34,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:34,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:34,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-28 22:43:34,455 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 22:43:34,458 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 22:43:34,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:34,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:34,479 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 22:43:34,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-11-28 22:43:34,683 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 31 treesize of output 29 [2018-11-28 22:43:34,686 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 10 treesize of output 1 [2018-11-28 22:43:34,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:34,699 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 15 treesize of output 12 [2018-11-28 22:43:34,700 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 22:43:34,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:43:34,713 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 22:43:34,714 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-11-28 22:43:34,810 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:34,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:43:34,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 19 [2018-11-28 22:43:34,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 22:43:34,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 22:43:34,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-11-28 22:43:34,831 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 20 states. [2018-11-28 22:43:35,157 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 32 [2018-11-28 22:43:35,369 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2018-11-28 22:43:35,529 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2018-11-28 22:43:35,697 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2018-11-28 22:43:36,394 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2018-11-28 22:43:36,565 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2018-11-28 22:43:36,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:36,787 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-28 22:43:36,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 22:43:36,788 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2018-11-28 22:43:36,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:36,789 INFO L225 Difference]: With dead ends: 44 [2018-11-28 22:43:36,790 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 22:43:36,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2018-11-28 22:43:36,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 22:43:36,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-11-28 22:43:36,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 22:43:36,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-11-28 22:43:36,796 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 28 [2018-11-28 22:43:36,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:36,797 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-28 22:43:36,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 22:43:36,803 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-28 22:43:36,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 22:43:36,805 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:43:36,805 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:43:36,805 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, cstrcmpErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-28 22:43:36,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:43:36,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1308190816, now seen corresponding path program 2 times [2018-11-28 22:43:36,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:43:36,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:43:36,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:36,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:43:36,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:43:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:43:37,475 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 27 [2018-11-28 22:43:37,828 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:37,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:43:37,828 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 22:43:37,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:43:37,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 22:43:37,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:43:37,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:43:37,909 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 22:43:38,031 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 22:43:38,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:43:38,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:43:38,058 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 22:43:38,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-11-28 22:43:38,079 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 22:43:38,081 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 22:43:38,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:38,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:38,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:43:38,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-28 22:43:38,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2018-11-28 22:43:38,644 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 31 treesize of output 24 [2018-11-28 22:43:38,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:43:38,672 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 24 treesize of output 22 [2018-11-28 22:43:38,673 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 22:43:38,764 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 27 treesize of output 35 [2018-11-28 22:43:38,765 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-11-28 22:43:38,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-28 22:43:38,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 22:43:38,883 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:98 [2018-11-28 22:43:39,051 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:43:39,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:43:39,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-28 22:43:39,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-28 22:43:39,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-28 22:43:39,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2018-11-28 22:43:39,071 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 25 states. [2018-11-28 22:43:39,873 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2018-11-28 22:43:40,227 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2018-11-28 22:43:40,518 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2018-11-28 22:43:40,865 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 57 [2018-11-28 22:43:41,169 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-11-28 22:43:41,875 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-11-28 22:43:42,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:43:42,008 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-28 22:43:42,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-28 22:43:42,009 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 32 [2018-11-28 22:43:42,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:43:42,010 INFO L225 Difference]: With dead ends: 41 [2018-11-28 22:43:42,010 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 22:43:42,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=317, Invalid=1663, Unknown=0, NotChecked=0, Total=1980 [2018-11-28 22:43:42,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 22:43:42,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 22:43:42,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 22:43:42,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 22:43:42,011 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-11-28 22:43:42,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:43:42,014 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 22:43:42,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-28 22:43:42,014 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 22:43:42,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 22:43:42,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:43:42 BoogieIcfgContainer [2018-11-28 22:43:42,020 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 22:43:42,021 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 22:43:42,021 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 22:43:42,021 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 22:43:42,023 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:43:20" (3/4) ... [2018-11-28 22:43:42,026 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 22:43:42,032 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 22:43:42,032 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcmp [2018-11-28 22:43:42,033 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-28 22:43:42,033 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-28 22:43:42,033 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 22:43:42,038 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2018-11-28 22:43:42,039 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-28 22:43:42,039 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 22:43:42,105 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 22:43:42,105 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 22:43:42,106 INFO L168 Benchmark]: Toolchain (without parser) took 22956.51 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 338.7 MB). Free memory was 947.3 MB in the beginning and 1.3 GB in the end (delta: -373.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:43:42,108 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:43:42,108 INFO L168 Benchmark]: CACSL2BoogieTranslator took 559.32 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 925.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-28 22:43:42,109 INFO L168 Benchmark]: Boogie Preprocessor took 158.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-28 22:43:42,111 INFO L168 Benchmark]: RCFGBuilder took 872.38 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: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. [2018-11-28 22:43:42,112 INFO L168 Benchmark]: TraceAbstraction took 21277.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 199.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -254.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:43:42,112 INFO L168 Benchmark]: Witness Printer took 84.34 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 11.5 GB. [2018-11-28 22:43:42,117 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 559.32 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 925.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 158.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 872.38 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: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21277.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 199.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -254.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 84.34 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: 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: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: 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: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 562]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 562]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 563]: 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, 54 locations, 15 error locations. SAFE Result, 21.2s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 11.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 478 SDtfs, 998 SDslu, 1878 SDs, 0 SdLazy, 2102 SolverSat, 196 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 83 SyntacticMatches, 5 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 875 ImplicationChecksByTransitivity, 12.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=11, 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.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 105 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 365 ConstructedInterpolants, 31 QuantifiedInterpolants, 87988 SizeOfPredicates, 48 NumberOfNonLiveVariables, 554 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 9/66 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...